Traffic networks , conservation laws , control of discretized PDEs , adjoint calculus , combinatorial optimization
Abstract:
In this article, we discuss the optimization of a linearized traffic flow network model based on conservation laws. We present two solution approaches. One relies on the classical Lagrangian formalism (or adjoint calculus), whereas another one uses a discrete mixed-integer framework. We show how both approaches are related to each other. Numerical experiments are accompanied to show the quality of solutions.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Search Authors in
