Linearized simplicial decomposition methods for computing traffic equilibria on networks

DOI10.1002/net.3230140306zbMath0545.90037OpenAlexW2007389878MaRDI QIDQ3337182

Chang-Sung Yu, Jong-Shi Pang

Publication date: 1984

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230140306

zbMATH Keywords

global convergencevariational inequalitylinear approximationcomputational resultsfixed-demand traffic equilibrium problemlinearized simplicial decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items

Asymmetric variational inequality problems over product sets: Applications and iterative methods, A model for evaluation of transport policies in multimodal networks with road and parking capacity constraints, A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems, A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network, An efficient algorithm for computing traffic equilibria using TRANSYT model, Coupling the auxiliary problem principle with descent methods of pseudoconvex programming, NE/SQP: A robust algorithm for the nonlinear complementarity problem, Inexact Newton methods for the nonlinear complementarity problem, A simplicial decomposition method for the transit equilibrium assignment problem, A general descent framework for the monotone variational inequality problem, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, A unified description of iterative algorithms for traffic equilibria

Cites Work

• Projection methods for variational inequalities with application to the traffic assignment problem
• Unnamed Item