A Public Transit Network Route Generation Algorithm

Route generation task in a public transit network is a complex combinatorial problem which cannot be manually solved. This paper presents a computer algorithm for the solution of this problem. The presented algorithm has a novel initialization procedure. The algorithm is implemented and tested on Mandl's Swiss Road network [Mandl, 1979]. Extensive test runs of the proposed algorithm on this network show that the proposed algorithm has better average travel times in all cases except one and offers up to 23% cost savings compared to the most recent work [Fan and Mumford, 2010].