IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i12p1417-d577185.html
   My bibliography  Save this article

A Knowledge-Based Hybrid Approach on Particle Swarm Optimization Using Hidden Markov Models

Author

Listed:
  • Mauricio Castillo

    (Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile)

  • Ricardo Soto

    (Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile)

  • Broderick Crawford

    (Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile)

  • Carlos Castro

    (Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile)

  • Rodrigo Olivares

    (Escuela de Ingeniería Informática, Universidad de Valparaíso, Valparaíso 2362905, Chile)

Abstract

Bio-inspired computing is an engaging area of artificial intelligence which studies how natural phenomena provide a rich source of inspiration in the design of smart procedures able to become powerful algorithms. Many of these procedures have been successfully used in classification, prediction, and optimization problems. Swarm intelligence methods are a kind of bio-inspired algorithm that have been shown to be impressive optimization solvers for a long time. However, for these algorithms to reach their maximum performance, the proper setting of the initial parameters by an expert user is required. This task is extremely comprehensive and it must be done in a previous phase of the search process. Different online methods have been developed to support swarm intelligence techniques, however, this issue remains an open challenge. In this paper, we propose a hybrid approach that allows adjusting the parameters based on a state deducted by the swarm intelligence algorithm. The state deduction is determined by the classification of a chain of observations using the hidden Markov model. The results show that our proposal exhibits good performance compared to the original version.

Suggested Citation

  • Mauricio Castillo & Ricardo Soto & Broderick Crawford & Carlos Castro & Rodrigo Olivares, 2021. "A Knowledge-Based Hybrid Approach on Particle Swarm Optimization Using Hidden Markov Models," Mathematics, MDPI, vol. 9(12), pages 1-21, June.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1417-:d:577185
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/12/1417/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/12/1417/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Youssef Hamadi & Eric Monfroy & Frédéric Saubion, 2011. "What Is Autonomous Search?," Springer Optimization and Its Applications, in: Pascal van Hentenryck & Michela Milano (ed.), Hybrid Optimization, edition 1, pages 357-391, Springer.
    2. Takaaki Koike & Marius Hofert, 2019. "Markov Chain Monte Carlo Methods for Estimating Systemic Risk Allocations," Papers 1909.11794, arXiv.org, revised May 2020.
    3. Jana Ries & Patrick Beullens, 2015. "A semi-automated design of instance-based fuzzy parameter tuning for metaheuristics based on decision tree induction," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(5), pages 782-793, May.
    4. Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.
    5. Broderick Crawford & Ricardo Soto & Gino Astorga & José García & Carlos Castro & Fernando Paredes, 2017. "Putting Continuous Metaheuristics to Work in Binary Search Spaces," Complexity, Hindawi, vol. 2017, pages 1-19, May.
    6. Mohamed, Mohamed A. & Eltamaly, Ali M. & Alolah, Abdulrahman I., 2017. "Swarm intelligence-based optimization of grid-dependent hybrid renewable energy systems," Renewable and Sustainable Energy Reviews, Elsevier, vol. 77(C), pages 515-524.
    7. Lin Wang & Xiyu Liu & Minghe Sun & Jianhua Qu & Yanmeng Wei, 2018. "A New Chaotic Starling Particle Swarm Optimization Algorithm for Clustering Problems," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-14, August.
    8. Takaaki Koike & Marius Hofert, 2020. "Markov Chain Monte Carlo Methods for Estimating Systemic Risk Allocations," Risks, MDPI, vol. 8(1), pages 1-33, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. José García & Victor Yepes & José V. Martí, 2020. "A Hybrid k-Means Cuckoo Search Algorithm Applied to the Counterfort Retaining Walls Problem," Mathematics, MDPI, vol. 8(4), pages 1-22, April.
    2. José García & José V. Martí & Víctor Yepes, 2020. "The Buttressed Walls Problem: An Application of a Hybrid Clustering Particle Swarm Optimization Algorithm," Mathematics, MDPI, vol. 8(6), pages 1-22, May.
    3. Koike, Takaaki & Hofert, Marius, 2021. "Modality for scenario analysis and maximum likelihood allocation," Insurance: Mathematics and Economics, Elsevier, vol. 97(C), pages 24-43.
    4. Ji, Liuyan & Tan, Ken Seng & Yang, Fan, 2021. "Tail dependence and heavy tailedness in extreme risks," Insurance: Mathematics and Economics, Elsevier, vol. 99(C), pages 282-293.
    5. José García & Paola Moraga & Matias Valenzuela & Hernan Pinto, 2020. "A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem," Mathematics, MDPI, vol. 8(4), pages 1-22, April.
    6. Koike, Takaaki & Saporito, Yuri & Targino, Rodrigo, 2022. "Avoiding zero probability events when computing Value at Risk contributions," Insurance: Mathematics and Economics, Elsevier, vol. 106(C), pages 173-192.
    7. Takaaki Koike & Marius Hofert, 2020. "Modality for Scenario Analysis and Maximum Likelihood Allocation," Papers 2005.02950, arXiv.org, revised Nov 2020.
    8. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
    9. José García & José Lemus-Romani & Francisco Altimiras & Broderick Crawford & Ricardo Soto & Marcelo Becerra-Rozas & Paola Moraga & Alex Paz Becerra & Alvaro Peña Fritz & Jose-Miguel Rubio & Gino Astor, 2021. "A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem," Mathematics, MDPI, vol. 9(20), pages 1-19, October.
    10. Li, Nianqi & Klemeš, Jiří Jaromír & Sunden, Bengt & Wu, Zan & Wang, Qiuwang & Zeng, Min, 2022. "Heat exchanger network synthesis considering detailed thermal-hydraulic performance: Methods and perspectives," Renewable and Sustainable Energy Reviews, Elsevier, vol. 168(C).
    11. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    12. Usama Khaled & Ali M. Eltamaly & Abderrahmane Beroual, 2017. "Optimal Power Flow Using Particle Swarm Optimization of Renewable Hybrid Distributed Generation," Energies, MDPI, vol. 10(7), pages 1-14, July.
    13. Davoudkhani, Iraj Faraji & Dejamkhooy, Abdolmajid & Nowdeh, Saber Arabi, 2023. "A novel cloud-based framework for optimal design of stand-alone hybrid renewable energy system considering uncertainty and battery aging," Applied Energy, Elsevier, vol. 344(C).
    14. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    15. Michael J. Ryoba & Shaojian Qu & Yongyi Zhou, 2021. "Feature subset selection for predicting the success of crowdfunding project campaigns," Electronic Markets, Springer;IIM University of St. Gallen, vol. 31(3), pages 671-684, September.
    16. Mete Suleyman & Cil Zeynel Abidin & Özceylan Eren, 2018. "Location and Coverage Analysis of Bike- Sharing Stations in University Campus," Business Systems Research, Sciendo, vol. 9(2), pages 80-95, July.
    17. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    18. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    19. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    20. Ferdinando Pezzella & Enrico Faggioli, 1997. "Solving large set covering problems for crew scheduling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 41-59, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1417-:d:577185. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.