We present a new solution approach for the time-dependent traveling salesman problem with time windows. This problem considers a salesman who departs from his home, has to visit a number of cities within a predetermined period of time, and then, returns home. The problem allows for travel times that can depend on the time of departure. We consider two objectives for the problem: (1) a makespan objective that seeks to return the salesman to his home as early as possible and (2) a duration objective that seeks to minimize the amount of time that he is away from his home. The solution approach is based on an integer programming formulation of the problem on a time-expanded network, because doing so enables time dependencies to be embedded in the definition of the network. However, because such a time-expanded network (and thus, the integer programming formulation) can rapidly become prohibitively large, the solution approach uses a dynamic discretization discovery framework, which has been effective in other contexts. Our computational results indicate that the solution approach outperforms the best-known methods on benchmark instances and is robust with respect to instance parameters.
https://doi.org/10.1287/trsc.2019.0911Cite as:
@article{Vu_2020,
doi = {10.1287/trsc.2019.0911},
url = {https://doi.org/10.1287%2Ftrsc.2019.0911},
year = 2020,
month = {may},
publisher = {Institute for Operations Research and the Management Sciences ({INFORMS})},
volume = {54},
number = {3},
pages = {703--720},
author = {Duc Minh Vu and Mike Hewitt and Natashia Boland and Martin Savelsbergh},
title = {Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows},
journal = {Transportation Science}
}