Skip to Main content Skip to Navigation
Conference papers

Deterministic construction heuristics for the time-dependent travelling salesman problem

Abstract : The time-dependent travelling salesman problem (TD-TSP) extends the TSP by considering the travel time between two locations as time-dependent. As the TD-TSP is NP-hard, it is difficult to find an optimal solution for large-sized instances. In this case, construction heuristics provide fast and easy to implement solutions. Such solutions can be used in real-world situations where optimality is not necessary. Furthermore, they can be used for improvement heuristics as initial solutions. Although construction heuristics are commonly used for the TSP, only few of them are adapted to the TD-TSP. This thesis adapts and evaluates five of the most prominent construction algorithms of the TSP to the TD-TSP: Cheapest Insertion, Christofides, First Fit, Nearest Neighbour and Savings. In order to compare the performances of the considered heuristics, numerical experiments are performed on one artificial and two real-life based time-dependent benchmarks. The results of the comparison are validated on TSP instances from the literature. The outcomes show that the modified Savings algorithm outperforms all other approaches significantly.
Complete list of metadata
Contributor : CCSD Connect in order to contact the contributor
Submitted on : Thursday, March 3, 2022 - 10:48:24 AM
Last modification on : Wednesday, March 30, 2022 - 1:18:02 PM
Long-term archiving on: : Saturday, June 4, 2022 - 6:34:04 PM


Files produced by the author(s)


  • HAL Id : hal-03595274, version 1


Maximilian Zimmermann, Fayçal A. Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou. Deterministic construction heuristics for the time-dependent travelling salesman problem. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595274⟩



Record views


Files downloads