Putting Continuous Metaheuristics to Work in Binary Search Spaces

Broderick Crawford, Ricardo Soto, Gino Astorga, José García, Carlos Castro and Fernando Paredes

Complexity, 2017, vol. 2017, 1-19

Abstract:

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.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2017/8404231.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2017/8404231.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:8404231

DOI: 10.1155/2017/8404231

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().