An enhanced lower bound for the Time-Dependent Travelling Salesman Problem
Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem amounts to find a Hamiltonian tour of least total duration. In this paper we exploit a new degree of freedom in the Cordeau et al. …