Skip to main content

Solving the Set Covering Problem Using Cat Swarm Optimization Algorithm with a Variable Mixture Rate and Population Restart

  • Conference paper
  • First Online:
Applied Computational Intelligence and Mathematical Methods (CoMeSySo 2017)

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

Included in the following conference series:

  • 1027 Accesses

Abstract

Cat swarm optimization (CSO) is a novel metaheuristic based on swarm intelligence, presented in 2006 has demonstrated great potential generating good results and excellent performances simulating the behavior of domestic cats using two behavior: seeking and tracing mode, this mode are classified using a mixture rate (MR), this parameter finally defines the number of individuals who work by exploring and exploiting. This work presents an improvement structure of a binary cat swarm optimization using a total reboot of the population when loss diversity it is detected.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)

    Article  Google Scholar 

  2. Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 1995, MHS 1995, pp. 39–43. IEEE (1995)

    Google Scholar 

  3. Fister, I., Strnad, D., Yang, X.-S., Fister Jr., I.: Adaptation and hybridization in nature-inspired algorithms. In: Adaptation and Hybridization in Computational Intelligence, pp. 3–50. Springer (2015)

    Google Scholar 

  4. Sharafi, Y., Khanesar, M.A., Teshnehlab, M.: Discrete binary cat swarm optimization algorithm. In: 3rd International Conference on Computer, Control & Communication (IC4), 2013, pp. 1–6. IEEE (2013)

    Google Scholar 

  5. Current, J., Daskin, M., Schilling, D., et al.: Discrete network location models. Facility Locat. Appl. Theor. 1, 81–118 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Chu, S.-C., Tsai, P.-W., Pan, J.-S.: Cat swarm optimization. Pacific Rim International Conference on Artificial Intelligence, pp. 854–858. Springer (2006)

    Google Scholar 

  8. Fister Jr, I., Yang, X.-S., Fister, I., Brest, J., Fister, D.: A brief review of nature-inspired algorithms for optimization, arXiv preprint arXiv:1307.4186 (2013)

  9. Auger, A., Hansen, N.: A restart cma evolution strategy with increasing population size. In: The 2005 IEEE Congress on Evolutionary Computation, 2005, vol. 2, pp. 1769–1776. IEEE (2005)

    Google Scholar 

  10. Moscato, P., Cotta, C.: Una introducción a los algoritmos memeticos. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(19), 131–148 (2003)

    Google Scholar 

  11. Beasley, J.E.: Or-library: distributing test problems by electronic mail, Operations Research (OR) problems. Brunel University London, OR-Library (2016)

    Google Scholar 

  12. 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. vol. 2015 (2015)

    Google Scholar 

  13. Crawford, B., Soto, R., Berrios, N., Olguín, E.: Cat swarm optimization with different binarization methods for solving set covering problems. In: Artificial Intelligence Perspectives in Intelligent Systems, pp. 511–524. Springer (2016)

    Google Scholar 

  14. Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: Modern Trends and Techniques in Computer Science, pp. 65–73. Springer (2014)

    Google Scholar 

  15. 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, 8 pages (2014)

    Google Scholar 

Download references

Acknowledgements

The author Broderick Crawford is supported by grant CONICYT/FONDECYT/REGULAR/1171243 and Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hugo Caballero .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Crawford, B., Soto, R., Caballero, H. (2018). Solving the Set Covering Problem Using Cat Swarm Optimization Algorithm with a Variable Mixture Rate and Population Restart. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Applied Computational Intelligence and Mathematical Methods. CoMeSySo 2017. Advances in Intelligent Systems and Computing, vol 662. Springer, Cham. https://doi.org/10.1007/978-3-319-67621-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67621-0_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67620-3

  • Online ISBN: 978-3-319-67621-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics