Skip to main content

Analysis of the Best-Worst Ant System and Its Variants on the QAP

  • Conference paper
  • First Online:
Ant Algorithms (ANTS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2463))

Included in the following conference series:

Abstract

In this contribution, we will study the influence of the three components of the Best-Worst Ant System (BWAS) algorithm. As the importance of each of them as the fact whether all of them are necessary will be analyzed. Besides, we will introduce a new algorithm called Best- Worst Ant Colony System by combining the basis of the Ant Colony System with the special components of the BWAS. The performance of different variants of these algorithms will be tested when solving different instances of the QAP.

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. S. Baluja, R. Caruana. Removing the Genetics from the Standard Genetic Algorithm. In A. Prieditis, S. Rusell (Eds.), Machine Learning: Proceedings of the Twelfth International Conference, Morgan Kaufmann Publishers, pp. 38–46, 1995.

    Google Scholar 

  2. R.E Burkard, E. Cela. Quadratic and three-dimensional assignment problem. In M. Dell'Amico, F. Maffioli, and S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, 1996.

    Google Scholar 

  3. O. Cordón, F. Herrera, I. Fern'andez de Viana, L. Moreno. A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System. Proc. of ANTS’2000. From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, Brussels, Belgium, September 7–9, pp. 22–29, 2000.

    Google Scholar 

  4. M. Dorigo, G. Di Caro. Ant Algorithms for Discrete Optimization. Artificial Life 5(2), pp. 137–172, 1999.

    Article  Google Scholar 

  5. E. Rainer, S. Burkard, E. Karish, F. Rendl. QAPLIB-A Quadratic Assignment Problem Library. http://www.opt.math.tu-graz.ac.at/~karish/qaplib.

  6. T. Stützle, M. Dorigo. ACO Algorithms for the Quadratic Assignment Problem. In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, McGraw-Hill.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cordón, O., de Viana, I.F., Herrera, F. (2002). Analysis of the Best-Worst Ant System and Its Variants on the QAP. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45724-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44146-5

  • Online ISBN: 978-3-540-45724-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics