Mostrar el registro sencillo del ítem
Tournament selection algorithm for the multiple travelling salesman problem
dc.creator | Polychronis G., Lalis S. | en |
dc.date.accessioned | 2023-01-31T09:50:24Z | |
dc.date.available | 2023-01-31T09:50:24Z | |
dc.date.issued | 2020 | |
dc.identifier.isbn | 9789897584190 | |
dc.identifier.uri | http://hdl.handle.net/11615/78299 | |
dc.description.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. © 2020 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved | en |
dc.language.iso | en | en |
dc.source | VEHITS 2020 - Proceedings of the 6th International Conference on Vehicle Technology and Intelligent Transport Systems | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090790526&partnerID=40&md5=b14a7f356c4066eb325b7fdb1b5d2eda | |
dc.subject | Heuristic methods | en |
dc.subject | Intelligent systems | en |
dc.subject | Intelligent vehicle highway systems | en |
dc.subject | Iterative methods | en |
dc.subject | Traffic control | en |
dc.subject | General topology | en |
dc.subject | Heuristic principle | en |
dc.subject | Large neighbourhood searches | en |
dc.subject | New solutions | en |
dc.subject | Runtime overheads | en |
dc.subject | State-of-the-art algorithms | en |
dc.subject | Tournament selection | en |
dc.subject | Travelling salesman problem | en |
dc.subject | Traveling salesman problem | en |
dc.subject | SciTePress | en |
dc.title | Tournament selection algorithm for the multiple travelling salesman problem | en |
dc.type | conferenceItem | en |
Ficheros en el ítem
Ficheros | Tamaño | Formato | Ver |
---|---|---|---|
No hay ficheros asociados a este ítem. |