An efficient computation algorithm for area traffic control problem with link capacity expansions

DOI10.1016/j.amc.2006.09.129zbMath1121.90026OpenAlexW2088271208MaRDI QIDQ2371987

Suh-Wen Chiou

Publication date: 10 July 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.129

zbMATH Keywords

network designarea traffic controlprojected quasi-Newton method

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items

A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models

Cites Work

• Unnamed Item
• An optimal scheme for toll pricing problem
• Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• Sensitivity Analysis for Equilibrium Network Flow
• Mathematical Programs with Equilibrium Constraints