Skip to main content
SpringerLink
Log in

Behavior of the Ant Colony Algorithm for the Set Covering Problem

  • Conference paper
Operations Research Proceedings 1999

Part of the book series: Operations Research Proceedings 1999 ((ORP,volume 1999))

Summary

We develop the Ant Colony approach for the classical Set Covering problem. As artificial ants we use three randomized greedy heuristics: GRASP heuristic and two asymptotically exact heuristics Random Neighborhood and Random Covering Set. We study the influence of the main control parameters and present new ideas for accumulating and exploiting of statistical information. Computational results for difficult benchmarks are discussed.

This work was supported by the RFBR grant 99-01-00510.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 132.00
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. Balas, E.; Carrera, M. C. (1996): A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Operations Research, Vol. 44, pp. 875–890.

    Article  Google Scholar 

  2. Beasley, J. E.; Chu, P. C. (1996): A Genetic Algorithm for the Set Covering Problem. European Journal of Operational Research, Vol. 94, No. 2, pp. 394–404.

    Article  Google Scholar 

  3. Chvatal, V. (1979): A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research, Vol. 4, No. 3, pp. 233–235.

    Article  Google Scholar 

  4. Dorigo, M.; Maniezzo, V.; Colorny, A. (1991): Ant System: An Autocatalytic Optimizing Process. Technical Report No. 91-016, Politecnico di Milano.

    Google Scholar 

  5. Eremeev, A. V. (1999): Genetic Algorithm with a Non-Binary Representation for the Set Covering Problem. Operations Research Proceedings 1998, Springer-Verlag, pp. 175–181.

    Google Scholar 

  6. Feo, T. A. (1995): Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, Vol. 6, pp. 109–133.

    Article  Google Scholar 

  7. Fulkerson, D. R.; Nemhauser, G. L.; Trotter Jr., L. E. (1974): Two Computationally Difficult Set Covering Problems that Arise in Computing the 1-Width of Incidence Matrices of Steiner Triple Systems. Mathematical Programming Study, Vol. 2, pp. 72–81.

    Article  Google Scholar 

  8. Grossman, T.; Wool, A. (1997): Computational Experience with Approximation Algorithms for the Set Covering Problem. European Journal of Operational Research, Vol. 101, No. 1, pp. 81–92.

    Article  Google Scholar 

  9. Zaozerskaya, L. A. (1998): Investigation and Solving of Some Classes of Integer Programming Problems on the Basis of Regular Partitions. PhD. Thesis, Omsk Branch of Sobolev Institute of Mathematics, SB RAS, (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Munich, Germany

    Dmitri Alexandrov

  2. Novosibirsk, Russia

    Yuri Kochetov

Authors
  1. Dmitri Alexandrov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Kochetov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Wirtschaftswissenschaft, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Karl Inderfurth  & Gerhard Schwödiauer  & 

  2. Fachbereich Rechts- und Wirtschaftswissenschaften, Technische Universität Darmstadt, Hochschulstr. 1, D-64289, Darmstadt, Germany

    Wolfgang Domschke

  3. Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Friedrich Juhnke

  4. Wirtschaftswissenschaftliche Fakultät, Universität Passau, Innstr. 29, D-90030, Passau, Germany

    Peter Kleinschmidt

  5. Wirtschaftswissenschaftliche Fakultät, Martin-Luther-Universität Halle-Wittenberg, Große Steinstr. 73, D-06108, Halle/Saale, Germany

    Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alexandrov, D., Kochetov, Y. (2000). Behavior of the Ant Colony Algorithm for the Set Covering Problem. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58300-1_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67094-0

  • Online ISBN: 978-3-642-58300-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation