有限需求量的网络路径优选研究

“有限需求量的网络路径优选”是一种比较特殊的费用流问题。本文描述并分析有限需求量的网络路径优选问题,建立路径优选的最短时间非线性模型,该模型考虑把物资发送到相应路径的时间。在有限需求条件下,给出n条独立路径的优选定理。借助于该定理和最小费用最大流算法,提出有限需求量的网络路径优选算法,并用示例作算法验证。

A Study on Paths Optimization in a Network with Restriction of Finite Transported Material

"On paths optimization in a network with restriction of finite transported material" is very special cost flow problem. The problem and a nonlinear model of the minimal time on paths optimization are presented. The length of the queue of vehicles to transport the material is considered in the model. When the transported material is finite, the theorem on paths optimization between independent paths each other is presented and proved. On the base of the theorem and minimum cost maximum flow theory (MCMF), the algorithm to optimize paths in a network with restriction of finite transported material is presented. Finally, an example is given to validate the algorithm.