Equilibrium traffic assignment for large scale transit networks

This paper develops a graph-theoretic framework for large scale transit networks and provides new insight into the equilibrium traffic assignment methodology. Variational inequality formulations for the equilibrium traffic assignment are developed and algorithms for computing equilibrium flows are discussed. A new shortest hyperpaths problem is defined and computational techniques for shortest hyperpaths suggested.