A cooperative ant colony system and genetic algorithm for TSPs
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
| Hi-index | 0.00 |
To solve a typical NP-hard combinatorial optimization problem-Traveling Salesman Problem, ant colony optimization based on minimum spanning tree(MST-ACO), is presented and the performance is reported. The mechanism of MST-ACO is described from three aspects: adopting Dual Nearest Insertion Procedure to initialize the pheromone, integrating reinforcement learning through computing lowbound by 1-minimum spanning tree, and combining Lin-Kerninghan local search. The results clearly show that MST-ACO has the property of effectively guiding the local search heuristics towards promising regions of the search space, which indicates that MST-ACO is an effective approach for solving the traveling salesman problem.