Tournament Selection Algorithm for the Multiple Travelling Salesman Problem

Giorgos Polychronis, Spyros Lalis

Abstract

The multiple Travelling Salesman Problem (mTSP) is a generalization of the classic TSP problem, where the cities in question are visited using a team of salesmen, each one following a different, complementary route. Several algorithms have been proposed to address this problem, based on different heuristics. In this paper, we propose a new algorithm that employs the generic tournament selection heuristic principle, hybridized with a large neighbourhood search method to iteratively evolve new solutions. We describe the proposed algorithm in detail, and compare it with a state-of-the-art algorithm for a wide range of public benchmarks. Our results show that the proposed heuristic manages to produce solutions of the same or better quality at a significantly lower runtime overhead. These improvements hold for Euclidean as well as for general topologies.

Download


Paper Citation


in Harvard Style

Polychronis G. and Lalis S. (2020). Tournament Selection Algorithm for the Multiple Travelling Salesman Problem.In Proceedings of the 6th International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS, ISBN 978-989-758-419-0, pages 585-594. DOI: 10.5220/0009564905850594


in Bibtex Style

@conference{vehits20,
author={Giorgos Polychronis and Spyros Lalis},
title={Tournament Selection Algorithm for the Multiple Travelling Salesman Problem},
booktitle={Proceedings of the 6th International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS,},
year={2020},
pages={585-594},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009564905850594},
isbn={978-989-758-419-0},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 6th International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS,
TI - Tournament Selection Algorithm for the Multiple Travelling Salesman Problem
SN - 978-989-758-419-0
AU - Polychronis G.
AU - Lalis S.
PY - 2020
SP - 585
EP - 594
DO - 10.5220/0009564905850594