Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
Authors:
- A. FügenschuhAFA. Fügenschuh
- M. HertyMHM. Herty
- A. KlarAKA. Klar
- A. MartinAMA. Martin
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 16 (4) , 1155-1176
Abstract
A hierachy of simplified models for traffic flow on networks is derived from continuous traffic flow models based on partial differential equations. The hierachy contains nonlinear and linear combinatorial models with and without dynamics. Optimization problems are treated for all models and numerical results and algorithms are compared.Keywords
This publication has 23 references indexed in Scilit:
- Optimal Control for Traffic Flow NetworksJournal of Optimization Theory and Applications, 2005
- Congestion on Multilane HighwaysSIAM Journal on Applied Mathematics, 2003
- Hyperbolic Phase Transitions in Traffic FlowSIAM Journal on Applied Mathematics, 2003
- Extensions and Amplifications of a Traffic Model of Aw and RascleSIAM Journal on Applied Mathematics, 2002
- Resurrection of "Second Order" Models of Traffic FlowSIAM Journal on Applied Mathematics, 2000
- A Limited Memory Algorithm for Bound Constrained OptimizationSIAM Journal on Scientific Computing, 1995
- Representations of quasi-Newton matrices and their use in limited memory methodsMathematical Programming, 1994
- First order quasilinear equations with boundary conditionsCommunications in Partial Differential Equations, 1979
- Polygonal approximations of solutions of the initial value problem for a conservation lawJournal of Mathematical Analysis and Applications, 1972
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958