Skip to main content

An Autonomous Galactic Swarm Optimization Algorithm Supported by Hidden Markov Model

  • Conference paper
  • First Online:
Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020) (SoCPaR 2020)

Abstract

In this work we implemented a version of the Galactic Swarm Optimization metaheuristic algorithm tuned by a hidden Markov model. The Galactic Swarm Optimization algorithm is an abstraction of the motion of stars within galaxies on the first level, and galaxies within a cluster of galaxies on the second level. We address the problem of controlling the metaheuristic parameters by identifying the state of the algorithm at each iteration i, using the Hidden Markov Model framework and updating the Galactic Swarm Optimization parameters accordingly. The results obtained show an improvement compared to the original algorithm using the fixed parameters found in the literature. In addition, the results are compared against other algorithms that use different techniques and hybridizations to solve the same problem, showing an improvement in performance with a similar quality for the solutions obtained.

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 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. Aoun, O., Sarhani, M., El Afia, A.: Hidden Markov model classifier for the adaptive particle swarm optimization. In: Recent Developments in Metaheuristics, pp. 1–15. Springer, Heidelberg (2018)

    Google Scholar 

  2. Crawford, B., Soto, R., Castro, C., Monfroy, E., et al.: An extensible autonomous search framework for constraint programming. Int. J. Phys. Sci. 6(14), 3369–3376 (2011)

    Google Scholar 

  3. Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Exp. Syst. Appl. 40(5), 1690–1695 (2013)

    Article  Google Scholar 

  4. Crawford, B., Soto, R., Olivares, R., Embry, G., Flores, D., Palma, W., Castro, C., Paredes, F., Rubio, J.M.: A binary monkey search algorithm variation for solving the set covering problem. Nat. Comput. 19, 1–17 (2019)

    MathSciNet  Google Scholar 

  5. Cubillos, C., Rodriguez, N., Crawford, B.: A study on genetic algorithms for the darp problem. In: International Work-Conference on the Interplay Between Natural and Artificial Computation, pp. 498–507. Springer, Heidelberg (2007)

    Google Scholar 

  6. El Afia, A., Sarhani, M., Aoun, O.: Hidden markov model control of inertia weight adaptation for particle swarm optimization. IFAC-PapersOnLine 50(1), 9997–10002 (2017)

    Article  Google Scholar 

  7. Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18, 50–60 (1947)

    Article  MathSciNet  Google Scholar 

  8. Muthiah-Nakarajan, V., Noel, M.M.: Galactic swarm optimization: a new global optimization metaheuristic inspired by galactic motion. Appl. Soft Comput. 38, 771–787 (2016)

    Article  Google Scholar 

  9. Rabiner, L., Juang, B.: An introduction to hidden Markov models. IEEE ASSP Mag. 3(1), 4–16 (1986)

    Article  Google Scholar 

  10. Rabiner, L.R.: Selected applications in speech recognition. In: Readings in Speech Recognition, p. 267 (1990)

    Google Scholar 

  11. Soto, R., Crawford, B., Almonacid, B., Paredes, F.: A migrating birds optimization algorithm for machine-part cell formation problems. In: Mexican International Conference on Artificial Intelligence, pp. 270–281. Springer, Heidelberg (2015)

    Google Scholar 

  12. Soto, R., Crawford, B., Toro, J.: Optimal keyboard design by using particle swarm optimization. In: International Conference on Human-Computer Interaction, pp. 281–284. Springer, Heidelberg (2018)

    Google Scholar 

  13. Zhan, Z.H., Zhang, J., Li, Y., Chung, H.S.H.: Adaptive particle swarm optimization. IEEE Trans. Syst. Man Cybern. Part B (Cybern) 39(6), 1362–1381 (2009)

    Article  Google Scholar 

Download references

Acknowledgements

Felipe Cisternas-Caneo and Marcelo Becerra-Rozas are supported by Grant DI Investigación Interdisciplinaria del Pregrado/VRIEA/PUCV/039.324/2020. Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR /1171243. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR /1190129. José Lemus-Romani is supported by National Agency for Research and Development (ANID)/Scholarship Program/DOCTORADO NACIONAL/2019-21191692.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mauricio Castillo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Castillo, M. et al. (2021). An Autonomous Galactic Swarm Optimization Algorithm Supported by Hidden Markov Model. In: Abraham, A., et al. Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020). SoCPaR 2020. Advances in Intelligent Systems and Computing, vol 1383. Springer, Cham. https://doi.org/10.1007/978-3-030-73689-7_34

Download citation

Publish with us

Policies and ethics