Efficient modeling of travel in networks with time-varying link speeds

作     者：Horn, MET 

作者机构：CSIRO Canberra ACT 2601 Australia 

出 版 物：《NETWORKS》 (网络)

年 卷 期：2000年第36卷第2期

页      面：80-90页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：vehicle routing vehicle scheduling fastest paths time-dependent networks label-setting algorithm 

摘      要：This paper investigates exact and approximate methods for estimating time-minimizing vehicular movements in road network models where link speeds vary over time. The assumptions made about network conditions recognize the intrinsic relationship between speed and travel duration and are substantiated by elementary methods to obtain link travel duration. The assumptions also imply a condition of FIFO consistency, which (as shown by work of Kaufman and Smith) justifies the use of Dijkstra s algorithm for path-finding purposes. The paper describes several adaptations of the Dijkstra algorithm, including new variants that are addressed specifically to the dynamic conditions mentioned above. Computational tests indicate that these procedures will be useful for scheduling, modeling, and other purposes, when applied to networks of substantial size. (C) 2000 John Wiley & Sons, Inc.