Putting Continuous Metaheuristics to Work in Binary Search Spaces

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Complexity (New York, N.Y.) N.Y.), 2017-01, Vol.2017 (2017), p.1-19
Hauptverfasser: Castro, Carlos, García, José, Astorga, Gino, Soto, Ricardo, Crawford, Broderick, Paredes, Fernando
Format: Artikel
Sprache:eng
Schlagworte:
Analysis
Artificial intelligence
Binary searching
Binary system
Graph coloring
Heuristic
International conferences
Inventory control
Mathematical optimization
Operations management
Optimization
Optimization algorithms
Researchers
Searching
Traveling salesman problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 articles focused on the binarization of metaheuristics designed for continuous optimization.
ISSN:1076-2787
1099-0526
DOI:10.1155/2017/8404231