IMPLICIT ENUMERATION OF HYPERPATHS IN A LOGIT MODEL FOR TRANSIT NETWORKS

This paper investigates the application of a legit model to urban tran sit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that a seq uential form of the logit model transcends the inherent limitations of the global form while retaining the algorithmic advantages similar to those obtained with the ordinary Legit model for private vehicle netw orks.