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

Minimal Risk and Maximal Flow Algorithm in Hazardous Materials Transportation

作　　者：毛华[1] 赵小娜[1] 毛晓亮[1] 

机构地区：[1]河北大学数学与计算机学院,河北保定071002

出　　处：《计算机工程》2012年第9期268-270,274,共4页Computer Engineering

基　　金：保定市科学技术研究与发展计划基金资助项目(11ZG005)

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

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

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]