An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics
The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial optimization problems is critical in the areas of operational research and en...
Main Authors: | José García, Gino Astorga, Víctor Yepes |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/3/225 |
Similar Items
-
Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review
by: Marcelo Becerra-Rozas, et al.
Published: (2022-12-01) -
A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems
by: José Lemus-Romani, et al.
Published: (2021-11-01) -
Binarization Technique Comparisons of Swarm Intelligence Algorithm: An Application to the Multi-Demand Multidimensional Knapsack Problem
by: José García, et al.
Published: (2022-09-01) -
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
by: Fernando Peres, et al.
Published: (2021-07-01) -
A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem
by: José García, et al.
Published: (2021-10-01)