Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 372-383 |
| Number of pages | 12 |
| Journal | European Journal of Operational Research |
| Volume | 248 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 16 Jan 2016 |
Funding
This research was partly supported by the Canadian Natural Sciences and Engineering Research Council under Grants 338816-10 , 436014-2013 and 39682-10 . This support is gratefully acknowledged. Thanks are due to Emanuela Guerriero and to the referees for their valuable comments.
Keywords
- Lower and upper bounds
- Service times
- Time-dependency
- Traveling salesman problem
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management