Open Access
Translator Disclaimer
2013 Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem
Ho-Yoeng Yun, Suk-Jae Jeong, Kyung-Sup Kim
J. Appl. Math. 2013(SI09): 1-8 (2013). DOI: 10.1155/2013/123738

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.

Citation

Download Citation

Ho-Yoeng Yun. Suk-Jae Jeong. Kyung-Sup Kim. "Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem." J. Appl. Math. 2013 (SI09) 1 - 8, 2013. https://doi.org/10.1155/2013/123738

Information

Published: 2013
First available in Project Euclid: 14 March 2014

MathSciNet: MR3138939
Digital Object Identifier: 10.1155/2013/123738

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
8 PAGES


SHARE
Vol.2013 • No. SI09 • 2013
Back to Top