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 good results in continuous search spaces. These algorithms must be adapted to solve binary problems. This paper surveys articl...
Saved in:
| Main Authors: | Broderick Crawford, Ricardo Soto, Gino Astorga, José García, Carlos Castro, Fernando Paredes |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2017/8404231 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems
by: Ricardo Soto, et al.
Published: (2014-01-01) -
Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
by: Broderick Crawford, et al.
Published: (2025-08-01) -
Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
by: Broderick Crawford, et al.
Published: (2014-01-01) -
A Bicriteria Approach Identifying Nondominated Portfolios
by: Javier Pereira, et al.
Published: (2014-01-01) -
Machine Learning and Metaheuristics Approach for Individual Credit Risk Assessment: A Systematic Literature Review
by: Álex Paz, et al.
Published: (2025-05-01)