运费有差异的多品种流交通网络最小费用算法

An Algorithm for Minimum Cost in Multi commodity Flow Traffic Network with Different Conveyance Costs

摘要:

对运费有差异的多品种流交通网络进行了分析，构建了复合参数和复合指标，借鉴连续最短路算法和FordFulkerson算法，设计了运费有差异的多品种流最小费用算法，并通过算例证明了算法的可行性，为解决实际交通网络的相关问题提供了参考.

关键词:交通网络; 多品种流; 费用差异; 最小费用流; 连续最短路算法; FordFulkerson算法

Abstract:

Based on an analysis of the multicommodity flow traffic network with different costs, the composite parameters system and the composite indicators system were built. An algorithm for the minimum cost was designed with a reference to the successive shortest path algorithm and the Ford Fulkerson algorithm, and the feasibility of the algorithm is proved by the example, and the algorithm provides the basis for solving the related issues in actual traffic network.

Key words:traffic network; multi commodity flow; cost diversity; minimum cost flow; successive shortest path algorithm; FordFulkerson algorithm