Algorithms for computing traffic equilibria

DOI10.1023/B:NETS.0000015654.56554.31zbMath1079.90141MaRDI QIDQ1770816

Michael Patriksson

Publication date: 7 April 2005

Published in: Networks and Spatial Economics (Search for Journal in Brave)

zbMATH Keywords

monotonicitydecompositionLagrangiancomplementaritymerit functionelastic demandsUser equilibrium

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20) Decomposition methods (49M27)

Related Items

A dual approach for solving the combined distribution and assignment problem with link capacity constraints, A nonlinear pairwise swapping dynamics to model the selfish rerouting evolutionary game, Incorporating ridesharing in the static traffic assignment model, A heuristic for the doubly constrained entropy distribution/assignment problem, Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems, A general equilibrium framework for integrated assessment of transport and economic impacts, A modified gradient projection algorithm for solving the elastic demand traffic assignment problem, A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions, A path-based double projection method for solving the asymmetric traffic network equilibrium problem, An \(N\)-path user equilibrium for transportation networks, A multiclass simultaneous transportation equilibrium model, A convergent and efficient decomposition method for the traffic assignment problem, On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks