Controlled Networks to Solve Traffic Flows Problem

The optimal control problem of traffic flows in the city road network is considered. The control is performed by means of traffic lights at regulated intersections. The road network is presented as a directed graph of variable structure. Nodes of the graph are road sections and edges of the graph are maneuvers from one section to another. The maneuvers of traffic are performed by certain traffic light phases. The statement of the optimal control problem for traffic flows is nontrivial due to the complexity of the object and a large number of uncertainties that influences its behavior. The complexity of an object is caused by the absence of a mathematical model that includes the control and is capable of representing the dynamics of an object. The object is exposed to uncertainties of the data collected from the road infrastructure and vehicles, influencing each other, and has a few evident functional dependencies. In this study for a generalized description of traffic flows, a universal recurrent model based on the controlled networks is considered. The developed model made it possible to formulate the optimal control problem in the classical statement. Evolutionary algorithms are used to solve the optimal control problem, in particular, to determine the duration of the traffic light phases in accordance with the control quality criteria. An example of solving the optimal control problem for a group of intersections in Moscow is given.