4.7 Article

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

期刊

MATHEMATICS
卷 9, 期 12, 页码 -

出版社

MDPI
DOI: 10.3390/math9121417

关键词

swarm intelligence method; parameter control; adaptive technique; hidden Markov model

资金

  1. [CONICYT/FONDECYT/REGULAR/1190129]
  2. [ANID/FONDECYT/REGULAR/1210810]

向作者/读者索取更多资源

Bio-inspired computing is a research area in artificial intelligence that studies how natural phenomena can inspire the design of intelligent programs. Swarm intelligence methods, a type of bio-inspired algorithm, have been effective optimization solvers. A hybrid approach proposed in this study adjusts parameters based on a state deduced by the swarm intelligence algorithm, showing good performance compared to the original version.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Mathematics

Stochastic Fractal Search Algorithm Improved with Opposition-Based Learning for Solving the Substitution Box Design Problem

Francisco Gonzalez, Ricardo Soto, Broderick Crawford

Summary: In this study, a hybrid approach combining stochastic fractal search algorithm with opposition-based learning was used to design substitution boxes with high nonlinearity. The proposed approach outperformed other methods based on metaheuristics and chaotic schemes in terms of performance evaluation metrics.

MATHEMATICS (2022)

Article Mathematics

Combining a Population-Based Approach with Multiple Linear Models for Continuous and Discrete Optimization Problems

Emanuel Vega, Ricardo Soto, Pablo Contreras, Broderick Crawford, Javier Pena, Carlos Castro

Summary: Population-based approaches offer new search strategies for optimization problems. This work proposes a hybrid architecture that intelligently balances population size by using learning components and statistical modeling methods. It demonstrates the viability and effectiveness of the approach through solving benchmark functions and the multidimensional knapsack problem.

MATHEMATICS (2022)

Article Computer Science, Artificial Intelligence

Predicting population size and termination criteria in metaheuristics: A case study based on spotted hyena optimizer and crow search algorithm

Emanuel Vega, Ricardo Soto, Broderick Crawford, Javier Pena, Pablo Contreras, Carlos Castro

Summary: This paper explores the ability of metaheuristics to autonomously predict population size and termination criteria, and presents interesting results in the experiments.

APPLIED SOFT COMPUTING (2022)

Article Operations Research & Management Science

The cumulative vehicle routing problem with time windows: models and algorithm

Alejandro Fernandez Gil, Eduardo Lalla-Ruiz, Mariam Gomez Sanchez, Carlos Castro

Summary: The Cumulative Vehicle Routing Problem with Time Windows (CumVRP-TW) is a vehicle routing variant that minimizes a cumulative cost function while respecting customers' time windows constraints. Mathematical models are proposed for soft and hard time windows constraints, allowing violations in the soft case subject to penalization. A matheuristic approach combining features of the Greedy Randomized Adaptive Search Procedure (GRASP) and the optimization model is proposed to solve the problem. Computational results show that the mathematical formulations provide optimal solutions for small scenarios, but the proposed matheuristic algorithm outperforms the exact solver for medium and large scenarios and reduces fuel consumption and carbon emissions when soft time windows are allowed to be violated.

ANNALS OF OPERATIONS RESEARCH (2023)

Editorial Material Chemistry, Multidisciplinary

Data Analytics and Machine Learning in Education

Juan A. A. Gomez-Pulido, Young Park, Ricardo Soto, Jose M. Lanza-Gutierrez

APPLIED SCIENCES-BASEL (2023)

Review Mathematics

Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review

Marcelo Becerra-Rozas, Jose Lemus-Romani, Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, Gino Astorga, Carlos Castro, Jose Garcia

Summary: This study is a continuation of research on the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. By analyzing 512 publications from 2017 to January 2022, the authors provide a comprehensive overview of the various ways to binarize this type of metaheuristics. The findings offer a theoretical foundation for novice researchers and expert researchers in the field of combinatorial optimization using metaheuristic algorithms, and highlight the impact of binarization mechanism on the performance of metaheuristic algorithms. The study emphasizes that there is no single general technique for efficient binarization, but rather multiple forms with different performances.

MATHEMATICS (2023)

Article Mathematics

Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem

Jose Garcia, Andres Leiva-Araos, Broderick Crawford, Ricardo Soto, Hernan Pinto

Summary: This paper examines the impact of solution initialization methods on the performance of a hybrid algorithm applied to the set union knapsack problem (SUKP). The weighted method outperforms random and greedy methods, demonstrating its effectiveness in improving algorithm performance. The results are compared with other metaheuristics that have previously solved SUKP, further showcasing the favorable performance of the weighted method.

MATHEMATICS (2023)

Article Mathematics, Applied

A Learning-Based Particle Swarm Optimizer for Solving Mathematical Combinatorial Problems

Rodrigo Olivares, Ricardo Soto, Broderick Crawford, Victor Rios, Pablo Olivares, Camilo Ravelo, Sebastian Medina, Diego Nauduan

Summary: This paper presents adaptive parameter control methods utilizing reinforcement learning in the particle swarm algorithm. The integration of Q-learning into the optimization algorithm allows for parameter adjustments during the run, enabling the algorithm to dynamically learn and adapt to the problem and its context. Experimental evaluation using instances of the NP-hard multidimensional knapsack problem demonstrates significant improvement in solution quality compared to the native version of the algorithm.

AXIOMS (2023)

Article Engineering, Multidisciplinary

Binarization of Metaheuristics: Is the Transfer Function Really Important?

Jose Lemus-Romani, Broderick Crawford, Felipe Cisternas-Caneo, Ricardo Soto, Marcelo Becerra-Rozas

Summary: This paper proposes an approach to solve binary combinatorial problems using continuous metaheuristics, focusing on the importance of binarization in the optimization process. Experimental results show that binarization rules have a greater impact on algorithm performance than transfer functions. It was found that sets of actions incorporating the elite or elite roulette binarization rule are the best.

BIOMIMETICS (2023)

暂无数据