A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules

Abstract

Abstract 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.