Skip to main content
Springer Nature Link
Log in

A XOR-Based ABC Algorithm for Solving Set Covering Problems

  • Conference paper
  • First Online:
The 1st International Conference on Advanced Intelligent System and Informatics (AISI2015), November 28-30, 2015, Beni Suef, Egypt

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

  • 1000 Accesses

Abstract

The set covering problem is a classical problem in the subject of combinatorial optimization that consists in finding a set of solutions that cover a range of needs at the lowest possible cost. The literature reports various techniques to solve this problem, ranging from exact algorithms to approximate methods. In this paper, we present a new XOR-based artificial bee colony algorithm for solving set covering problems. We integrate a XOR operator to binarize the solution construction in order to cope with the binary nature of set covering problems. We also incorporate pre-processing phases and dynamic ABC parameters so as to improve solving time. We report interesting and competitive experimental results on a set of 65 benchmarks from the Beasley’s OR-Library.

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. Akay, B., Karaboga, D.: Parameter tuning for the artificial bee colony algorithm. In: Proceedings of the 1st Conference on Computational Collective Intelligence, volume 5796 of LNCS, pp. 608–619. Springer (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Res. Logist. 37(1), 151–164 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 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. Ann. Oper. Res. 86, 611–627 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering

    Google Scholar 

  7. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730–743 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353–371 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ceria, S., Nobili, P., Sassano, A.: A lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81(2), 215–228 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Karaboga, D., Akay, B.: Artificial, bee colony (ABC), harmony search and bees algorithms on numerical optimization. IPROMS: Innovative Production Machines and Systems Virtual Conference. Cardiff, UK (2009)

    Google Scholar 

  13. Karaboga, D., Akay, B.: A survey: algorithms simulating bee swarm intelligence. Artif. Intell. Rev. 31(1–4), 61–85 (2009)

    Article  Google Scholar 

  14. Kiran, M.S., Gunduz, M.: XOR-based artificial bee colony algorithm for binary optimization. Turkish J. Electr. Eng. Comput. Sci. 21(2), 2307–2328 (2013)

    Article  Google Scholar 

  15. 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), 362–374 (2006)

    Article  Google Scholar 

  16. Lan, G., Depuy, G.W., Whitehouse, G.E.: An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176(3), 1387–1403 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vasko, F.J., Wilson, G.R.: Using a facility location algorithm to solve large set covering problems. Oper. Res. Lett. 3(2), 85–90 (1984)

    Article  MATH  Google Scholar 

  18. Vasko, F.J., Wolf, F.E., Stott, K.L.: Optimal selection of ingot sizes via set covering. Oper. Res. 35(3), 346–353 (1987)

    Article  Google Scholar 

Download references

Acknowledgments

Ricardo Soto is supported by Grant CONICYT/FONDECYT/INICIACION/ 11130459, Broderick Crawford is supported by Grant CONICYT/FONDECYT/ 1140897, and Fernando Paredes is supported by Grant CONICYT/FONDECYT/ 1130455.

Author information

Authors and Affiliations

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

    Ricardo Soto, Broderick Crawford, Sebastián Lizama & Franklin Johnson

  2. Universidad Autónoma de Chile, Temuco, Chile

    Ricardo Soto

  3. Universidad Cientifica Del Sur, Lima, Peru

    Ricardo Soto

  4. Universidad Central de Chile, Santiago, Chile

    Broderick Crawford

  5. Universidad San Sebastián, Region Metropolitana, Chile

    Broderick Crawford

  6. Universidad de Playa Ancha, Valparaíso, Chile

    Franklin Johnson

  7. Escuela de Ingeniería Industrial, Universidad Diego Portales, Santiago, Chile

    Fernando Paredes

Authors
  1. Ricardo Soto
    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. Sebastián Lizama
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Franklin Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fernando Paredes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ricardo Soto .

Editor information

Editors and Affiliations

  1. Faculty of Computers & Informatics, Suez Canal University, Ismailia, Egypt

    Tarek Gaber

  2. Department of Information Technology, Cairo University Faculty of Computers & Information, Giza, Egypt

    Aboul Ella Hassanien

  3. College of Management and Technology, Arab Academy for Science, Technology, and Maritime Transport, Giza, Egypt

    Nashwa El-Bendary

  4. Bengal College of Engineering and Technology, Durgapur, West Bengal, India

    Nilanjan Dey

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Soto, R., Crawford, B., Lizama, S., Johnson, F., Paredes, F. (2016). A XOR-Based ABC Algorithm for Solving Set Covering Problems. In: Gaber, T., Hassanien, A., El-Bendary, N., Dey, N. (eds) The 1st International Conference on Advanced Intelligent System and Informatics (AISI2015), November 28-30, 2015, Beni Suef, Egypt. Advances in Intelligent Systems and Computing, vol 407. Springer, Cham. https://doi.org/10.1007/978-3-319-26690-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26690-9_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26688-6

  • Online ISBN: 978-3-319-26690-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics