We investigate the value of choosing the next stop to visit in a multistop trip based on current traffic conditions to minimize the expected total travel time of the tour. We model this problem as a Markov decision process. Numerical examples are presented that indicate that the value of using current traffic information for dynamic tour determination can be significant.
Dynamic Traveling Salesman Problem: Value of Real-Time Traffic Information
IEEE Transactions on Intelligent Transportation Systems ; 13 , 2 ; 619-630
2012-06-01
567046 byte
Article (Journal)
Electronic Resource
English
Dynamic Traveling Salesman Problem: Value of Real-Time Traffic Information
Online Contents | 2012
|The A Priori Dynamic Traveling Salesman Problem with Time Windows
Online Contents | 2004
|The A Priori Dynamic Traveling Salesman Problem with Time Windows
British Library Online Contents | 2004
|Das asymmetrische Traveling-Salesman-Problem
SLUB | 1981
|The Electric Traveling Salesman Problem with Time Windows
Online Contents | 2016
|