Ant system: Optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 26, Issue 1, 1996, Pages 29-41

  Dorigo, Marco ^a,b   Maniezzo, Vittorio ^c   Colorni, Alberto ^d  

^a IEEE

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITY OF BOLOGNA   (Italy)

^d POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATA STRUCTURES; FEEDBACK; HEURISTIC METHODS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY; RANDOM PROCESSES; SIMULATED ANNEALING;

ANT SYSTEM; DISTRIBUTED COMPUTATION; JOB SHOP SCHEDULING; PROBABILISTIC TRANSITIONS; QUADRATIC ASSIGNMENT; TABU SEARCH; TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

EID: 0030082551     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.484436     Document Type: Article

References (35)

1. E. H. L. Aarts and J. H. M. Korst, Simulated Annealing and Boltzmann Machines. New York: Wiley, 1988.
2. J. L. Bentley, "Fast algorithms for geometric traveling salesman problems," ORSA J. Computing, vol. 4, no. 4, pp. 387-411, 1992.
3. H. Bersini and F. J. Varela, "The immune recruitment mechanism: A selective evolutionary strategy," in Proc. Fourth Int. Conf. Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991, pp. 520-526.
4. S. C. Boyd, W. R. Pulleyblank and G. Cornuejols, Travel Software Package, Carleton University, 1989.
5. R. E. Burkhard, "Quadratic assignment problems," Europ. J. Oper. Res., vol. 15, pp. 283-289, 1984.
6. A. Colorni, M. Dorigo and V. Maniezzo, "Distributed optimization by ant colonies," in Proc. First Europ. Conf. Artificial Life, F. Varela and P. Bourgine, Eds. Paris, France: Elsevier, 1991, pp. 134-142.
7. A. Colorni, M. Dorigo and V. Maniezzo, "An investigation of some properties of an ant algorithm," in Proc. Parallel Problem Solving from Nature Conference (PPSN '9Z), R. Manner and B. Manderick Eds. Brussels, Belgium: Elsevier, 1992, pp. 509-520.
8. A. Colorni, M. Dorigo, V. Maniezzo and M. Trubian, "Ant system for job - Shop scheduling," JORBEL - Belgian J. Oper. Res., Statist. Comp. Sci., vol. 34, no. 1, pp. 39-53.
9. A. Colorni, M. Dorigo, F. Maffioli, V. Maniezzo, G. Righini and M. Trubian, "Heuristics from nature for hard combinatorial problems," Tech. Rep. 93-025, Dip. Elettronica e Informazione, Politecnico di Milano, Italy, 1993.
10. J. L. Denebourg, J. M. Pasteels and J. C. Verhaeghe, "Probabilistic behavior in ants: A strategy of errors?," J. Theoret. Biol., vol. 105, pp. 259-271, 1983.
11. J. L. Denebourg and S. Goss, "Collective patterns and decision-making," Ethology, Ecology & Evolution, vol. 1, pp. 295-311, 1989.
12. M. Dorigo, "Optimization, learning and natural algorithms," Ph.D. Thesis, Dip. Elettronica e Informazione, Politecnico di Milano, Italy, 1992.
13. M. Dorigo, V. Maniezzo and A. Colorni, "Positive feedback as a search strategy," Tech. Rep. 91-016, Politecnico di Milano, 1991.
14. S. Eilon, T. H. Watson-Gandy and N. Christofides, "Distribution management: Mathematical modeling and practical analysis," Oper. Res. Quart., vol. 20, pp. 37-53, 1969.
15. A. E. Elshafei, "Hospital layout as a quadratic assignment problem," Oper. Res. Quart., vol. 28, pp. 167-179, 1977.
16. M. Fischetti and P. Toth, "An additive bounding procedure for the asymmetric travelling salesman problem," Mathemat. Prog., vol. 53, pp. 173-197, 1992.
17. F. Glover, "Tabu Search - Part I," ORSA J. Computing, vol. 1, no. 3, pp. 190-206, 1989.
18. _, "Tabu Search - Part II," ORSA J. Computing, vol. 2, no. 1, pp. 4-32, 1990.
19. D. E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning. Reading, MA: Addison-Wesley, 1989.
20. B. Golden and W. Stewart, "Empiric analysis of heuristics," in The Travelling Salesman Problem, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Kan, D. B. Shmoys Eds.. New York: Wiley, 1985.
21. S. Goss, R. Beckers, J. L. Denebourg, S. Aron and J. M. Pasteels, "How trail laying and trail following can solve foraging problems for ant colonies," in Behavioral Mechanisms of Food Selection, R. N. Hughes Ed., NATO-ASI Series. Berlin: Springer-Verlag, vol. G 20, 1990.
22. R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," in Annals Disc. Math., vol. 5, pp. 287-326, 1979.
23. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: The University of Michigan Press, 1975.
24. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, "Optimization by simulated annealing," Sci., vol. 220, pp. 671-680, 1983.
25. J. Krarup, P. M. Pruzan, "Computer-aided layout design," Mathemat. Prog. Study, vol. 9, pp. 85-94, 1978.
26. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Kan and D. B. Shmoys Eds., The Travelling Salesman Problem. New York: Wiley, 1985.
27. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the TSP," Oper. Res., vol. 21, 498-516, 1973.
28. V. Maniezzo, A. Colorni and M. Dorigo, "The ant system applied to the quadratic assignment problem," Tech. Rep. IRIDIA/94-28, Université Libre de Bruxelles, Belgium, 1994.
29. C. E. Nugent, T. E. Vollmann and J. Ruml, "An experimental comparison of techniques for the assignment of facilities to locations," Oper. Res., vol. 16, pp. 150-173, 1968.
30. I. Rechenberg, Evolutionsstrategie. Stuttgart: Fromman-Holzbog, 1973.
31. G. Reinelt, TSPLIB 1.0, Institut für Mathematik, Universität Augsburg, Germany, 1990.
32. D. E. Rumelhart and J. L. McLelland, Parallel Distributed Processing: Explorations in the Microstructure of Cogniton. Cambridge, MA: MIT Press, 1986.
33. H.-P. Schwefel, "Evolutionsstrategie und numerische optimierung," Ph.D. Thesis, Technische Universität Berlin, 1975.
34. Also available as Numerical Optimization of Computer Models. New York: Wiley, 1981.
35. D. Whitley, T. Starkweather and D. Fuquay, "Scheduling problems and travelling salesman: The genetic edge recombination operator," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1989.