.png){kind=icon}
.png){kind=icon}
Return
PARTIAL OUTER CONVEXIFICATION FOR TRAFFIC LIGHT OPTIMIZATION IN ROAD NETWORKS
.png){kind=icon}
OA
AI
DOI：10.1137/15M1048197.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of computing optimal traffic light programs for urban road intersections using traffic flow conservation laws on networks. Based on a partial outer convexification approach, which has been successfully applied in the area of mixed-integer optimal control for systems of ordinary or differential algebraic equations, we develop a computationally tractable two-stage solution heuristic. The two-stage approach consists of the solution of a (smoothed) nonlinear programming problem with dynamic constraints and a reconstruction mixed-integer linear program without dynamic constraints. The two-stage approach is founded on a discrete approximation lemma for partial outer convexification, whose grid-independence properties for (smoothed) conservation laws are investigated. We use the two-stage approach to compute traffic light programs for two scenarios on different discretizations and demonstrate that the solution candidates cannot be improved in a reasonable amount of time by global state-of-the-art mixed-integer nonlinear programming solvers. The two-stage solution candidates are not only better than results obtained by global optimization of piecewise linearized traffic flow models but also can be computed at a faster rate.
Keywords:
partial outer convexification
traffic networks
discretized conservation laws
optimization
mixed-integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W