The NP-hard Traveling Salesperson Problem with Time Windows (TSPTW) is concerned with visiting a given set of customers within their assigned time windows such that a given objective function is minimized. In contrast to traditional problems, where each customer gets assigned its own time window, in modern web-based systems the supplying company defines a set of time windows, from which the customer can then choose one of them. Therefore, by design, typically several customers are assigned to the same time window. Motivated by this development and the fact that practitioners seek for formulations that can easily and quickly be implemented, we introduce two mixed-integer linear programs (MILPs) for the asymmetric TSPTW that allow to computationally exploit the structure of the time windows and are also applicable for asymmetric travel times, for which the triangle inequalities do not hold. In particular we analyze and exploit the relations between time windows in order to reduce the number of binary variables in our MILPs. For the special case of non-overlapping time windows we can further simplify the constraint set and also reduce the number of continuous variables needed. Finally, we demonstrate the efficiency of our MILPs on benchmark instances related to an online shopping application.
• Reference REF focuses on providing competitive MILP formulations for the Traveling Salesperson Problem with Time Windows.
Efficient and Easy-to-Implement Mixed-Integer Linear Programs for the Traveling Salesperson Problem with Time Windows
Transportation research procedia
Computer Science