Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
- 1 February 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 32 (1), 54-64
- https://doi.org/10.1287/trsc.32.1.54
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.Keywords
This publication has 17 references indexed in Scilit:
- Directed hypergraphs and applicationsDiscrete Applied Mathematics, 1993
- Gainfree Leontief substitution flow problemsMathematical Programming, 1992
- A unified framework for estimating or updating origin/destination matrices from traffic countsTransportation Research Part B: Methodological, 1988
- Shortest path methods: A unifying approachPublished by Springer Nature ,1986
- Solution Algorithms for Network Equilibrium Models with Asymmetric User CostsTransportation Science, 1982
- On Stochastic Models of Traffic AssignmentTransportation Science, 1977
- Common Bus LinesTransportation Science, 1975
- A probabilistic multipath traffic assignment model which obviates path enumerationTransportation Research, 1971
- The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case StudyJournal of the Operational Research Society, 1967
- A note on two problems in connexion with graphsNumerische Mathematik, 1959