Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 313, Issue 2, Pages 465-477Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2023.08.021
Keywords
Travelling salesman; Time consistency; Benders' decomposition; Branch and cut
Ask authors/readers for more resources
This paper investigates two variants of the consistent travelling salesman problem and proposes a new mathematical model for solving it. The model is applicable to both scenarios with and without waiting times, and its effectiveness is demonstrated through computational experiments.
The consistent travelling salesman problem looks for a minimum-cost set of Hamiltonian routes, one for every day of a given time period. When a customer requires service in several days, the service times on different days must differ by no more than a given threshold (for example, one hour). We analyze two variants of the problem, depending on whether the vehicle is allowed to wait or not at a customer location before its service starts. There are three mathematical models in the literature for the problem without waiting times, and this paper describes a new model appropriated to be solved with a branch-and-cut algorithm. The new model is a multi-commodity flow formulation on which Benders' Decomposi-tion helps manage a large number of flow variables. There were no mathematical models in the literature for the variant with waiting times, and this paper adapts the four mathematical models to it. We analyze the computational results of the formulations on instances from the literature with up to 100 customers and three days. (c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ )
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available