Skip to main content
SpringerLink
Log in

Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems

  • Conference paper
Artificial Intelligence and Soft Computing – ICAISC 2006 (ICAISC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4029))

Included in the following conference series:

Abstract

Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of information on the anticipated decisions that are beyond the immediate choice horizon. The ants solutions may contain redundant components which can be eliminated by a fine tuning after the solution, then we explore Post Processing procedures too, which consist in the identification and replacement of the columns of the ACO solution in each iteration by more effective columns. Computational results are presented showing the advantages to use additional mechanisms to Ant Colony Optimization.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Alexandrov, D., Kochetov, Y.: Behavior of the Ant Colony Algorithm for the Set Covering Problem. In: Proc. of Symp. Operations Research, pp. 255–260. Springer, Heidelberg (2000)

    Google Scholar 

  2. Balas, E., Padberg, M.: Set Partitioning: A Survey. SIAM Review 18, 710–760 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  3. Beasley, J.E.: OR-Library:Distributing test problem by electronic mail. Journal of Operational Research Society 41(11), 1069–1072 (1990)

    Google Scholar 

  4. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)

    Article  MATH  Google Scholar 

  5. Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost and coverage correlated set covering problems. Annals of Operations Research 86, 611–627 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chu, P.C., Beasley, J.E.: Constraint handling in genetic algorithms: the set partitoning problem. Journal of Heuristics 4, 323–357 (1998)

    Article  MATH  Google Scholar 

  7. Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant Algorithms for Discrete Optimization. Artificial Life 5, 137–172 (1999)

    Article  Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  9. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)

    Book  MATH  Google Scholar 

  10. Feo, A., Mauricio, G., Resende, A.: A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. OR Letters 8, 67–71 (1989)

    MATH  Google Scholar 

  11. Gagne, C., Gravel, M., Price, W.L.: A Look-Ahead Addition to the Ant Colony Optimization Metaheuristic and its Application to an Industrial Scheduling Problem. In: Sousa, J.P., et al. (eds.) Proceedings of the fourth Metaheuristics International Conference MIC 2001, July 16-20, 2001, pp. 79–84 (2001)

    Google Scholar 

  12. Gandibleux, X., Delorme, X., T’Kindt, V.: An Ant Colony Algorithm for the Set Packing Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 49–60. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Hadji, R., Rahoual, M., Talbi, E., Bachelet, V.: Ant colonies for the set covering problem. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 63–66. Springer, Heidelberg (2000)

    Google Scholar 

  14. Leguizamón, G., Michalewicz, Z.: A new version of Ant System for subset problems. In: Congress on Evolutionary Computation, CEC 1999, Piscataway, NJ, USA, pp. 1459–1464. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  15. Lessing, L., Dumitrescu, I., Stutzle, T.: A Comparison Between ACO Algorithms for the Set Covering Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 1–12. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Maniezzo, V., Milandri, M.: An Ant-Based Framework for Very Strongly Constrained Problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 222–227. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Meyer, B., Ernst, A.: Integrating ACO and Constraint Propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 166–177. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Michel, R., Middendorf, M.: An Island model based Ant system with lookahead for the shortest supersequence problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 692–701. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Informatic School, Pontifical Catholic University of Valparaíso, Chile

    Broderick Crawford

  2. Informatic Department, Federico Santa María Technical University, Chile

    Broderick Crawford & Carlos Castro

Authors
  1. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Berkeley Initiative in Soft Computing (BISC), University of California, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Department of Electrical Engineering, University of Louisville, 40292, Louisville, KY, U.S.A

    Jacek M. Żurada

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crawford, B., Castro, C. (2006). Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_113

Download citation

  • DOI: https://doi.org/10.1007/11785231_113

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35748-3

  • Online ISBN: 978-3-540-35750-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation