Algorithms for computing traffic equilibria

DOI10.1023/B:NETS.0000015654.56554.31MaRDI QIDQ1770816zbMATH OpenFDO

Authors Michael Patriksson

Publication date 7 April 2005

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

Full work available at URL https://doi.org/10.1023/B:NETS.0000015654.56554.31

zbMATH Keywords

complementaritydecompositionelastic demandsLagrangianmerit functionmonotonicityUser equilibrium

Mathematics Subject Classification ID

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

Recommendations

• Traffic assignment: equilibrium models
• A unified description of iterative algorithms for traffic equilibria
• Computing Wardropian equilibria in a complementarity framework
• scientific article; zbMATH DE number 3965791
• An efficient algorithm for computing traffic equilibria using TRANSYT model

Cited in

(21)

• Algorithms for distributing traffic flows
• On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
• A unified description of iterative algorithms for traffic equilibria
• A general equilibrium framework for integrated assessment of transport and economic impacts
• A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
• An \(N\)-path user equilibrium for transportation networks
• Incorporating ridesharing in the static traffic assignment model
• A heuristic for the doubly constrained entropy distribution/assignment problem
• A path-based double projection method for solving the asymmetric traffic network equilibrium problem
• A multiclass simultaneous transportation equilibrium model
• A convergent and efficient decomposition method for the traffic assignment problem
• 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
• Most likely traffic equilibrium route flows analysis and computation
• Numerical methods for the problem of traffic flow equilibrium in the Beckmann and the stable dynamic models
• A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
• scientific article; zbMATH DE number 3965791 (Why is no real title available?)
• Computing Wardropian equilibria in a complementarity framework
• An efficient algorithm for computing traffic equilibria using TRANSYT model
• Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems
• Improved noniterative algorithm for solving the traffic equilibrium problem

This page was built for publication: Algorithms for computing traffic equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770816)