Skip to main content
SpringerLink
Log in

A Bi-Objetive Cat Swarm Optimization Algorithm for Set Covering Problem

  • Conference paper
  • First Online:
Artificial Intelligence Perspectives in Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 464))

  • 1102 Accesses

Abstract

In this paper, we study a classical problem in combinatorics and computer science, Set Covering Problem. It is one of Karp’s 21 NP-complete problems, using a new and original metaheuristic, Cat Swarm Optimization. This algorithm imitates the domestic cat through two states: seeking and tracing mode. The OR-Library of Beasley instances were used for the benchmark with additional fitness function, thus the problem was transformed from Mono-objective to Bi-objective. The Cat Swarm Optimization finds a set solution non-dominated based on Pareto concepts, and an external file for storing them. The results are promising for further continue in future work optimizing this problem.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1–4), 353–371 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Crawford, B., Soto, R., Berrios, N., Johnson, F., Paredes, F.: Binary cat swarm optimization for the set covering problem, pp. 1–4 (2015)

    Google Scholar 

  3. Chu, S.-C., Tsai, P.-W.: Computational intelligence based on the behavior of cats. Int. J. Innov. Comput. Inf. Control 3(1), 163–173 (2007)

    Google Scholar 

  4. Pradhan, P.M., Panda, G.: Solving multiobjective problems using cat swarm optimization. Exp. Syst. Appl. 39(3), 2956–2964 (2012)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Knowles, J., Corne, D.: The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99., vol. 1. IEEE (1999)

    Google Scholar 

Download references

Acknowledgments

The author Broderick Crawford is supported by grant CONICYT/FONDECYT/REGULAR/1140897 and Ricardo Soto is supported by grant CONICYT/FONDECYT/INICIACION/11130459

Author information

Authors and Affiliations

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

    Broderick Crawford, Ricardo Soto & Hugo Caballero

  2. Universidad San Sebastián, Santiago Metropolitan Region, Chile

    Broderick Crawford & Eduardo Olguín

  3. Universidad Central de Chile, Santiago Metropolitan Region, Chile

    Broderick Crawford

  4. Universidad Autónoma de Chile, Temuco, Chile

    Ricardo Soto

  5. Universidad Cientifica Del Sur, Lima, Peru

    Ricardo Soto

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. Hugo Caballero
    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

Corresponding author

Correspondence to Hugo Caballero .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Petr Silhavy

  5. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zdenka Prokopova

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Crawford, B., Soto, R., Caballero, H., Olguín, E. (2016). A Bi-Objetive Cat Swarm Optimization Algorithm for Set Covering Problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Artificial Intelligence Perspectives in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 464. Springer, Cham. https://doi.org/10.1007/978-3-319-33625-1_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33625-1_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33623-7

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation