Skip to main content
Springer Nature Link
Log in

An Artificial Bee Colony Algorithm for the Set Covering Problem

  • Conference paper
  • First Online:
Modern Trends and Techniques in Computer Science

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 285))

  • 1014 Accesses

Abstract

In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the Set Covering Problem problem.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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

Similar content being viewed by others

References

  1. Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875890 (1996)

    Article  MathSciNet  Google Scholar 

  2. Fisher, M.L., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Manage. Sci. 36(6), 674688 (1990)

    Article  MathSciNet  Google Scholar 

  3. Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233235 (1979)

    Article  MathSciNet  Google Scholar 

  4. Lan, G., DePuy, G.W.: On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput. Ind. Eng. 51(3), 362374 (2006)

    Article  Google Scholar 

  5. Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81, 215228 (1998)

    MathSciNet  Google Scholar 

  6. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730743 (1999)

    Article  MathSciNet  Google Scholar 

  7. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392404 (1996)

    Article  Google Scholar 

  8. 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. Ann. Oper. Res. 86, 611627 (1999)

    Article  MathSciNet  Google Scholar 

  9. Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., et al. (eds.) Metaheuristics: Progress in Complex Systems Optimization, pp. 43–63. Springer, New York (2007)

    Chapter  Google Scholar 

  10. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353371 (2000)

    Article  MathSciNet  Google Scholar 

  11. Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293–300 (1992)

    Article  MATH  Google Scholar 

  12. Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 2000 (1998)

    MathSciNet  Google Scholar 

  13. Aickelin, U.: An indirect genetic algorithm for set covering problems, CoRR,0803.2965 (2008)

    Google Scholar 

  14. Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. ICSI 2, 27–34 (2013)

    Google Scholar 

  15. Crawford, B., Castro, C., Monfroy, E.: A new ACO transition rule for set partitioning and covering problems, pp. 426–429. In: SoCPaR 2009 (2009)

    Google Scholar 

  16. Crawford, B., Lagos, C., Castro, C., Paredes, F.: A evolutionary approach to solve set covering. ICEIS 2(2007), 356–363 (2007)

    Google Scholar 

  17. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Karaboga, D.: An idea based on honey bee swarm for numerical optimization, Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey (2005)

    Google Scholar 

  19. Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl. Soft Comput. 9(2), 625–631 (2009)

    Article  Google Scholar 

  20. Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, Berlin (2003)

    MATH  Google Scholar 

  21. Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690 (2013)

    Article  Google Scholar 

  22. Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., Figueroa, C.: A reactive and hybrid constraint solver. J. Exp. Theor. Artif. Intell. 25(1), 1–22 (2013)

    Article  Google Scholar 

  23. Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving Advances in Intelligent Systems and Computing, p. 175. Springer, Berlin (2012)

    Google Scholar 

  24. Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Proceedings of the 12th International Conference on Computational Science and Its Applications (ICCSA), p 7335 (2012)

    Google Scholar 

  25. Crawford, B., Soto, R., Castro, C., Monfroy, E.: A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In: Proceedings of the 4th International Work-conference on the Interplay Between Natural and Artificial Computation (IWINAC), p. 668 (2011)

    Google Scholar 

Download references

Acknowledgments

The author Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897.

The author Ricardo Soto is supported by Grant CONICYT/FONDECYT/INI- CIACION/11130459.

The author Fernando Paredes is supported by Grant CONICYT/FONDECYT/REGULAR/1130455.

Author information

Authors and Affiliations

  1. Pontificia Universidad Católica de Valparaíso, Valparaiso, Chile

    Rodrigo Cuesta, Broderick Crawford & Ricardo Soto

  2. Universidad Finis Terrae, Santiago, Chile

    Broderick Crawford

  3. Universidad Autónoma de Chile, Santiago, Chile

    Ricardo Soto

  4. Universidad Diego Portales, Santiago, Chile

    Fernando Paredes

Authors
  1. Rodrigo Cuesta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ricardo Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fernando Paredes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Broderick Crawford .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Petr Silhavy

  5. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zdenka Prokopova

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cuesta, R., Crawford, B., Soto, R., Paredes, F. (2014). An Artificial Bee Colony Algorithm for the Set Covering Problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Modern Trends and Techniques in Computer Science. Advances in Intelligent Systems and Computing, vol 285. Springer, Cham. https://doi.org/10.1007/978-3-319-06740-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06740-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06739-1

  • Online ISBN: 978-3-319-06740-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics