Improved Ant Colony Optimization for the Traveling Salesman Problem

Authors:
Lijie Li;Shangyou Ju;Ying Zhang
Affiliations:
-;-;-
Venue:
ICICTA '08 Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation - Volume 01
Year:
2008

Citing 0
Cited 2

Test case prioritization using ant colony optimization

ACM SIGSOFT Software Engineering Notes
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traveling salesman problem (TSP) in operations research is a classical problem in discrete or combinatorial optimization. It is a prominent illustration of a class of problems in computational complexity theory which are classified as NP-hard. Ant colony optimization inspired by co-operative food retrieval have been widely applied unexpectedly successful in the combinatorial optimization. This paper presents an improved ant colony optimization algorithm for traveling salesman problem, which adopts a new probability selection mechanism by using Held-Karp lower bound to determine the trade-off between the influence of the heuristic information and the pheromone trail. The experiments showed that it can stably generate better solution for the traveling salesman problem than rank-based ant system and max-min ant colony optimization algorithm.