Skip to main content
Springer Nature Link
Log in

Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems

  • Conference paper
Software Engineering in Intelligent Systems

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

Abstract

In this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Balachandar, S.R., Kannan, K.: A meta-heuristic algorithm for set covering problem based on gravity 4(7), 944–950 (2010)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Balas, E., Ho, A.: Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: a Computational Study. In: Padberg, M.W. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol. 12, pp. 37–60. Elsevier, North-Holland (1980)

    Chapter  Google Scholar 

  4. Beasley, J.: A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL) 37(1), 151–164 (1990)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Beasley, J.E.: An algorithm for set covering problem. European Journal of Operational Research 31(1), 85–93 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Boros, E., Hammer, P.L., Ibaraki, T., Kogan, A.: Logical analysis of numerical data. Mathematical Programming 79(1-3), 163–190 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Brusco, M., Jacobs, L., Thompson, G.: 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol. 39, pp. 43–63. Springer US (2007)

    Google Scholar 

  11. Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. The Scientific World Journal (2014)

    Google Scholar 

  13. Crawford, B., Soto, R., Monfroy, E., Castro, C., Palma, W., Paredes, F.: A hybrid soft computing approach for subset problems. Mathematical Problems in Engineering, Article ID 716069, 1–12 (2013)

    Google Scholar 

  14. Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol. 285, pp. 65–73. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  15. Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: Using the firefly optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCII 2014 Posters, Part I. CCIS, vol. 434, pp. 509–514. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  16. Cuesta, R., Crawford, B., Soto, R., Paredes, F.: An artificial bee colony algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol. 285, pp. 53–63. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  17. Eusuff, M.M., Lansey, K.E.: Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm. Journal of Water Resources Planning and Management 129(3), 210–225 (2003)

    Article  Google Scholar 

  18. Fisher, M.L., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36(6), 674–688 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  19. Fisher, M.L., Rosenwein, M.B.: An interactive optimization system for bulk-cargo ship scheduling. Naval Research Logistics (NRL) 36(1), 27–42 (1989)

    Article  Google Scholar 

  20. Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly, 367–384 (1976)

    Google Scholar 

  21. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  22. Glover, F.W., Kochenberger, G.A.: Handbook of Metaheuristics (International Series in Operations Research & Management Science). Springer (January 2003)

    Google Scholar 

  23. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  24. Mirjalili, S., Hashim, S.M., Taherzadeh, G., Mirjalili, S., Salehi, S.: A study of different transfer functions for binary version of particle swarm optimization. In: GEM 2011. CSREA Press (2011)

    Google Scholar 

  25. Naji-Azimi, Z., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. European Journal of Operational Research 205(2), 290–300 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  26. Ren, Z.-G., Feng, Z.-R., Ke, L.-J., Zhang, Z.-J.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering 58(4), 774–784 (2010)

    Article  Google Scholar 

  27. Smith, B.M.: Impacs a bus crew scheduling system using integer programming. Mathematical Programming 42(1), 181–187 (1988)

    Article  MathSciNet  Google Scholar 

  28. Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Operations Research 19(6), 1363–1373 (1971)

    Article  MATH  Google Scholar 

  29. Vasko, F.J., Wolf, F.E., Stott Jr., K.L.: A set covering approach to metallurgical grade assignment. European Journal of Operational Research 38(1), 27–34 (1989)

    Article  MathSciNet  Google Scholar 

  30. Yang, X.-S.: Nature-inspired metaheuristic algorithms. Luniver Press (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Broderick Crawford, Ricardo Soto, Marco Riquelme-Leiva, Cristian Peña, Claudio Torres-Rojas & Franklin Johnson

  2. Universidad Finis Terrae, Santiago, Chile

    Broderick Crawford

  3. Universidad San Sebastián, Concepción, Chile

    Broderick Crawford

  4. Universidad Autónoma de Chile, Talca, Chile

    Ricardo Soto

  5. Universidad Central de Chile, Santiago, Chile

    Ricardo Soto

  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. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ricardo Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marco Riquelme-Leiva
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cristian Peña
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Claudio Torres-Rojas
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Franklin Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. 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

    Zdenka Prokopova

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

    Petr Silhavy

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Crawford, B. et al. (2015). Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Software Engineering in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 349. Springer, Cham. https://doi.org/10.1007/978-3-319-18473-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18473-9_30

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18472-2

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics