title: The expanded invasive weed optimization metaheuristic for solving continuous and discrete optimization problems.
abstract: 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.
authors: Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland.
authors: Henryk
authors: H
authors: Josiński
authors: Department of Industrial Informatics, Silesian University of Technology, Krasińskiego 8, 40-019 Katowice, Poland.
authors: Daniel
authors: 0000-0003-2781-3709
authors: D
authors: Kostrzewa
authors: Polish-Japanese Institute of Information Technology, Aleja Legionów 2, 41-902 Bytom, Poland.
authors: Agnieszka
authors: A
authors: Michalczuk
authors: Polish-Japanese Institute of Information Technology, Aleja Legionów 2, 41-902 Bytom, Poland.
authors: Adam
authors: A
authors: Switoński
mesh_terms: D000465:Algorithms; D011340:Problem Solving