Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem
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...
Main Authors: | Ho-Yoeng Yun, Suk-Jae Jeong, Kyung-Sup Kim |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/123738 |
Similar Items
-
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
by: Fadl Dahan, et al.
Published: (2019-04-01) -
Solving the Traveling Salesman Problem by Ant Colony Optimization Algorithms with DNA Computing
by: Hung-Wei Huang, et al.
Published: (2004) -
Applying Ant Colony Optimization in Solving the Traveling Salesman Problem with Time Windows
by: Chun-Pin Mao, et al.
Published: (2006) -
Combining improved Genetic Algorithm and Ant Colony Optimization to solve the Traveling Salesman Problem
by: Jia-huei Chen, et al.
Published: (2013) -
Using Hybrid of Genetic Algorithm and Ant Colony Optimization to Solve Travelling Salesman Problem
by: Yi-Chiang Chiu, et al.
Published: (2012)