A study of some properties of Ant-Q

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1141, Issue , 1996, Pages 656-665

  Dorigo, Marco ^a   Gambardella, Luca Maria ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANT COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; OPTIMIZATION;

ANT COLONIES; ANT SYSTEMS; COMBINATORIAL OPTIMIZATION PROBLEMS; Q ALGORITHMS; SYNERGISTIC EFFECT;

PROBLEM SOLVING;

EID: 84958980692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1029     Document Type: Conference Paper

References (13)

1. Bersini H., C. Oury and M. Dorigo, 1995. Hybridization of genetic algorithms. Tech. Rep. No. IRIDIA/95-22, IRIDIA, Université Libre de Bruxelles, Belgium.
2. Colorni A., M. Dorigo and V. Maniezzo, 1991. Distributed Optimization by Ant Colonies. Proceedings of ECAL91 -European Conference on Artificial Life, Paris, France, F.Varela and P.Bourgine (Eds.), Elsevier Publishing, 134-142.
3. Colorni A., M. Dorigo and V. Maniezzo, 1992. An Investigation of some Properties of an Ant Algorithm. Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), Brussels, Belgium, R.Mäinner and B.Manderick (Eds.), Elsevier Publishing, 509-520.
4. Dorigo M., 1992. Optimization, Learning and Natural Algorithms. Ph.D.Thesis, Politecnico di Milano, Italy. (In Italian.)
5. Dorigo M., V. Maniezzo and A. Colorni, 1996. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26, 2, 29-41.
6. Eilon S., C.D.T. Watson-Gandy and N. Christofides, 1969. Distribution management: mathematical modeling and practical analysis. Operational Research Quarterly, 20, 37-53.
7. Fischetti M. and P. Toth, 1992. An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem. Mathematical Programming, 53, 173-197.
8. Fischetti M. and P. Toth, 1994. A polyhedral approach for the exact solution of hard ATSP instances. Tech. Rep. 0R-94, DEIS, Università di Bologna, Italy, April 1994.
9. Fogel D., 1993. Applying evolutionary programming to selected traveling salesman problems. Cybernetics and Systems: An International Journal, 24, 27-36.
10. Gambardella L. and M. Dorigo, 1995. Ant-Q: A Reinforcement Learning approach to the traveling salesman problem. Proceedings of ML-95, Twelfth International Conference on Machine Learning, Tahoe City, CA, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, 252-260.
11. Lin F.-T., C.-Y. Kao and C.-C. Hsu, 1993. Applying the genetic approach to simulated annealing in solving some NP-hard problems. IEEE Transactions on Systems, Man, and Cybernetics, 23, 1752-1767.
12. Watkins C.J.C.H., 1989. Learning with delayed rewards. Ph.D. dissertation, Psychology Department, University of Cambridge, England.
13. Whitley D., T. Starkweather and D. Fuquay, 1989. Scheduling Problems and Traveling Salesman: the Genetic Edge Recombination Operator. Proc. of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, 133-140.