Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks

Abstract

This paper investigates the application of a logit model to urban transit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that a sequential 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 logit model for private vehicle networks.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 105 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.