Skip to main content
SpringerLink
Log in
Book cover

Workshop on Engineering Applications

WEA 2017: Applied Computer Sciences in Engineering pp 565–578Cite as

A Meta-Optimization Approach for Covering Problems in Facility Location

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 742))

Abstract

In this paper, we solve the Set Covering Problem with a meta-optimization approach. One of the most popular models among facility location models is the Set Covering Problem. The meta-level metaheuristic operates on solutions representing the parameters of other metaheuristic. This approach is applied to an Artificial Bee Colony metaheuristic that solves the non-unicost set covering. The Artificial Bee Colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. This metaheuristic owns a parameter set with a great influence on the effectiveness of the search. These parameters are fine-tuned by a Genetic Algorithm, which trains the Artificial Bee Colony metaheuristic by using a portfolio of set covering problems. The experimental results show the effectiveness of our approach which produces very near optimal scores when solving set covering instances from the OR-Library.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    http://people.brunel.ac.uk/~mastjjb/jeb/info.html.

  2. 2.

    http://jgap.sourceforge.net.

References

  1. Balaji, S., Revathi, N.: A new approach for solving set covering problem using jumping particle swarm optimization method. Nat. Comput. 15(3), 503–517 (2016)

    Article  MathSciNet  Google Scholar 

  2. Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J. 2014(189164), 1–8 (2014)

    Article  Google Scholar 

  3. Crawford, B., Soto, R., Surez, M.O., Paredes, F., Johnson, F.: Binary firefly algorithm for the set covering problem. In: 2014 9th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1–5, June 2014

    Google Scholar 

  4. Crawford, B., Soto, R., Astorga, G., García, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017 (2017). Pages 19

    Google Scholar 

  5. Crawford, B., Soto, R., Berríos, N., Johnson, F., Paredes, F., Castro, C., Norero, E.: A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math. Probl. Eng. 2015 (2015)

    Google Scholar 

  6. 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). doi:10.1007/978-3-319-06740-7_6

    Chapter  Google Scholar 

  7. Crawford, B., Soto, R., Palma, W., Johnson, F., Paredes, F., Olguín, E.: A 2-level approach for the set covering problem: parameter tuning of artificial bee colony algorithm by using genetic algorithm. In: Tan, Y., Shi, Y., Coello, C. (eds.) Advances in Swarm Intelligence, vol. 8794, pp. 189–196. Springer, Cham (2014)

    Google Scholar 

  8. Crawford, B., Soto, R., Peña, C., Palma, W., Johnson, F., Paredes, F.: Solving the set covering problem with a shuffled frog leaping algorithm. In: Nguyen, N.T., Trawiński, B., Kosala, R. (eds.) ACIIDS 2015. LNCS (LNAI), vol. 9012, pp. 41–50. Springer, Cham (2015). doi:10.1007/978-3-319-15705-4_5

    Google Scholar 

  9. Crawford, B., Valenzuela, C., Soto, R., Monfroy, E., Paredes, F.: Parameter tuning of metaheuristics using metaheuristics. Adv. Sci. Lett. 19(12), 3556–3559 (2013)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  11. Drezner, T., Drezner, Z., Goldstein, Z.: A stochastic gradual cover location problem. Nav. Res. Logist. (NRL) 57(4), 367–372 (2010). doi:10.1002/nav.20410

    MathSciNet  MATH  Google Scholar 

  12. García, J., Crawford, B., Soto, R., Carlos, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 1–24 (2017)

    Google Scholar 

  13. García, J., Crawford, B., Soto, R., García, P.: A multi dynamic binary black hole algorithm applied to set covering problem. In: Del Ser, J. (ed.) Harmony Search Algorithm, pp. 42–51. Springer, Singapore (2017)

    Chapter  Google Scholar 

  14. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Engineering faculty, Computer Engineering Department (2005)

    Google Scholar 

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

  16. Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(3), 21–57 (2014)

    Article  Google Scholar 

  17. Lu, Y., Vasko, F.J.: An or practitioner’s solution approach for the set covering problem. Int. J. Appl. Metaheuristic Comput. (IJAMC) 6(4), 1–13 (2015)

    Article  Google Scholar 

  18. Schilling, D.A., Jayaraman, V., Barkhi, R.: A review of covering problem in facility location. Locat. Sci. 1(1), 25–55 (1993)

    MATH  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). doi:10.1016/j.asoc.2008.09.001

    Article  Google Scholar 

  20. Soto, R., Crawford, B., Muñoz, A., Johnson, F., Paredes, F.: Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. Advances in Intelligent Systems and Computing, vol. 347, pp. 89–97. Springer, Cham (2015). doi:10.1007/978-3-319-18476-0_10

    Google Scholar 

  21. Soto, R., Crawford, B., Olivares, R., Barraza, J., Figueroa, I., Johnson, F., Paredes, F., Olguín, E.: Solving the non-unicost set covering problem by using cuckoo search and black hole optimization. Nat. Comput. 16, 1–17 (2017)

    Article  MathSciNet  Google Scholar 

  22. Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19(6), 1363–1373 (1971). doi:10.1287/opre.19.6.1363

    Article  MATH  Google Scholar 

Download references

Acknowledgements

Broderick Crawford is supported by grant CONICYT/FONDECYT/REGULAR 1171243 and Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455, Gino Astorga is supported by Postgraduate Grant, Pontificia Universidad Catolica de Valparaíso, 2015 and José García is supported by INF-PUCV 2016. This research was partially funded by CORFO Program Ingeniería 2030 PUCV - Consortium of Chilean Engineering Faculties.

Author information

Authors and Affiliations

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

    Broderick Crawford, Ricardo Soto, Gino Astorga, José García & Enrique Cortes

  2. LINA, Universite de Nantes, Nantes, France

    Eric Monfroy

  3. Universidad de Valparaíso, 2361864, Valparaíso, Chile

    Gino Astorga

  4. Centro de Investigación y Desarrollo Telefónica, 7500961, Santiago, Chile

    José García

  5. Universidad de Playa Ancha, Leopoldo Carvallo 270, 2340000, Valparaíso, Chile

    Enrique Cortes

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. Eric Monfroy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gino Astorga
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. José García
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Enrique Cortes
    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. Universidad Distrital Francisco José de Caldas, Bogota, Colombia

    Juan Carlos Figueroa-García

  2. Universidad Distrital Francisco José de Caldas, Bogota, Colombia

    Eduyn Ramiro López-Santana

  3. Universidad Tecnológica de Bolívar, Cartagena, Colombia

    José Luis Villa-Ramírez

  4. Universidad Distrital Francisco José de Caldas, Bogota, Colombia

    Roberto Ferro-Escobar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Crawford, B., Soto, R., Monfroy, E., Astorga, G., García, J., Cortes, E. (2017). A Meta-Optimization Approach for Covering Problems in Facility Location. In: Figueroa-García, J., López-Santana, E., Villa-Ramírez, J., Ferro-Escobar, R. (eds) Applied Computer Sciences in Engineering. WEA 2017. Communications in Computer and Information Science, vol 742. Springer, Cham. https://doi.org/10.1007/978-3-319-66963-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66963-2_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66962-5

  • Online ISBN: 978-3-319-66963-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation