Skip to main content
SpringerLink
Log in

Solving the Set Covering Problem Using Spotted Hyena Optimizer and Autonomous Search

  • Conference paper
  • First Online:
Advances and Trends in Artificial Intelligence. From Theory to Practice (IEA/AIE 2019)

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

Abstract

The Set Covering Problem (SCP) is an important combinatorial optimization problem that finds application in a large variety of practical areas, particularly in airline crew scheduling or vehicle routing and facility placement problems. To solve de SCP we employ the Spotted Hyena Optimizer (SHO), which is a metaheuristic inspired by the natural behavior of the spotted hyenas. In this work, in order to improve the performance of our proposed approach we use Autonomous Search (AS), a case of adaptive systems that allows modifications of internals components on the run. We illustrate interesting experimental results where the proposed approach is able to obtain global optimums for a set of well-known set covering problem instances.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Smith, B.: Impacs-a bus crew scheduling system using integer programming. Math. Program. 42(1–3), 181–187 (1988)

    Article  MathSciNet  Google Scholar 

  2. Toregas, C., Swain, R., Revelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19, 1363–1373 (1971)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Beasley, J., JSmsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58, 293–300 (1992)

    Article  Google Scholar 

  5. Beasley, J.: A Lagrangian heuristic for set covering problems. Naval Res. Logist. 37, 151–164 (1990)

    Article  MathSciNet  Google Scholar 

  6. Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1–14 (2013)

    Article  Google Scholar 

  7. Hamadi, Y., Monfroy, E., Saubion, F.: An Introduction to Autonomous Search. Autonomous Search, pp. 1–11 (2011)

    Google Scholar 

  8. Soto, R., et al.: Using autonomous search for solving constraint satisfaction problems via new modern approaches. Swarm Evol. Comput. 30, 64–77 (2016)

    Article  Google Scholar 

  9. Crawford, B., Soto, R., Berríos, N., Johnson, F., Paredes, F.: Solving the set covering problem with binary cat swarm optimization. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds.) ICSI 2015. LNCS, vol. 9140, pp. 41–48. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-20466-6_4

    Chapter  Google Scholar 

  10. 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, Cham (2014). https://doi.org/10.1007/978-3-319-06740-7_6

    Chapter  Google Scholar 

  11. Crawford, B., et al.: Binarization methods for shuffled frog leaping algorithms that solve set covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 317–326. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18473-9_31

    Chapter  Google Scholar 

  12. Fisher, M., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Manage. Sci. 36(6), 674–688 (1990)

    Article  MathSciNet  Google Scholar 

  13. Dhiman, G., Kumar, V.: Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications. Adv. Eng. Softw. 114, 48–70 (2017)

    Article  Google Scholar 

  14. Hamadi, Y., Monfroy, E., Saubion, F.: What is Autonomous Search? Technical Report MSR-TR-2008-80, Microsoft Research (2008)

    Google Scholar 

  15. Soto, R., Crawford, B., Muñoz, A., Johnson, F., Paredes, F.: Preprocessing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Artificial Intelligence Perspectives and Applications. Advances in Intelligent (2015)

    Google Scholar 

  16. Nakib, A., Hilia, M., Heliodore, F., Talbi, E.: Design of metaheuristic based on machine learning: a unified approach. In: IPDPS Workshops, pp. 510–518 (2017)

    Google Scholar 

Download references

Acknowledgment

Broderick Crawford was supported by Grant CONICYT/FONDECYT/REGULAR 1171243, Ricardo Soto was supported by Grant CONICYT/FONDECYT/REGULAR 1190129, and Juan A. Gómez-Pulido was supported by Grant IB16002.

Author information

Authors and Affiliations

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

    Ricardo Soto, Broderick Crawford, Emanuel Vega & Alvaro Gómez

  2. University of Extremadura, 10003, Caceres, Spain

    Juan A. Gómez-Pulido

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. Emanuel Vega
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alvaro Gómez
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Juan A. Gómez-Pulido
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emanuel Vega .

Editor information

Editors and Affiliations

  1. Institute for Software Technology, Graz University of Technology, Graz, Austria

    Franz Wotawa

  2. Department of Applied Informatics, University of Klagenfurt, Klagenfurt, Austria

    Gerhard Friedrich

  3. Institute for Software Technology, Graz University of Technology, Graz, Austria

    Ingo Pill

  4. Institute for Software Technology, Graz University of Technology, Graz, Austria

    Roxane Koitz-Hristov

  5. Department of Computer Science, Texas State University, San Marcos, TX, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Soto, R., Crawford, B., Vega, E., Gómez, A., Gómez-Pulido, J.A. (2019). Solving the Set Covering Problem Using Spotted Hyena Optimizer and Autonomous Search. In: Wotawa, F., Friedrich, G., Pill, I., Koitz-Hristov, R., Ali, M. (eds) Advances and Trends in Artificial Intelligence. From Theory to Practice. IEA/AIE 2019. Lecture Notes in Computer Science(), vol 11606. Springer, Cham. https://doi.org/10.1007/978-3-030-22999-3_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22999-3_73

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22998-6

  • Online ISBN: 978-3-030-22999-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation