Skip to main content
SpringerLink
Log in

Finding Solutions of the Set Covering Problem with an Artificial Fish Swarm Algorithm Optimization

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2016 (ICCSA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9786))

Included in the following conference series:

  • 1228 Accesses

Abstract

The Set Covering Problem (SCP) is a matrix that is composed of zeros and ones and consists in finding a subset of zeros and ones also, in order to obtain the maximum coverage of necessities with a minimal possible cost. In this world, it is possible to find many practical applications of this problem such as installation of emergency services, communications, bus stops, railways, airline crew scheduling, logical analysis of data or rolling production lines. SCP has been solved before with different nature inspired algorithms like fruit fly optimization algorithm. Therefore, as many other nature inspired metaheuristics which imitate the behavior of population of animals or insects, Artificial Fish Swarm Algorithm (AFSA) is not the exception. Although, it has been tested on knapsack problem before, the objective of this paper is to show the performance and test the binary version of AFSA applied to SCP, with its main steps in order to obtain good solutions. As AFSA imitates a behavior of a population, the main purpose of this algorithm is to make a simulation of the behavior of fish shoal inside water and it uses the population as points in space to represent the position of fish in the shoal.

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

Institutional subscriptions

Similar content being viewed by others

References

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

    MATH  Google Scholar 

  2. Crawford, B., Soto, R., Aguilar, R.C., Paredes, F.: A new artificial bee colony algorithm for set covering problems. Electr. Eng. Inf. Technol. 63, 31 (2014)

    Article  Google Scholar 

  3. Crawford, B., Soto, R., Aguilar, R.C., Paredes, F.: Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem. Sci. World J. 2014 (2014)

    Google Scholar 

  4. 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.) CSOC 2014. AISC, vol. 285, pp. 53–63. Springer, Switzerland (2014)

    Chapter  Google Scholar 

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

  6. Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization. Expert Syst. Appl. 40(5), 1690–1695 (2013)

    Article  Google Scholar 

  7. Crawford, B., Soto, R., Monfroy, E., Paredes, F., Palma, W.: A hybrid Ant algorithm for the set covering problem (2014)

    Google Scholar 

  8. Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. Modern Trends Tech. Comput. Sci. 285, 65–73 (2014)

    Article  Google Scholar 

  9. Crawford, B., Soto, R., Riquelme-Leiva, M., Peña, C., Torres-Rojas, C., Johnson, F., Paredes, F.: Modified binary firefly algorithms with different transfer functions for solving set covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) CSOC 2015. AISC, vol. 349, pp. 307–315. Springer, Switzerland (2015)

    Google Scholar 

  10. Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A new approach using a binary firefly algorithm for the set covering problem. WIT Trans. Inf. Commun. Technol. 63, 51–56 (2014)

    Article  Google Scholar 

  11. 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, vol. 9012, pp. 41–50. Springer, Heidelberg (2015)

    Google Scholar 

  12. Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Johnson, F., Paredes, F.: Binarization methods for shuffled frog leaping algorithms that solve set covering problems. Software Engineering in Intelligent Systems, pp. 317–326 (2015)

    Google Scholar 

  13. Crawford, B., Soto, R., Torres-Rojas, C., Peña, C., Riquelme-Leiva, M., Misra, S., Johnson, F., Paredes, F.: A binary fruit fly optimization algorithm to solve the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 411–420. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  14. Crawford, B., Soto, R., Aballay, F., Misra, S., Johnson, F., Paredes, F.: A teaching-learning-based optimization algorithm for solving set covering problems. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 421–430. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  15. Michalewicz, Z.: Genetic Algorithms \(+\) Data Structures \(=\) Evolution Programs, 3rd edn. Springer, Heidelberg (1996)

    Book  MATH  Google Scholar 

  16. Michalewicz, Z.: Genetic Algorithms \(+\) Data Structures \(=\) Evolution Programs. Springer Science & Business Media, Heidelberg (2013)

    MATH  Google Scholar 

  17. Soto, R., Crawford, B., Galleguillos, C., Barraza, J., Lizama, S., Muñoz, A., Vilches, J., Misra, S., Paredes, F.: Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9155, pp. 187–202. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  18. Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Misra, S., Johnson, F., Paredes, F.: A comparison of three recent nature-inspired metaheuristics for the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 431–443. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  19. Azad, M.A.K., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Solving multidimensional 0–1 knapsack problem with an artificial fish swarm algorithm. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 72–86. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Azad, M.A.K., Rocha, A.M.A., Fernandes, E.M.: Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems. Swarm Evol. Comput. 14, 66–75 (2014)

    Article  MATH  Google Scholar 

  21. Azad, M.A.K., Rocha, A.M.A., Fernandes, E.M.: Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm. J. Math. Model. Algorithms Oper. Res. 14(3), 1–18 (2015)

    MathSciNet  MATH  Google Scholar 

  22. Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization, vol. 12, pp. 37–60. Springer, Heidelberg (1980)

    Chapter  Google Scholar 

  23. Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85–93 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

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

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

  2. Universidad Central de Chile, 8370178, Santiago, Chile

    Broderick Crawford

  3. Universidad Autónoma de Chile, 7500138, Santiago, Chile

    Ricardo Soto

  4. Universidad Científica del Sur, Lima 18, Peru

    Ricardo Soto

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

    Broderick Crawford & Eduardo Olguín

  6. Covenant University, Ogun, 110001, Nigeria

    Sanjay Misra

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. Eduardo Olguín
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sanjay Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sebastián Mansilla Villablanca
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Álvaro Gómez Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Adrián Jaramillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Juan Salas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastián Mansilla Villablanca .

Editor information

Editors and Affiliations

  1. University of Perugia , Perugia, Italy

    Osvaldo Gervasi

  2. University of Basilicata , Potenza, Italy

    Beniamino Murgante

  3. Covenant University , Ota, Nigeria

    Sanjay Misra

  4. University of Minho , Braga, Portugal

    Ana Maria A. C. Rocha

  5. Polytechnic University , Bari, Italy

    Carmelo M. Torre

  6. Monash University , Clayton, Victoria, Australia

    David Taniar

  7. Kyushu Sangyo University , Fukuoka, Japan

    Bernady O. Apduhan

  8. Saint Petersburg State University , Saint Petersburg, Russia

    Elena Stankova

  9. Beijing University of Posts & Telecommunication , Beijing, China

    Shangguang Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Crawford, B. et al. (2016). Finding Solutions of the Set Covering Problem with an Artificial Fish Swarm Algorithm Optimization. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2016. ICCSA 2016. Lecture Notes in Computer Science(), vol 9786. Springer, Cham. https://doi.org/10.1007/978-3-319-42085-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42085-1_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42084-4

  • Online ISBN: 978-3-319-42085-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation