Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem

Ho-Yoeng Yun, Suk-Jae Jeong and Kyung-Sup Kim

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS‐ACO) to effectively solve the Traveling Salesman Problem (TSP). The TSP, in general, is well known as an NP‐complete problem, whose computational complexity increases exponentially by increasing the number of cities. In our algorithm, Ant Colony Optimization (ACO) is used to search the local optimum in the solution space, followed by the use of the Harmony Search to escape the local optimum determined by the ACO and to move towards a global optimum. Experiments were performed to validate the efficiency of our algorithm through a comparison with other algorithms and the optimum solutions presented in the TSPLIB. The results indicate that our algorithm is capable of generating the optimum solution for most instances in the TSPLIB; moreover, our algorithm found better solutions in two cases (kroB100 and pr144) when compared with the optimum solution presented in the TSPLIB.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/123738

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:123738

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().