Reasons of ACO’s Success in TSP
Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ant colonies that has empirically shown its effectiveness in the resolution of hard combinatorial optimization problems like the Traveling Salesman Problem (TSP). Still, very little theory is available to explain the reasons underlying ACO’s success. An ACO alternative called Omicron ACO (OA), first designed as an analytical tool, is presented. This OA is used to explain the reasons of elitist ACO’s success in the TSP, given a globally convex structure of its solution space.
Unable to display preview. Download preview PDF.
- 1.Birattari, M., Di Caro, G., Dorigo, M.: For a Formal Foundation of the Ant Programming Approach to Combinatorial Optimization. Part 1: The problem, the representation, and the general solution strategy. Technical Report TR-H-301, ATR-Human Information Processing Labs, Kyoto, Japan (2000)Google Scholar
- 2.Boese, K.D.: Cost Versus Distance in the Traveling Salesman Problem. Technical Report 950018, Univ. of California, Los Angeles, Computer Science (May 19, 1995)Google Scholar
- 3.Dorigo, M., Di Caro, G.: The Ant Colony Optimization Meta-Heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, London (1999)Google Scholar
- 4.Dorigo, M., Stützle, T.: An Experimental Study of the Simple Ant Colony Optimization Algorithm. In: 2001 WSES International Conference on Evolutionary Computation (EC 2001), WSES-Press International (2001)Google Scholar