Minimal-cost path and mixed path distribution method for alleviating track traffic congestion

Abstract

The invention discloses a minimal-cost path and mixed path distribution method for alleviating track traffic congestion. According to the method, based on the traffic time of passengers, the congestion cost caused by congestion is comprehensively considered, the transportation cost is subjected to conversion, the Frank-Wolfe algorithm can be used for solving distributed traffic of track intervals, and then gathering and scattering of passenger flow can be achieved. By means of the method, the track traffic congestion can be effectively alleviated by changing paths of a small part of travelers and only slightly increasing the traffic time of a small part of travelers. By means of the mixed path distribution method, the average extra passenger number and the average transportation cost are both greatly lowered in a whole track traffic network by finding out nodes where the paths change through a shortest path method and a minimal cost method, and then the passengers are guided to select the minimal-cost paths in traffic flow guidance modes such as information publishing, so a shortest path state is changed into a minimal-cost path state.

Description

technical field [0001] The invention relates to a minimum cost path and a mixed path allocation method for alleviating rail traffic congestion. Background technique [0002] The transportation network plays an important role in modern society. However, due to the unbalanced distribution of demand, the transportation network often appears congested, which greatly affects the efficiency of the network. In order to improve the utilization efficiency of the transportation network, more and more researchers began to think about ways to alleviate network congestion from the perspective of routing. However, these methods still have the following problems: [0003] 1) In the method of using the shortest path assignment, the principle of choosing a path for any trip is that the total distance is the shortest, which leads to congestion of the network center node and greatly reduces the efficiency of the network; [0004] 2) The central node is deliberately avoided, so that the centr...

AI Technical Summary

Problems solved by technology

[0003] 1) In the method of using the shortest path assignment, the principle of choosing a path for any trip is that the total distance is the shortest, which leads to congestion of the network center node and greatly reduces the efficiency of the network;

[0004] 2) The central node is deliberately avoided, so that the central node is not effectively utilized;

[0008] 6) Some routing methods take each network node as the research object and establish a fixed path without considering the interaction between passenger flows; travelers with different starting and ending points may overlap in some intervals between stations, which may cause congestion in these intervals

[0009] To sum up, the current network congestion mitigation models either do not consider the passenger route selection game, or the algorithm adopts a heuristic algorithm, and obtains a suboptimal solution; or the objective function of the algorithm is not realistic, or the optimization process is complicated and difficult for practical application Big

Images