A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost

DOI10.1016/j.apm.2010.12.021zbMath1219.90040MaRDI QIDQ636547

Anthony Chen, Zi-You Gao, Meng Xu, Yunchao Qu

Publication date: 28 August 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2010.12.021

zbMATH Keywords

optimization; nonlinear complementarity problem; nonadditive cost; traffic equilibrium problem

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

90B20: Traffic problems in operations research

Cites Work

• Unnamed Item
• A conjugate gradient projection algorithm for the traffic assignment problem
• An efficient algorithm for computing traffic equilibria using TRANSYT model
• An efficient algorithm for optimal design of area traffic control with network flows
• A semismooth equation approach to the solution of nonlinear complementarity problems
• A penalized Fischer-Burmeister NCP-function
• Reformulating the traffic equilibrium problem via a smooth gap function.
• Computational study of state-of-the-art path-based traffic assignment algorithms
• Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
• The Traffic Equilibrium Problem with Nonadditive Path Costs
• A special newton-type optimization method
• Origin-Based Algorithm for the Traffic Assignment Problem
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
• A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs