The expanded invasive weed optimization metaheuristic for solving continuous and discrete optimization problems.

This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical function...

Descripción completa

Detalles Bibliográficos
Publicado en:	Scientific World Journal pp. 831691 - 831692
Autores principales:	Josinski, Henryk, Kostrzewa, Daniel, Michalczuk, Agnieszka, Switonski, Adam, Josiński, Henryk, Switoński, Adam
Formato:	research Journal Article
Publicado:	Wiley-Blackwell 2014
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature.