Putting continuous metaheuristics to work in binary search spaces
In the real world, there are a number of optimization problems whose search space is
restricted to take binary values; however, there are many continuous metaheuristics with …
restricted to take binary values; however, there are many continuous metaheuristics with …
Augmented whale feature selection for IoT attacks: Structure, analysis and applications
Smart connected appliances expand the boundaries of the conventional Internet into the
new Internet of Things (IoT). IoT started to hold a significant role in our life, and in several …
new Internet of Things (IoT). IoT started to hold a significant role in our life, and in several …
Development of hybrid machine learning models for predicting the critical buckling load of I-shaped cellular beams
HB Ly, TT Le, LM Le, VQ Tran, VM Le, HLT Vu… - Applied Sciences, 2019 - mdpi.com
The principal purpose of this work is to develop three hybrid machine learning (ML)
algorithms, namely ANFIS-RCSA, ANFIS-CA, and ANFIS-SFLA which are a combination of …
algorithms, namely ANFIS-RCSA, ANFIS-CA, and ANFIS-SFLA which are a combination of …
Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization
JM Lanza-Gutierrez, B Crawford, R Soto… - Expert Systems with …, 2017 - Elsevier
Abstract The Set Covering Problem (SCP) is one of the classical Karp's 21 NP-complete
problems. Although this is a traditional optimization problem, we find many papers assuming …
problems. Although this is a traditional optimization problem, we find many papers assuming …
Q-learnheuristics: Towards data-driven balanced metaheuristics
B Crawford, R Soto, J Lemus-Romani… - Mathematics, 2021 - mdpi.com
One of the central issues that must be resolved for a metaheuristic optimization process to
work well is the dilemma of the balance between exploration and exploitation. The …
work well is the dilemma of the balance between exploration and exploitation. The …
A multi dynamic binary black hole algorithm applied to set covering problem
The set covering problem seeks for minimum cost family of subsets from n given subsets,
which together covers the complete set. In this article, we present multi dynamic binary black …
which together covers the complete set. In this article, we present multi dynamic binary black …
Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
R Soto, B Crawford, R Olivares, J Barraza, I Figueroa… - Natural Computing, 2017 - Springer
The set covering problem is a classical optimization benchmark that finds application in
several real-world domains, particularly in line balancing production, crew scheduling, and …
several real-world domains, particularly in line balancing production, crew scheduling, and …
Exploring further advantages in an alternative formulation for the set covering problem
JM Lanza-Gutierrez, NC Caballe… - Mathematical …, 2020 - Wiley Online Library
The set covering problem (SCP) is an NP‐complete optimization problem, fitting with many
problems in engineering. The traditional SCP formulation does not directly address both …
problems in engineering. The traditional SCP formulation does not directly address both …
Solving the set covering problem using spotted hyena optimizer and autonomous search
Abstract The Set Covering Problem (SCP) is an important combinatorial optimization
problem that finds application in a large variety of practical areas, particularly in airline crew …
problem that finds application in a large variety of practical areas, particularly in airline crew …
Solving the set covering problem with the soccer league competition algorithm
A Jaramillo, B Crawford, R Soto, SM Villablanca… - Trends in Applied …, 2016 - Springer
Abstract The Soccer League Competition (SLC) algorithm is a new metaheuristic approach
intendended to solve complex optimization problems. It is based in the interaction model …
intendended to solve complex optimization problems. It is based in the interaction model …