Skip to main content

2018 | Supplement | Buchkapitel

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

verfasst von : Broderick Crawford, Ricardo Soto, Hugo Caballero

Erschienen in: Applied Computational Intelligence and Mathematical Methods

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)CrossRef Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)CrossRef
2.
Zurück zum Zitat 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) 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)
3.
Zurück zum Zitat 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) 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)
4.
Zurück zum Zitat 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) 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)
5.
Zurück zum Zitat Current, J., Daskin, M., Schilling, D., et al.: Discrete network location models. Facility Locat. Appl. Theor. 1, 81–118 (2002)MathSciNetCrossRefMATH Current, J., Daskin, M., Schilling, D., et al.: Discrete network location models. Facility Locat. Appl. Theor. 1, 81–118 (2002)MathSciNetCrossRefMATH
7.
Zurück zum Zitat Chu, S.-C., Tsai, P.-W., Pan, J.-S.: Cat swarm optimization. Pacific Rim International Conference on Artificial Intelligence, pp. 854–858. Springer (2006) Chu, S.-C., Tsai, P.-W., Pan, J.-S.: Cat swarm optimization. Pacific Rim International Conference on Artificial Intelligence, pp. 854–858. Springer (2006)
8.
Zurück zum Zitat 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) 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.
Zurück zum Zitat 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) 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)
10.
Zurück zum Zitat Moscato, P., Cotta, C.: Una introducción a los algoritmos memeticos. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(19), 131–148 (2003) Moscato, P., Cotta, C.: Una introducción a los algoritmos memeticos. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 7(19), 131–148 (2003)
11.
Zurück zum Zitat Beasley, J.E.: Or-library: distributing test problems by electronic mail, Operations Research (OR) problems. Brunel University London, OR-Library (2016) Beasley, J.E.: Or-library: distributing test problems by electronic mail, Operations Research (OR) problems. Brunel University London, OR-Library (2016)
12.
Zurück zum Zitat 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) 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)
13.
Zurück zum Zitat 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) 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)
14.
Zurück zum Zitat 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) 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)
15.
Zurück zum Zitat 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) 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)
Metadaten
Titel
Solving the Set Covering Problem Using Cat Swarm Optimization Algorithm with a Variable Mixture Rate and Population Restart
verfasst von
Broderick Crawford
Ricardo Soto
Hugo Caballero
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-67621-0_14