Research of Conflict-Flow Distribution Based on Minimum-Cost Maximum-Flow Algorithm
LI Yun
PAN Yingjiu
HOU Lixing
Abstract：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.
Keywords：conflict-flowtraffic distributionminimum-cost maximum-flow algorithmMatlab
Publication Date：2015-01-01
Online Publishing Date：2026-05-22(First online date of this platform, not the publication date of the document)
Pages：6( 25-30 )