An enhanced lower bound for the Time-Dependent Travelling Salesman Problem

2020 ◽  
Vol 113 ◽  
pp. 104795 ◽  
Author(s):  
Tommaso Adamo ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero
Keyword(s):  
Lower Bound ◽  
Travelling Salesman Problem ◽  
Time Dependent ◽  
Travelling Salesman

Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem

2014 ◽  
Vol 48 (1) ◽  
pp. 46-58 ◽  
Author(s):  
Jean-François Cordeau ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero
Keyword(s):  
Travelling Salesman Problem ◽  
Branch And Cut ◽  
Time Dependent ◽  
Travelling Salesman

Facets and valid inequalities for the time-dependent travelling salesman problem

2014 ◽  
Vol 236 (3) ◽  
pp. 891-902 ◽  
Author(s):  
Juan José Miranda-Bront ◽  
Isabel Méndez-Díaz ◽  
Paula Zabala
Keyword(s):  
Valid Inequalities ◽  
Travelling Salesman Problem ◽  
Time Dependent ◽  
Travelling Salesman

scholarly journals Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning

Algorithms ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 340
Author(s):  
Gianpaolo Ghiani ◽  
Tommaso Adamo ◽  
Pierpaolo Greco ◽  
Emanuela Guerriero
Keyword(s):  
Machine Learning ◽  
Nearest Neighbor ◽  
Travelling Salesman Problem ◽  
Computing Time ◽  
Time Dependent ◽  
Machine Learning Techniques ◽  
Travelling Salesman ◽  
Distribution Management ◽  
Learning Techniques ◽  
Average Improvement

In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised techniques can be used to improve the quality of the solutions generated by a heuristic for the Time-Dependent Travelling Salesman Problem with no increased computing time. This can be useful in a real-time setting where a speed update (or the arrival of a new customer request) may lead to the reoptimization of the planned route. The main contribution of this work is to show how to reuse the information gained in those settings in which instances with similar features have to be solved over and over again, as it is customary in distribution management. We use a method based on the nearest neighbor procedure (supervised learning) and the K-means algorithm with the Euclidean distance (unsupervised learning). In order to show the effectiveness of this approach, the computational experiments have been carried out for the dataset generated based on the real travel time functions of two European cities: Paris and London. The overall average improvement of our heuristic over the classical nearest neighbor procedure is about 5% for London, and about 4% for Paris.

The Travelling Salesman Problem in symmetric circulant matrices with two stripes

2008 ◽  
Vol 18 (1) ◽  
pp. 165-175 ◽  
Author(s):  
IVAN GERACE ◽  
FEDERICO GRECO
Keyword(s):  
Computational Complexity ◽  
Lower Bound ◽  
Lower Bounds ◽  
Travelling Salesman Problem ◽  
Minimum Cost ◽  
Circulant Matrix ◽  
Upper And Lower Bounds ◽  
Circulant Matrices ◽  
Travelling Salesman ◽  
New Construction

The Symmetric Circulant Travelling Salesman Problem asks for the minimum cost tour in a symmetric circulant matrix. The computational complexity of this problem is not known – only upper and lower bounds have been determined. This paper provides a characterisation of the two-stripe case. Instances where the minimum cost of a tour is equal to either the upper or lower bound are recognised. A new construction providing a tour is proposed for the remaining instances, and this leads to a new upper bound that is closer than the previous one.

A branch-and-bound algorithm for the time-dependent travelling salesman problem

Networks ◽  
2018 ◽  
Vol 72 (3) ◽  
pp. 382-392 ◽  
Author(s):  
Anna Arigliano ◽  
Tobia Calogiuri ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero
Keyword(s):  
Branch And Bound ◽  
Travelling Salesman Problem ◽  
Branch And Bound Algorithm ◽  
Time Dependent ◽  
Travelling Salesman

Time-Dependent Travelling Salesman Problem

OPSEARCH ◽  
2005 ◽  
Vol 42 (3) ◽  
pp. 199-227 ◽  
Author(s):  
V. Bhavani ◽  
M. Sundara Murthy
Keyword(s):  
Travelling Salesman Problem ◽  
Time Dependent ◽  
Travelling Salesman
Sign in / Sign up

Export Citation Format

Share Document