Using the expanded IWO algorithm to solve the traveling salesman problem

Daniel Kostrzewa; Henryk Josiński

Using the expanded IWO algorithm to solve the traveling salesman problem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

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.

Original language	English
Title of host publication	ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence
Pages	451-456
Number of pages	6
Publication status	Published - 2013
Event	5th International Conference on Agents and Artificial Intelligence, ICAART 2013 - Barcelona, Spain Duration: 15 Feb 2013 → 18 Feb 2013

Publication series

Name	ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence
Volume	2

Conference

Conference	5th International Conference on Agents and Artificial Intelligence, ICAART 2013
Country/Territory	Spain
City	Barcelona
Period	15/02/13 → 18/02/13

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 15 Life on Land

Keywords

Expanded IWO Algorithm
Inver-over Operator
Traveling salesman problem

ASJC Scopus subject areas

Artificial Intelligence

Cite this

@inproceedings{4e41d54494bd4a6db1453ad24fe041dc,

title = "Using the expanded IWO algorithm to solve the traveling salesman problem",

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.",

keywords = "Expanded IWO Algorithm, Inver-over Operator, Traveling salesman problem",

author = "Daniel Kostrzewa and Henryk Josi{\'n}ski",

year = "2013",

language = "English",

isbn = "9789898565389",

series = "ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence",

pages = "451--456",

booktitle = "ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence",

note = "5th International Conference on Agents and Artificial Intelligence, ICAART 2013 ; Conference date: 15-02-2013 Through 18-02-2013",

}

Kostrzewa, D & Josiński, H 2013, Using the expanded IWO algorithm to solve the traveling salesman problem. in ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence. ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence, vol. 2, pp. 451-456, 5th International Conference on Agents and Artificial Intelligence, ICAART 2013, Barcelona, Spain, 15/02/13.

Using the expanded IWO algorithm to solve the traveling salesman problem. / Kostrzewa, Daniel ; Josiński, Henryk.
ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence. 2013. p. 451-456 (ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Using the expanded IWO algorithm to solve the traveling salesman problem

AU - Kostrzewa, Daniel

AU - Josiński, Henryk

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Expanded IWO Algorithm

KW - Inver-over Operator

KW - Traveling salesman problem

UR - https://www.scopus.com/pages/publications/84877989488

M3 - Conference contribution

AN - SCOPUS:84877989488

SN - 9789898565389

T3 - ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence

SP - 451

EP - 456

BT - ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence

T2 - 5th International Conference on Agents and Artificial Intelligence, ICAART 2013

Y2 - 15 February 2013 through 18 February 2013

ER -

Using the expanded IWO algorithm to solve the traveling salesman problem

Abstract

Publication series

Conference

UN SDGs

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this