Skip to main content

Improvements on the Ant-System: Introducing the MAX-MIN Ant System

  • Conference paper
Book cover Artificial Neural Nets and Genetic Algorithms

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. M. Dorigo. Optimization, Learning, and Natural Algorithms. PhD thesis, Politecnico di Milano, 1992.

    Google Scholar 

  3. M. Dorigo, V. Maniezzo, and A. Colorai. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29–41, 1996.

    Article  Google Scholar 

  4. 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 

  5. M. Fischetti and P. Toth. An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem. Mathematical Programming, 53:173–197, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  6. 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 

  7. 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 

  8. G. Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications, volume 840 of LNCS. Springer Verlag, 1994.

    Google Scholar 

  9. 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 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Wien

About this paper

Cite this paper

Stützle, T., Hoos, H. (1998). Improvements on the Ant-System: Introducing the MAX-MIN Ant System. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6492-1_54

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83087-1

  • Online ISBN: 978-3-7091-6492-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics