Emanuela Guerriero

Learn More
In this paper, we deal with the Time-Dependent Traveling Salesman Problem with Time Windows (T DT SP T W). Firstly, we prove that under special conditions the T DT SP T W can be solved as an Asymmetric Traveling Salesman Problem with Time Windows (AT SP T W), with suitable-defined time windows and (constant) travel times. Secondly, we show that, if the(More)
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of the uncertain parameters is modelled by means of a scenario tree and the resulting model is a multistage stochastic mixed-integer program. We develop a heuristic approach that exploits the specific structure of the problem. The computational experiments carried(More)
Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of the graph. The contribution of this paper is twofold. First, we describe a lower and upper bounding procedure that requires the solution of a simpler (yet(More)