Optimizing Acyclic Traffic Signal Switching Sequences Through an Extended Linear Complementarity Problem Formulation

Reference

B. De Schutter, "Optimizing Acyclic Traffic Signal Switching Sequences Through an Extended Linear Complementarity Problem Formulation," European Journal of Operational Research, vol. 139, no. 2, pp. 400-415, June 2002.

Abstract

In this paper we first show how the Extended Linear Complementarity Problem, which is a mathematical programming problem, can be used to design optimal switching schemes for a class of switched systems with linear dynamics subject to saturation. More specifically, we consider the determination of the optimal switching time instants (the switching sequences are acyclic, but the phase sequence is pre-fixed). Although this method yields globally optimal switching time sequences, it is not feasible in practice due to its computational complexity. Therefore, we also discuss some approximations that lead to suboptimal switching time sequences that can be computed very efficiently and for which the value of the objective function is close to the global optimum. Finally we use these results to design optimal switching time sequences for a traffic signal controlled intersection so as to minimize criteria such as average queue length, worst case queue length, average waiting time, and so on.

Downloads

Bibtex entry

@article{DeS:99-01,
author={B. {D}e Schutter},
title={Optimizing Acyclic Traffic Signal Switching Sequences Through an Extended Linear Complementarity Problem Formulation},
journal={European Journal of Operational Research},
volume={139},
number={2},
pages={400--415},
month=jun,
year={2002},
doi={10.1016/S0377-2217(01)00364-2}
}

Go to the publications overview page.
This page is maintained by Bart De Schutter. Last update: February 21, 2026.