Partial Outer Convexification for Traffic Light Optimization in Road Networks

@article{Gttlich2017PartialOC,
  title={Partial Outer Convexification for Traffic Light Optimization in Road Networks},
  author={Simone G{\"o}ttlich and Andreas Potschka and Ute Ziegler},
  journal={SIAM J. Sci. Comput.},
  year={2017},
  volume={39}
}
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… 

A partial outer convexification approach to control transmission lines

An efficient optimization approach is derived to calculate optimal controls of electric transmission lines that consist of time-dependent inflows and switches that temporarily disable single arcs or whole subgrids to reallocate the flow inside the system.

Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints

This work considers mixed-integer optimal control problems with combinatorial constraints that couple over time such as minimum dwell times and provides an exactness result for the penalty which yields a solution approach that convergences to partial minima.

Efficient Solution of Discrete Subproblems Arising in Integer Optimal Control with Total Variation Regularization

It is proved that solving an instance of the considered problem class is equivalent to solving a resource constrained shortest path problem (RCSPP) on a layered directed acyclic graph and that the accelerated A∗ algorithm and topological sorting outperform a general purpose IP solver significantly.

Combinatorial Integral Approximation Decompositions for Mixed-Integer Optimal Control

Solving mixed-integer nonlinear programs (MINLPs) is hard from both a theoretical and practical perspective. Decomposing the nonlinear and the integer part is promising from a computational point of

Real-time Intersection Optimization for Signal Phasing, Timing, and Automated Vehicles' Trajectories.

A joint optimization model is formulated which is reduced to and solved as a Minimum Cost Flow (MCF) problem and embedded into the RIO algorithm to operate the signal controller and to plan the movement of CAVs.

MOSTRO: A multi-objective system for traffic optimization

This methodology was applied to a case study of two urban intersections which are developed using tools such as SUMO and TraCI4Matlab and demonstrated that the MOSTRO methodology represents a better performance in the network compared to the fixed time.

Combinatorial Integral Approximation for Mixed-Integer PDE-Constrained Optimization Problems

We apply the basic principles underlying combinatorial integral approximation methods for mixed-integer optimal control with ordinary differential equations in general, and the sum-up rounding

Switching Cost Aware Rounding for Relaxations of Mixed-Integer Optimal Control Problems: the Two-Dimensional Case

It is shown that the one-dimensional SCARP algorithm can be employed on a serialization of the grid cells in these cases and still provides an efficient heuristic that yields superior performance compared with that of other rounding heuristics such as sum-up rounding (SUR).

A decomposition method for MINLPs with Lipschitz continuous nonlinearities

If only approximate Lipschitz constants are known, this work proves finite termination at approximate globally optimal points both for the case of exact and inexact function evaluations and derive additional conditions under which infeasibility can be detected.

An Indefinite Cycle Traffic Light Timing Strategy

The simulation results of random data and actual traffic data show that the strategy proposed can increase traffic efficiency by more than 15% at intersections, reduce vehicle detention, and relieve traffic congestion.

References

SHOWING 1-10 OF 29 REFERENCES

The Lagrangian relaxation for the combinatorial integral approximation problem

This study links the huge computational gains compared to state-of-the-art MILP solvers to an analysis of subproblems on the branching tree and proves polynomial runtime of the algorithm for special cases and numerical evidence for efficiency by means of a numerical benchmark problem.

Combinatorial integral approximation

This study focuses on combinatorial constraints, in particular on restrictions on the number of switches on a fixed time grid, and proposes a novel approach that is based on a decomposition of the MINLP into a NLP and a MILP.

On Perspective Functions and Vanishing Constraints in Mixed-Integer Nonlinear Optimal Control

An overview over a variety of different modeling approaches, including outer versus inner convexification, generalized disjunctive programming, and vanishing constraints is given, which gives the most satisfactory results.

The integer approximation error in mixed-integer optimal control

A constructive way to obtain an integer solution with a guaranteed bound on the performance loss in polynomial time is presented and it is proved that this bound depends linearly on the control discretization grid.

Relaxation methods for mixed-integer optimal control of partial differential equations

This work considers integer-restricted optimal control of systems governed by abstract semilinear evolution equations, and yields sufficient conditions such that the optimal value and the optimal state of the relaxed problem can be approximated with arbitrary precision by a control satisfying the integer restrictions.

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

A comprehensive description of the primal-dual interior-point algorithm with a filter line-search method for nonlinear programming is provided, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix.

Relaxations and Approximations for Mixed-Integer Optimal Control

This thesis treats different aspects of the class of Mixed-Integer Optimal Control Problems (MIOCPs), and presents several, partially new modeling approaches for MIOCPs together with the accompanying structural properties.

Relaxation methods for hyperbolic PDE mixed‐integer optimal control problems

The convergence analysis for methods solving partial differential equations constrained optimal control problems containing both discrete and continuous control decisions based on relaxation and