Linearized simplicial decomposition methods for computing traffic equilibria on networks

DOI10.1002/NET.3230140306MaRDI QIDQ3337182zbMATH OpenOpenAlexFDO

Authors Jong-Shi Pang, Chang-Sung Yu

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

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

Recommendations

• A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• A partial linearization method for the traffic assignment problem
• A simplicial decomposition method for the transit equilibrium assignment problem
• Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• Projection methods for variational inequalities with application to the traffic assignment problem

Cited in

(17)

• Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
• A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
• Asymmetric variational inequality problems over product sets: Applications and iterative methods
• A unified description of iterative algorithms for traffic equilibria
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• A general descent framework for the monotone variational inequality problem
• A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
• Subdivision schemes, network flows and linear optimization
• An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
• Analysis of a domain decomposition method for linear transport problems on networks
• A simplicial decomposition method for the transit equilibrium assignment problem
• Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
• An efficient algorithm for computing traffic equilibria using TRANSYT model
• Inexact Newton methods for the nonlinear complementarity problem
• A model for evaluation of transport policies in multimodal networks with road and parking capacity constraints
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem

This page was built for publication: Linearized simplicial decomposition methods for computing traffic equilibria on networks

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