Extensions to traffic control modeling store-and-forward

The store-and-forward traffic model is widely used because of its simplicity and reasonable comprehension. Its results determine the duration of the green light according to a preset cycle. This paper builds further on the currently existing model: it expands the definitional domain of the optimization problem by adding additional probabilistic requirements regarding the number of vehicles in a street segment between intersections controlled by traffic lights. The defined optimization problem minimizes the probability of increasing the number of vehicles in the considered transport network. A further extension of the store-and-forward model allows the control domain to contain both green lights and cycle durations. Such optimal control allows the achievement of additional objective functions such as minimizing the number of vehicles in the network and minimizing the total time spent through the network. The definition of this control problem is done through a bi-level hierarchical formalization involving the store-and-forward model. The derived extended models are numerically tested and compared with real cases, giving preference to the derived extensions of the classical store-and-forward model.