Improvements on the Ant-System: Introducing the MAX-MIN Ant System
In this paper we present MAX-MIN Ant System (MMAS) that improves on the Ant system. MMAS is a general purpose heuristic algorithm based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In the experiments we apply MMAS to symmetric and asymmetric travelling salesman problems. We describe in detail the improvements on Ant system, discuss the addition of local search to MMAS, and report on our computational results, showing that our system also improves over other variations of Ant system.
KeywordsLocal Search Tour Length Local Search Phase Good Tour Asymmetric Travelling Salesman Problem
Unable to display preview. Download preview PDF.
- A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In Proceedings of ECAL91-European Conference on Artificial Life, pages 134–142. Elsevier Publishing, 1991.Google Scholar
- M. Dorigo. Optimization, Learning, and Natural Algorithms. PhD thesis, Politecnico di Milano, 1992.Google Scholar
- H. Bersini, M. Dorigo, L. Gambardella, S. Langerman and L. Seront. Results of the First International Contest on Evolutionary Optimisation. Technical Report TR/IRIDIA/96-18, IRIDIA, Université Libre de Bruxelles, 1996.Google Scholar
- L. Gambardella and M. Dorigo. Solving Symmetric and Asymmetric TSPs by Ant Colonies. In IEEE Conference on Evolutionary Computation (ICEC’96). IEEE Press, 1996.Google Scholar
- L.M. Gambardella and M. Dorigo. Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem. In Proceedings of the Twelfth Iternational Conference on Machine Learning, pages 252–260. Morgan Kaufmann, 1995.Google Scholar
- G. Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications, volume 840 of LNCS. Springer Verlag, 1994.Google Scholar
- T. Stützle and H. Hoos. A detailed report on the MAX-MIN Ant System. Technical Report AIDA-96-11, FG Intellektik, TH Darmstadt, August 1996.Google Scholar