INVESTIGADORES
MIRANDA BRONT Juan Jose
congresos y reuniones científicas
Título:
An integer programming approach for the time dependent travelling saleman problem
Autor/es:
JUAN JOSÉ MIRANDA BRONT; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
Lugar:
Bonn
Reunión:
Conferencia; 23rd European Conference on Operational Research; 2009
Institución organizadora:
The Association of European Research Societies
Resumen:
The Time-Dependent Travelling Salesman Problem (TDTSP) is ageneralization of the traditional TSP where the travel cost betweentwo cities depends on the moment of the day the arc is taken. In thispaper, we focus in the case where the travel time between two citiesdepends not only on the distance between them, but also on the position of the arc in the tour. We consider the formulation proposedin Picard and Queyranne (1978) and derive some valid inequalities.We also present computational results for a Branch and Cut algo-rithm that incorporates these inequalities.
