Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 831691, 14 pages
Research Article

The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and Discrete Optimization Problems

1Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland
2Department of Industrial Informatics, Silesian University of Technology, Krasińskiego 8, 40-019 Katowice, Poland
3Polish-Japanese Institute of Information Technology, Aleja Legionów 2, 41-902 Bytom, Poland

Received 23 August 2013; Accepted 18 January 2014; Published 19 March 2014

Academic Editors: M. A. Abido and G. Wei

Copyright © 2014 Henryk Josiński et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.