Transit Equilibrium Assignment: A Model and Solution Algorithms

Jia Hao Wu, Michael Florian and Patrice Marcotte
Additional contact information
Jia Hao Wu: Centre de recherche sur les transports, Université de Montréal
Michael Florian: Centre de recherche sur les transports and Département d'IRO, Université de Montréal
Patrice Marcotte: Centre de recherche sur les transports, Université de Montréal and Collége militaire royal de Saint-Jean

Transportation Science, 1994, vol. 28, issue 3, 193-203

Abstract: In this paper we propose a model for the transit equilibrium assignment problem (TEAP) and develop two algorithms for its solution. The behavior of the transit users is modeled by using the concept of hyperpaths (strategies) on an appropriate network (general network) which is obtained from the road network and the transit lines by a transformation which makes explicit the walk, wait, in-vehicle, transfer and alight arcs. The waiting (generalized) cost is a function of both frequency of the transit lines and congestion effects due to queues at stops. The TEAP is stated and formulated as a variational inequality problem, in the space of hyperpath flows, and then solved by the linearized Jacobi method and the projection method. We prove the global convergence of these two algorithms for strongly monotone arc cost mappings. The implementation of the algorithms and computational experiments are presented as well.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (57)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.3.193 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:28:y:1994:i:3:p:193-203

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().