A conjugate gradient projection algorithm for the traffic assignment problem
From MaRDI portal
Publication:597403
DOI10.1016/S0895-7177(03)00090-6zbMath1080.90020MaRDI QIDQ597403
Der-Horng Lee, Anthony Chen, Yu (Marco) Nie
Publication date: 6 August 2004
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (4)
A framework for and empirical study of algorithms for traffic assignment ⋮ A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost ⋮ Solving the combined modal split and traffic assignment problem with two types of transit impedance function ⋮ Simultaneously optimizing link tolls and signal settings in a road network
Cites Work
- Finiteness in restricted simplicial decomposition
- An approach to nonlinear programming
- Projected Newton methods and optimization of multicommodity flows
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- On the Goldstein-Levitin-Polyak gradient projection method
This page was built for publication: A conjugate gradient projection algorithm for the traffic assignment problem
