A computer model for finding the time-dependent minimum path in a transit system with fixed schedules
暂无分享,去创建一个
This paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.
[1] Robert B. Dial,et al. A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .
[2] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[3] Stephen J. Garland,et al. Algorithm 97: Shortest path , 1962, Commun. ACM.
[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.