An integer programming approach for the time-dependent traveling salesman problem with time windows

•We study the Time-Dependent TSP with Time Windows and variable travel speeds.•We propose an ILP formulation.•An exact Branch and Cut algorithm is developed and experimentally evaluated.•Our approach produces good results on benchmark instances. Congestion in large cities and populated areas is one...

Ausführliche Beschreibung