Putting continuous metaheuristics to work in binary search spaces

BRODERICK   CRAWFORD LABRIN; RICARDO JAVIER SOTO DE GIORGIS; Gino Astorga; José García; Carlos Castro; Fernando Paredes

doi:10.1155/2017/8404231

Putting continuous metaheuristics to work in binary search spaces

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Gino Astorga, José García, Carlos Castro, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

Research output: Contribution to journal › Review article › peer-review

67 Scopus citations

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 algorithmsmust be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.

Original language	English
Article number	8404231
Journal	Complexity
Volume	2017
DOIs	https://doi.org/10.1155/2017/8404231
State	Published - 1 Jan 2017

Access to Document

10.1155/2017/8404231

Cite this

@article{05f0267228be4e009b03a4c4b07e4f46,

title = "Putting continuous metaheuristics to work in binary search spaces",

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 algorithmsmust be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.",

author = "{CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Gino Astorga and Jos{\'e} Garc{\'i}a and Carlos Castro and Fernando Paredes",

year = "2017",

month = jan,

day = "1",

doi = "10.1155/2017/8404231",

language = "English",

volume = "2017",

journal = "Complexity",

issn = "1076-2787",

}

TY - JOUR

T1 - Putting continuous metaheuristics to work in binary search spaces

AU - CRAWFORD LABRIN, BRODERICK

AU - SOTO DE GIORGIS, RICARDO JAVIER

AU - Astorga, Gino

AU - García, José

AU - Castro, Carlos

AU - Paredes, Fernando

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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 algorithmsmust be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.

AB - 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 algorithmsmust be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.

UR - http://www.scopus.com/inward/record.url?scp=85019679418&partnerID=8YFLogxK

U2 - 10.1155/2017/8404231

DO - 10.1155/2017/8404231

M3 - Review article

AN - SCOPUS:85019679418

VL - 2017

JO - Complexity

JF - Complexity

SN - 1076-2787

M1 - 8404231

ER -

Putting continuous metaheuristics to work in binary search spaces

Abstract

Access to Document

Other files and links

Cite this