The Problem of Setting Traffic Signal Cycles at Crossroads

Abstract

In this paper, the problem of setting traffic light cycles at crossroads and intersections is considered in order to reduce traffic congestion by minimizing total vehicle waiting time. A method to determine the family ℘ of all discrete cycle phasing systems with the minimum number of phases is presented. The aim is to detect the most appropriate phasing sequence for traffic control corresponding to a current traffic situation from among all the components of ℘. The method is applied at a complex multi-cross intersection. The problem, dealing with traffic movements and the conflicting relations that arise, is stated within the framework of graph theory. There are several methods for setting traffic signal cycles at traffic light intersections. In this paper and in the context of graph theory, we develop a method which aims to determine the family of all discrete phases of phase systems with the smallest number of phases. The aim is to select from the elements of the the appropriate phase system that corresponds to the current traffic situation.