Article ID: | iaor20072042 |
Country: | United Kingdom |
Volume: | 33 |
Issue: | 6 |
Start Page Number: | 1838 |
End Page Number: | 1856 |
Publication Date: | Jun 2006 |
Journal: | Computers and Operations Research |
Authors: | Potvin Jean-Yves, Brub Jean-Franois, Vaucher Jean |
Keywords: | programming: travelling salesman |
In this paper, we introduce a travel planning problem which is solved by computing time-dependent shortest paths through a fixed sequence of nodes. Given a predetermined itinerary, our travel planning problem consists in finding the best travel plan, involving planes and hotels, based on the traveler's preferences. Our time-dependent framework therefore models plane flights, hotels, stays in each city as well as global time constraints. Given the large size of time-dependent networks, an exact decomposition algorithm is devised to solve instances of realistic size in reasonable computation times.