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:

496
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

344
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

3

Information Journal Paper

Title

SOLVING THE TRAVELING SALESMAN PROBLEM BY AN EFFICIENT HYBRID METAHEURISTIC ALGORITHM

Pages

  75-84

Abstract

 The TRAVELING SALESMAN PROBLEM (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-HARD PROBLEM, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. So, an efficient hybrid metaheuristic algorithm called ICATS is proposed in this paper. The first stage of the ICATS is to solve the TSP by the IMPERIALIST COMPETITIVE ALGORITHM (ICA), and then the TS is used for improving solutions. This process avoids the premature convergence and makes better solutions. Computational results on several standard instances of TSP show efficiency of the proposed algorithm compared with the genetic algorithm (GA), bee colony optimization (BCO), and particle swarm optimization (PSO).

Cites

References

Cite

APA: Copy

AHMADVAND, MOHAMMAD, YOUSEFIKHOSHBAKHT, MAJID, & MAHMOODI DARANI, NARGES. (2012). SOLVING THE TRAVELING SALESMAN PROBLEM BY AN EFFICIENT HYBRID METAHEURISTIC ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 3(3), 75-84. SID. https://sid.ir/paper/328705/en

Vancouver: Copy

AHMADVAND MOHAMMAD, YOUSEFIKHOSHBAKHT MAJID, MAHMOODI DARANI NARGES. SOLVING THE TRAVELING SALESMAN PROBLEM BY AN EFFICIENT HYBRID METAHEURISTIC ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2012;3(3):75-84. Available from: https://sid.ir/paper/328705/en

IEEE: Copy

MOHAMMAD AHMADVAND, MAJID YOUSEFIKHOSHBAKHT, and NARGES MAHMOODI DARANI, “SOLVING THE TRAVELING SALESMAN PROBLEM BY AN EFFICIENT HYBRID METAHEURISTIC ALGORITHM,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 3, no. 3, pp. 75–84, 2012, [Online]. Available: https://sid.ir/paper/328705/en

Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top