مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

279
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

157
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

2

Information Journal Paper

Title

AN EFFECTIVE GENETIC ALGORITHM FOR SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM

Pages

  73-79

Abstract

 The MULTIPLE TRAVELING SALESMAN PROBLEM (MTSP) involves scheduling m>1 salesmen to visit a set of n>m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper, a modified hybrid metaheuristic algorithm called GA2OPT for solving the MTSP is proposed. In this algorithm, at the first stage, the MTSP is solved by the modified GENETIC ALGORITHM (GA) in each iteration, and, at the second stage, the 2-OPT LOCAL SEARCH ALGORITHM is used for improving solutions for that iteration. The proposed algorithm was tested on a set of 6 benchmark instances from the TSPLIB and in all but four instances the best known solution was improved. For the rest instances, the quality of the produced solution deviates less than 0.01% from the best known solutions ever.

Cites

References

  • No record.

    • Cite

    APA: Copy

    SEDIGHPOUR, MOHAMMAD, YOUSEFIKHOSHBAKHT, MAJID, & MAHMOODI DARANI, NARGES. (2011). AN EFFECTIVE GENETIC ALGORITHM FOR SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 4(2 (8)), 73-79. SID. https://sid.ir/paper/634495/en

    Vancouver: Copy

    SEDIGHPOUR MOHAMMAD, YOUSEFIKHOSHBAKHT MAJID, MAHMOODI DARANI NARGES. AN EFFECTIVE GENETIC ALGORITHM FOR SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2011;4(2 (8)):73-79. Available from: https://sid.ir/paper/634495/en

    IEEE: Copy

    MOHAMMAD SEDIGHPOUR, MAJID YOUSEFIKHOSHBAKHT, and NARGES MAHMOODI DARANI, “AN EFFECTIVE GENETIC ALGORITHM FOR SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 4, no. 2 (8), pp. 73–79, 2011, [Online]. Available: https://sid.ir/paper/634495/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button