Skip to main content
SpringerLink
Log in

Cat Swarm Optimization with Different Transfer Functions for Solving Set Covering Problems

  • 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 9790))

Included in the following conference series:

Abstract

This work presents a study of a new binary cat swarm optimization. The cat swarm algorithm is a recent swarm metaheuristic technique based on the behaviour of discrete cats. We test the proposed binary cat swarm optimization solving the set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications, such as: political districting, information retrieval, production planning in industry, sector location and fire companies, among others. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions, S-shaped family and V-shaped family, which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary cat swarm algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.

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

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Beasley, J.: A lagrangian heuristic for set covering problems. Nav. Res. Logistics 37, 151–164 (1990)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

  5. Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353–371 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chu, S., Tsai, P.: Computational intelligence based on the behavior of cats. Int. J. Innovative Comput. Inf. Control 3, 163–173 (2007)

    Google Scholar 

  7. Chu, S., Tsai, P., Pan, J.: Cat swarm optimization. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 854–858. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Crawford, B., Soto, R., Berrios, 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, 1–8 (2015). (Article ID 578541)

    Article  MathSciNet  Google Scholar 

  9. 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, 1–8 (2014). (Article ID 189164)

    Article  Google Scholar 

  10. Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Using the bee colony optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014, Part I. CCIS, vol. 434, pp. 493–497. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

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

  12. Crawford, B., Soto, R., Monfroy, E., Paredes, F., Palma, W.: A hybrid ant algorithm for the set covering problem. Int. J. Phys. Sci. 6(19), 4667–4673 (2011)

    Google Scholar 

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

  14. Dorigo, M., Birattari, M., Stützle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)

    Article  Google Scholar 

  15. Eusuff, M., Lansey, K., Pasha, F.: Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng. Optim. 38(2), 129–154 (2006)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  18. Gouwanda, D., Ponnambalam, S.: Evolutionary search techniques to solve set covering problems. World Acad. Sci. Eng. Technol. 39, 20–25 (2008)

    Google Scholar 

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

  20. Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Heidelberg (1972)

    Book  MATH  Google Scholar 

  21. Lessing, L., Dumitrescu, I., Stützle, T.: A comparison between ACO algorithms for the set covering problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 1–12. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

  23. Mirjalili, S., Mohd, S., Taherzadeh, G., Mirjalili, S., Salehi, S.: A study of different transfer functions for binary version of particle swarm optimization. In: Swarm and Evolutionary Computation, pp. 169–174 (2011)

    Google Scholar 

  24. Panda, G., Pradhan, P., Majhi, B.: IIR system identification using cat swarm optimization. Expert Syst. Appl. 38, 12671–12683 (2011)

    Article  Google Scholar 

  25. Revelle, C., Marks, D., Liebman, J.C.: An analysis of private and public sector location models. Manag. Sci. 16(11), 692–707 (1970)

    Article  MATH  Google Scholar 

  26. Saremi, S., Mirjalili, S., Lewis, A.: How important is a transfer function in discrete heuristic algorithms. Neural Comput. Appl. 26(3), 625–640 (2015)

    Article  Google Scholar 

  27. Sharafi, Y., Khanesar, M., Teshnehlab, M.: Discrete binary cat swarm optimization algorithm. In: Computer, Control and Communication, pp. 1–6 (2013)

    Google Scholar 

  28. Simeone, B., Nouno, G., Mezzadri, M., Lari, I.: A boolean theory of signatures for tonal scales. Discrete Appl. Math. 165, 283–294 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  29. Soto, R., Crawford, B., Barraza, J., Johnson, F., Paredes, F.: Solving pre-processed set covering problems via cuckoo search and lévy flights. In: 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1–6 (2015)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  31. Tsai, P., Pan, J., Chen, S., Liao, B.: Enhanced parallel cat swarm optimization based on the taguchi method. Expert Syst. Appl. 39, 6309–6319 (2012)

    Article  Google Scholar 

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

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

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

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

    Article  Google Scholar 

  36. Yang, X.-S., Deb, S.: Cuckoo search via lévy flights. In: World Congress on Nature & Biologically Inspired Computing, NaBIC 2009, pp. 210–214 (2009)

    Google Scholar 

  37. Zhang, J., Wei, Q., Chen, G.: A heuristic approach for \(\lambda \)-representative information retrieval from large-scale data. Inf. Sci. 277, 825–841 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

The author Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897, Ricardo Soto is supported by Grant CONICYT/FONDE- CYT/REGULAR/1160455.

Author information

Authors and Affiliations

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

    Broderick Crawford, Ricardo Soto & Natalia Berrios

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

    Broderick Crawford

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

    Broderick Crawford & Eduardo Olguín

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

    Ricardo Soto

  5. Universidad Cientifica Del Sur, Lima, 18, Peru

    Ricardo Soto

  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. Natalia Berrios
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eduardo Olguín
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sanjay Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natalia Berrios .

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 and Telecommunications, 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., Soto, R., Berrios, N., Olguín, E., Misra, S. (2016). Cat Swarm Optimization with Different Transfer Functions for Solving Set Covering Problems. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2016. ICCSA 2016. Lecture Notes in Computer Science(), vol 9790. Springer, Cham. https://doi.org/10.1007/978-3-319-42092-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42092-9_18

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation