计算机工程 ›› 2012, Vol. 38 ›› Issue (9): 268-270,274.doi: 10.3969/j.issn.1000-3428.2012.09.082

• 开发研究与设计技术 • 上一篇    下一篇

危险品运输中的最小风险最大流算法

毛 华,赵小娜,毛晓亮   

  1. (河北大学数学与计算机学院,河北 保定 071002)
  • 收稿日期:2011-08-12 出版日期:2012-05-05 发布日期:2012-05-05
  • 作者简介:毛 华(1963-),女,教授、博士,主研方向:网络物流,数据挖掘;赵小娜、毛晓亮,硕士研究生
  • 基金项目:
    保定市科学技术研究与发展计划基金资助项目(11ZG005)

Minimal Risk and Maximal Flow Algorithm in Hazardous Materials Transportation

MAO Hua, ZHAO Xiao-na, MAO Xiao-liang   

  1. (College of Mathematics & Computer Science, Hebei University, Baoding 071002, China)
  • Received:2011-08-12 Online:2012-05-05 Published:2012-05-05

摘要: 在危险品运输中,为使风险降到最低,提出一种最小风险最大流算法。将所有可能影响风险的因素统一为一个风险值进行考虑,采用风险性比值的方法得到最小风险比值路线,并沿该路线进行增流,设计危险品运输中的最小风险算法。实例结果表明,与经典的求最小费用流的最小费用路线算法相比,该算法复杂性更低,占用空间更小。

关键词: 最小风险最大流, 危险品运输, 风险比值, 可行流矩阵, 最短路线

Abstract: In hazardous materials transportation, to make the dangerous up to the lowest, this paper proposes a minimal risk and maximal flow algorithm. It presents an idea that all of the affected factors are considered as one characteristic risk ratio. Using the method of risk ratio, it obtains a path of minimal risk ratio. Along with this path, the feasible flows are increased. This realizes an algorithm of minimal risk in hazardous materials transportation. Numerical example shows that compared with the classical algorithms relative to minimal cost flow and minimal cost path, this new algorithm can make the complexity lower and take much smaller spaces.

Key words: minimal risk and maximal flow, hazardous materials transportation, risk ratio, feasible flow matrix, shortest path

中图分类号: