The Traveling Salesman Problem with Time-Dependent Service Times
CitationTas, D. ( 3–6 July 2016). The Traveling Salesman Problem with Time-Dependent Service Times, 28th European Conference on Operational Research (EURO 2016), Poznan, Poland.
This paper introduces a version of the classical traveling salesman problem with time-dependent service times. In our setting, the duration required to provide service to any customer is not fixed but defined as a function of the time at which service starts at that location. The objective is to minimize the total route duration, which consists of the total travel time plus the total service time. The proposed model can handle several types of service time functions, e.g., linear and quadratic functions. We describe basic properties for certain classes of service time functions, followed by the computation of valid lower and upper bounds. We apply several classes of subtour elimination constraints and measure their effect on the performance of our model. Numerical results obtained by implementing different linear and quadratic service time functions on several test instances are presented.