Eglese, Richard, Maden, Will and Slater, Alan (2006) A Road TimetableTM to aid vehicle routing and scheduling. Computers & Operations Research, 33 (12). pp. 3508-3519. ISSN 0305-0548Metadata only available from this repository.
Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and the season of the year. Significant journey time differences occur mainly due to recurring instances and variations in levels of traffic congestion throughout the year. This paper examines the issues involved in constructing a database of road times for a road network that uses time-dependent data on the travel times for individual roads in the network to provide the expected times and distances between locations for journeys starting at different times. The benefits of time-dependent vehicle routing and scheduling systems are demonstrated by using real-world data for the road network in the north west of England.
|Subjects:||H Social Sciences > H Social Sciences (General)
H Social Sciences > HE Transportation and Communications
|Schools:||School of Applied Sciences|
1] Toth P, Vigo D, editors. The vehicle routing problem. Philadelphia: Society for Industrial and Applied Mathematics; 2002.
 R. Hall, On the road to recovery, ORMS Today 31 (2004) (3), pp. 40–49.
 B. Fleischmann, M. Gietz and S. Gnutzmann, Time-varying travel times in vehicle routing, Transportation Science 38 (2004), pp. 160–173. Full Text via CrossRef | View Record in Scopus | Cited By in Scopus (9)
 Fleischmann B, Gnutzmann S, Sandvoß E. Dynamic vehicle routing based on on-line traffic information. Working paper, University of Augsburg, 2003.
 S. Ichoua, M. Gendreau and J.-Y. Potvin, Vehicle dispatching with time-dependent travel times, European Journal of Operational Research 144 (2003), pp. 379–396. SummaryPlus | Full Text + Links | PDF (240 K) | View Record in Scopus | Cited By in Scopus (26)
 Kim S, Lewis ME, White CC III. Optimal vehicle routing with real-time traffic information. Working paper, College of Engineering, University of Michigan, 2004.
 Kim S, Lewis ME, White CC III. State space reduction for non-stationary stochastic shortest path problems with real-time traffic information. Working paper, College of Engineering, University of Michigan, 2004.
 E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959), pp. 269–271. MathSciNet
 K. Sung, M.G.H. Bell, M. Seong and S. Park, Shortest paths in a network with time-dependent flow speeds, European Journal of Operational Research 121 (2000), pp. 32–39. SummaryPlus | Full Text + Links | PDF (170 K) | MathSciNet | View Record in Scopus | Cited By in Scopus (11)
 B.-H. Ahn and J.-Y. Shin, Vehicle-routeing with time windows and time varying congestion, Journal of the Operational Research Society 42 (1991), pp. 393–400. Full Text via CrossRef | View Record in Scopus | Cited By in Scopus (16)
 M.E.T. Horn, Efficient modeling of travel in networks with time-varying link speeds, Networks 36 (2000), pp. 80–90. Full Text via CrossRef | View Record in Scopus | Cited By in Scopus (8)
 Fu L, Sun D, Rilett LR, Henderson J. Heuristic shortest path algorithms for ITS: state of the art. Computers & Operations Research, 2004, to appear.
 Maden W, Eglese RW. A vehicle routing and scheduling method using a road timetable. Working paper, Lancaster University Management School, 2004.
|Depositing User:||Sara Taylor|
|Date Deposited:||27 Mar 2008 11:32|
|Last Modified:||22 Oct 2008 13:04|
Downloads per month over past year
Repository Staff Only: item control page