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

Abstract

Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the… (More)
DOI: 10.1016/j.cor.2017.06.026

Topics

3 Figures and Tables

Cite this paper

@article{Montero2017AnIP, title={An integer programming approach for the time-dependent traveling salesman problem with time windows}, author={Agust{\'i}n Montero and Isabel M{\'e}ndez-D{\'i}az and Juan Jos{\'e} Miranda Bront}, journal={Computers & OR}, year={2017}, volume={88}, pages={280-289} }