Reformulating the traffic equilibrium problem via a smooth gap function.
From MaRDI portal
Publication:1597124
DOI10.1016/S0895-7177(99)00231-9zbMath1042.90515OpenAlexW2070580876WikidataQ59297317 ScholiaQ59297317MaRDI QIDQ1597124
Publication date: 5 May 2002
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(99)00231-9
Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)
Related Items (8)
Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities ⋮ Improving the convergence of simulation-based dynamic traffic assignment methodologies ⋮ Incorporating transfer reliability into equilibrium analysis of railway passenger flow ⋮ A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ Doubly uncertain transportation network: degradable capacity and stochastic demand ⋮ Non-additive shortest path in the context of traffic assignment ⋮ A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Cites Work
- More test examples for nonlinear programming codes
- The gap function of a convex program
- On the convergence of descent methods for monotone variational inequalities
- Network economics: a variational inequality approach
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reformulating the traffic equilibrium problem via a smooth gap function.
