基于最小费用最大流算法的冲突车流分配

Research of Conflict-Flow Distribution Based on Minimum-Cost Maximum-Flow Algorithm

从最短路径角度研究交通分配问题,利用Dijkstra算法求解最短路径,根据道路容量和运行时间的限制,得出非冲突车流的优化路径,在此基础上假设冲突发生,采用设置优先通行规则与最小费用最大流算法相结合,实现有交通冲突情况下的交通流分配。

This article studies the traffic distribution from the angle of the shortest path selection. Firstly, the minimal path can be found out by using the Dijkstra algorithm. Then the non-conflict traffic optimization path is obtained on the basis of road capacity and the limitation of operation. Finally, under the condition of this conflict assumption, it concludes that the goal of the trip distribution in traffic conflict situations can be achieved by setting priority rules and minimum cost maximum flow algorithm.