Algorithm to Redistribute Capacity Between Transportation Network Sections

Abstract

AbstractA modification of the algorithm to control traffic flows in intelligent transportation systems is proposed. The basic algorithm uses the speed (or time) of movement as the transportation system functioning criterion, as well as the number of congested sections of the transport network. The algorithm is implemented as a solution to an optimization problem on the transportation network graph. The maximum carrying capacities of nodes and edges corresponding to transportation nodes and roads are set corresponding to the current condition. We also set the constraints on control options as possibilities to change the capacity. The second parameter used in the algorithm is the intensity of traffic flow on every element of the transportation network graph. The idea of the algorithm is to increase the carrying capacity of some edges with higher incoming traffic intensity at the expense of adjacent edges with extra carrying capacity compared to incoming flows. The algorithm repeats the procedures with redistributing flows as long as it is possible. It helps to reduce the total number of sections on the transportation network graph, where the intensities of incoming flows are higher than their capacities. The modification makes it possible to carry out the optimization of transportation system functioning integral criterion, which takes into account speed (or time) of transportation flows, traffic safety, and ecological damage. The control is based on increasing the capacity of overloaded sections at the expense of underloaded ones.KeywordsIntelligent transportation systemsEffectiveness criteriaOptimizationControlGraphs