ALGORITHM FOR CHANGING TRANSIT FLOWS IN THE TRANSPORT METER AT A GIVEN DIRECTLY

Abstract

An algorithm for reducing transit flows has been developed. As a result of the execution of the algorithm, the amount of flow on any section of the network will be maximum, and the total flow will consist of reduced transit flows, which will increase the efficiency of the use of vehicles. The flows are distributed in such a way that after applying the principle of superposition to them, the values of the total resulting flow on the arcs do not exceed their throughput capacities. Finding the integral maximum flow of the transport network in a given direction is considered. The algorithm consists of:

1. Finding the integral maximum flow of the transport network in a given direction (ZV) for each time interval, the matrices of the values of the maximum flows and the efficiencies of these flows are composed, the elements of which are the values of the maximum flows and the efficiencies of the flows for each combination of input and output.
2. Compilation of a list of flows, in which all elements are ranked from "worst" in terms of efficiency to "best" according to the data of the unit square and the reachability matrix.
3. Rejecting flows and obtaining a set of the most effective flows, forming a matrix of integral transit flow in the selected direction.
4. Compilation of the total set of arcs, which shows how much the integral flow of this arc exceeds its carrying capacity.
5. From the set of saturated arcs, the element with the maximum value of n1 is selected.
6. In each of the transit flows of the set where this selected arc meets, it is necessary to reduce the flow by n1 times so that after performing the superposition of the arc flows.
7. After that, the sets are rearranged.

The described actions are performed as long as there is at least one element in the set with n greater than zero.