HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Convergent Algorithm for the Multimodal Traffic Equilibrium Problem

Abstract : The multimodal traffic equilibrium problem is in described in general by non-monotone, asymmetric, variational inequality problem. We show that in spite of the non-monotonicity of the cost operator, the problem may admit a different weaker property, which describes the hierarchical nature of the travel cost interactions. This property permits a natural decomposition approach, not otherwise available, which admits provably convergent algorithms- . We present one such algorithm, easily implementable using a solver for the single-class traffic equilibrium problem, and a convergence proof. This represents the first provably convergent method for solving the non-monot- one, asymmetric, traffic equilibrium problem.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:08:47 AM
Last modification on : Thursday, February 3, 2022 - 11:18:45 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:10:38 PM


  • HAL Id : inria-00072503, version 1



Laura Wynter. A Convergent Algorithm for the Multimodal Traffic Equilibrium Problem. [Research Report] RR-4125, INRIA. 2001. ⟨inria-00072503⟩



Record views


Files downloads