Skip to main content
Springer Nature Link
Log in

Binary Harmony Search Algorithm for Solving Set-Covering Problem

  • Conference paper
  • First Online:
Trends in Applied Knowledge-Based Systems and Data Science (IEA/AIE 2016)

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

  • 2761 Accesses

Abstract

This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used.

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. Crawford, B., Soto, R., Guzmán, N., Johnson, F., Paredes, F.: Recent harmony search algorithms for 0–1 optimization problems. In: Stephanidis, C., Tino, A. (eds.) HCII 2015 Posters. CCIS, vol. 528, pp. 567–572. Springer, Heidelberg (2015). doi:10.1007/978-3-319-21380-4_96

    Chapter  Google Scholar 

  2. Karp, R.M.: Reducibility among combinatorial problems. In: 50 Years of Integer Programming 1958–2008 - From the Early Years to the State-of-the-Art, pp. 219–241 (2010)

    Google Scholar 

  3. Ali, A.I., Thiagarajan, H.: A network relaxation based enumeration algorithm for set partitioning. Eur. J. Oper. Res. 38(1), 76–85 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bartholdi, J.J.: A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper. Res. 29(3), 501–510 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  5. Walker, W.: Using the set-covering problem to assign fire companies to fire houses. Oper. Res. 22, 275–277 (1974)

    Article  Google Scholar 

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

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

    Article  Google Scholar 

  8. Vasko, F.J., Wolf, F.E., Stott, K.L.: A set covering approach to metallurgical grade assignment. Eur. J. Oper. Res. 38(1), 27–34 (1989)

    Article  MathSciNet  Google Scholar 

  9. Vasko, F.J., Wolf, F.E., Stott, K.L., Scheirer, J.W.: Selecting optimal ingot sizes for bethlehem steel. Interfaces 19(1), 68–84 (1989)

    Article  Google Scholar 

  10. Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Oper. Res. 12(2), 300–304 (1964)

    Article  Google Scholar 

  11. Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Oper. Res. 27, 367–384 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fisher, M.L., Rosenwein, M.B.: An interactive optimization system for bulk-cargo ship scheduling. Nav. Res. Logist. 36(1), 27–42 (1989)

    Article  Google Scholar 

  13. Bellmore, M., Geenberg, H.J., Jarvis, J.J.: Multi-commodity disconnecting sets. Manage. Sci. 16(6), B427–B433 (1970)

    Article  MATH  Google Scholar 

  14. Bellmore, M., Ratliff, H.D.: Optimal defense of multi-commodity networks. Manage. Sci. 18(4-part-I), B174–B185 (1971)

    Google Scholar 

  15. Freeman, B.A., Jucker, J.V.: The line balancing problem. J. Ind. Eng. 18, 361–364 (1967)

    Google Scholar 

  16. Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6, 18–25 (1955)

    MathSciNet  Google Scholar 

  17. Ribeiro, C.C., Minoux, M., Penna, M.C.: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur. J. Oper. Res. 41(2), 232–239 (1989)

    Article  MathSciNet  MATH  Google Scholar 

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

  19. Breuer, M.A.: Simplification of the covering problem with application to boolean expressions. J. Assoc. Comput. Mach. 17, 166–181 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  20. Christofides, N.: Zero-one programming using non-binary tree-search. Comput. J. 14(4), 418–421 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  21. Day, R.H.: Letter to the editor—on optimal extracting from a multiple file data storage system: an application of integer programming. Oper. Res. 13(3), 482–494 (1965)

    Article  Google Scholar 

  22. Garfinkel, R.S., Nemhauser, G.L.: Optimal political districting by implicit enumeration techniques. Manage. Sci. 16(8), B495–B508 (1970)

    Article  MATH  Google Scholar 

  23. Housos, E., Elmroth, T.: Automatic optimization of subproblems in scheduling airline crews. Interfaces 27(5), 68–77 (1997)

    Article  Google Scholar 

  24. Musliu, N.: Local search algorithm for unicost set covering problem. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS (LNAI), vol. 4031, pp. 302–311. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Azimi, Z.N., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290–300 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  26. Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)

    Article  Google Scholar 

  27. Geem, Z.W.: Music-Inspired Harmony Search Algorithm: Theory and Applications, 1st edn. Springer, Heidelberg (2009)

    Book  Google Scholar 

  28. Geem, Z.W., Kim, J., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  29. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company, Cambridge (2001)

    MATH  Google Scholar 

  30. Omran, M.G.H., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198(2), 643–656 (2008)

    MathSciNet  MATH  Google Scholar 

  31. Xiang, W., An, M., Li, Y., He, R., Zhang, J.: An improved global-best harmony search algorithm for faster optimization. Expert Syst. Appl. 41(13), 5788–5803 (2014)

    Article  Google Scholar 

  32. Klenke, A.: Probability Theory: A Comprehensive Course. Springer, London (2008)

    Book  MATH  Google Scholar 

  33. Srinivas, M., Patnaik, L.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24, 656–667 (1994)

    Article  Google Scholar 

  34. Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part II. LNCS, vol. 7929, pp. 27–34. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Acknowledgements

Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455. Juan Salas, Sebastian Mansilla, Alvaro Gomez and Adrian Jaramillo are supported by Postgraduate Grant Universidad Catolica de Valparaiso 2016 (INF-PUCV 2016).

Author information

Authors and Affiliations

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

    Juan Salas, Broderick Crawford, Ricardo Soto, Álvaro Gómez Rubio, Adrián Jaramillo & Sebastián Mansilla Villablanca

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

    Ricardo Soto

  3. Universidad Científica del Sur, Lima, Peru

    Ricardo Soto

  4. Universidad Central de Chile, Santiago, Chile

    Broderick Crawford

  5. Facultad de Ingeniería y Tecnología, Universidad San Sebastián, Bellavista 7, 8420524, Santiago, Chile

    Broderick Crawford & Eduardo Olguín

Authors
  1. Juan Salas
    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. Álvaro Gómez Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Adrián Jaramillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Sebastián Mansilla Villablanca
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Eduardo Olguín
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juan Salas .

Editor information

Editors and Affiliations

  1. Iwate Prefectural University , Iwate, Japan

    Hamido Fujita

  2. Department Computer Science, Texas State University, San Marcos, Texas, USA

    Moonis Ali

  3. Universiti Teknologi Malaysis (UTM), Bahru, Malaysia

    Ali Selamat

  4. Iwate Prefectural University , Iwate, Japan

    Jun Sasaki

  5. Iwate Prefectural University , Iwate, Japan

    Masaki Kurematsu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Salas, J. et al. (2016). Binary Harmony Search Algorithm for Solving Set-Covering Problem. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds) Trends in Applied Knowledge-Based Systems and Data Science. IEA/AIE 2016. Lecture Notes in Computer Science(), vol 9799. Springer, Cham. https://doi.org/10.1007/978-3-319-42007-3_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42007-3_78

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-42007-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics