Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem

Daniel Kostrzewa, Henryk Josiński

2013

Abstract

The Invasive Weed Optimization algorithm (IWO) is an optimization metaheuristic inspired by dynamic growth of weeds colony. The authors of the present paper have expanded the strategy of the search space exploration of the IWO algorithm introducing a hybrid method along with a concept of the family selection applied in the phase of creating individuals. The goal of the project was to evaluate the expanded IWO version (exIWO) as well as the original IWO by testing their usefulness for solving some test instances of the traveling salesman problem (TSP) taken from the TSPLIB collection which allows to compare the experimental results with outcomes reported in the literature. The results produced by other heuristic algorithms as well as the methods based on the self-organizing maps served as the reference points.

Paper Citation

in Harvard Style

Kostrzewa D. and Josiński H. (2013). Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 451-456. DOI: 10.5220/0004224204510456

in Bibtex Style

@conference{icaart13,
author={Daniel Kostrzewa and Henryk Josiński},
title={Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={451-456},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004224204510456},
isbn={978-989-8565-39-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem
SN - 978-989-8565-39-6
AU - Kostrzewa D.
AU - Josiński H.
PY - 2013
SP - 451
EP - 456
DO - 10.5220/0004224204510456