INVESTIGADORES
MIRANDA BRONT Juan Jose
congresos y reuniones científicas
Título:
A Branch and Cut algorithm for the Time-Dependent Travelling Salesman Problem with Time Windows
Autor/es:
ISABEL MÉNDEZ-DÍAZ; JUAN JOSÉ MIRANDA BRONT; PAOLO TOTH; PAULA ZABALA
Lugar:
Montevideo
Reunión:
Workshop; VIII ALIO/EURO Workshop on Applied Combinatorial Optimization; 2014
Institución organizadora:
Facultad de Ingeniería, Universidad de la República
Resumen:
In this paper, we propose two integer linear programming formulations for the Time-Dependent TSP with Time Windows (TDTSP-TW). We provide several families of valid inequalities for the models which are included in a Branch and Cut algorithm, together with some of the valid inequalities proposed in the literature. Computational experiments are conducted to evaluate the formulations and to determine different parameters of the algorithm, obtaining good computational results and showing that the overall approach is proven to be effective.
