HighlightsIntegrated dynamic routing within stochastic TSP to determine robust tours on STD networks.The analysis of cost and on-time performance improvement of dynamic routing.Introduced a robustness measure for selecting tours in stochastic networks.Proposed a time-windows setting procedure for TSP tours on STD networks to improve the on-time performance.Demonstrated cost and delivery service level improvement through integrated dynamic routing within stochastic TSP.
AbstractWe consider finding static yet robust recurring milk-run tours while dynamically routing the vehicle between site visits. The network arcs experience recurrent congestion, leading to stochastic and time-dependent travel times. Based on vehicle location, time of day, and current and projected network congestion states, we generate dynamic routing policies (DRP) for every pair of sites using stochastic dynamic programming (SDP). By simulating DRP we find travel time distributions for each pair of sites which is used to build the robust tour using another SDP formulation. Results are very promising when the algorithms are tested in a simulated network using historical traffic data.
Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks
2016-10-26
17 pages
Article (Journal)
Electronic Resource
English
Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks
Online Contents | 2017
|The time-dependent vehicle routing problem with soft time windows and stochastic travel times
Online Contents | 2014
|Adaptive Transit Routing in Stochastic Time-Dependent Networks
Online Contents | 2016
|Adaptive Transit Routing in Stochastic Time-Dependent Networks
British Library Online Contents | 2016
|