A PUBLIC TRANSPORT ASSIGNMENT METHOD
F P Clerq · 1972
A method is described for finding the shortest route through a public transport network. The algorithm used is an extension of the once-through algorithm. Before the solution is presented the characteristics of the Moore algorithm and the once-through algorithm are mentioned and the difficulties and related assumptions concerning the search of routes through a public transport network are analyzed. Reference is made to methods developed elsewhere to solve these difficulties. An outline is given of the program package in which the algorithm is incorporated. /TRRL/