Ant colony optimization with cunning ants

Transactions of the Japanese Society for Artificial Intelligence

Volumn 22, Issue 1, 2007, Pages 29-36

  Tsutsui, Shigeyoshi ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

Ant colony optimization; Cunning ant; Donor ant; Local search; Traveling salesman problem

Indexed keywords

EID: 33846643080     PISSN: 13460714     EISSN: 13468030     Source Type: Journal    
DOI: 10.1527/tjsai.22.29     Document Type: Article

References (28)

1. A. Acan: An external memory implementation in ant colony optimization, Proceedings of the Fourth International Workshop on Ant Algorithms and Swarm Intelligence (ANTS-2004), 73-84 (2004).
2. D. Applegate, W. Cook, and A. Rohe: Chained Lin-Kernighan for large traveling salesman problems, INFORMS Journal on Computing, 15, 82-92 (2003).
3. B. Bullnheimer, R. F. Hartl, and C. Strauss: A new rank based version of the Ant System: a computational study, Central European Journal for Operations Research and Economics, 7(1), 25-38 (1999).
4. B. Bullnheimer, R. F. Hartl, and C. Strauss: An Improved Ant System Algorithm for the Vehicle Routing Problem, Annals of Operations Research, 89, 316-328 (1999).
5. P. Forsyth and A. Wren: An Ant System for Bus Driver Scheduling, Proceedings of the 7th International Workshop on Computer-Aided Scheduling of Public Transport (1997).
6. M. Dorigo, V. Maniezzo, and A. Colorni: The Ant System: Optimization by a Colony of Cooperating Agents, IEEE Transaction on SMC-Part B, 26(1), 29-41 (1996).
7. M. Dorigo and L. M. Gambardella: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transaction on Evolutionary Computation, 1(1), 53-66 (1997).
8. M. Dorigo and T. Stützle: Ant Colony Optimization, MIT press, Massachusetts (2004).
9. L. M. Gambardella and M. Dorigo: Solving symmetric and asymmetric TSPs by ant colonies, Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'96), 622-627 (1996).
10. L. M. Gambardella, E. D. Taillard, and M. Dorigo: Ant colony for the quadratic assignment problem, Journal of the Operational Research Society, 50, 167-176 (1999).
11. D. E. Goldberg and K. Deb: A Comparative Alanalysis of Selection Schemes Used in Genetic Algorithms, Rawlins, G. J. E. (ed.), Foundation of Genetic Algorithms, Morgan Kaufmann (1991).
12. D. S. Johnson and L. A. McGeoch: The traveling salesman problem: a case study in local optimization, E. H. L Aarts and J. K. Lenstra (ed.), Local Search in Combinatorial Optimization, 215-310 (1997).
13. D. S. Johnson: Experimental Analysis of Heuristics for the STSP, G. Gutin and A. P. Punnen (ed.), The Traveling Salesman Problem and Variations, 9, 369-443, Kluwer (2002).
14. S. Lin and B. W. Kernighan: An effective heuristic algorithm for the traveling salesman problem, Operations Research, 21, 498-516 (1973).
15. H. Mühlenbein and G. Paa : From recombination of genes to the estimation of distribu-tions I. Binary parameters, Proceedings of the Parallel Problem Solving from Nature IV, 178-187 (1996).
16. Japanese source
17. M. Pelikan and D. E. Goldberg and F.Lobo: A survey of optimization by building and using probabilistic models, Computational Optimization and Applications, 21(1), 5-20 (2002).
18. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz: Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior, 5(2), 169-207 (1997).
19. T. Stützle: An ant approach to the flowshop problem, Proceedings of the 6th European Congress in Intelligent Thech. and Com., 3, 1560-1564 (1998).
20. T. Stützle and M. Dorigo: ACO algorithms for the quadratic assignment problem, New Ideas in Optimization, 33-50, McGraw Hill (1999).
21. T. Stützle and H. Hoos: Max-Min Ant System and Local Search for the Traveling Salesman, Proceedings the 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), 309-314 (1997).
22. T. Stützle and H. Hoos: Max-Min Ant System, Future Generation Computer Systems, 16(8), 889-914 (2000).
23. ANSI C Code as gzipped tar file, Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html (2005).
24. S. Tsutsui: Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram, Proceedings of the 7th International Conference on Parallel Problem Solving from Nature (PPSN VII), 224-233 (2002).
25. Japanese source
26. Japanese source
27. S. Tsutsui: AS: Ant Colony Optimization with Cunning Ant, Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN IX), 162-171, Springer (2006).
28. W. Wiesemann and T. Stützle: An Experimental Investigation of Iterated Ants for the Quadratic Assign-ment Problem, IRIDIA Technical Report Series Technical Re-port TR/IRIDIA/2006-003 (2006).