Large-scale schedule-based transit assignment - further optimization of the solution algorithms

Abstract

Nielsen (2004) discussed the design, implementation and optimization of a schedule-based public transit assignment model. Based on this, Nielsen & Frederiksen (2006) improved the model with respect to computation times. The present article describes further development and improvements of this model. The improvements span a wide range of approaches, including optimization of the shortest path algorithm and graph search, reducing the number of stochastic simulations, and making the equilibrium algorithm more efficient. The optimizations techniques were tested on the Copenhagen network in order to reduce the computation times for large-scale networks. Based on this recommendations are given on solution algorithms for schedulebased assignment procedures.