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

Controllable risk and maximal flow algorithm in hazardous materials transportation

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

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

出　　处：《河北大学学报（自然科学版）》2013年第3期225-230,共6页Journal of Hebei University(Natural Science Edition)

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

摘　　要：危险品运输中,将道路实况、天气条件、交通状况和暴露人数等因素统一为一个风险值进行考虑.综合考虑运输风险和运输量,提出危险品运输路线的优化选择方案.在实际运输中,选择路线时,运用最大风险路算法,把风险降低到可控范围内.再调用Dinic算法,实现可控风险最大流的算法.实例结果表明:与经典的最小费用流的负费用圈算法相比,该算法复杂度低,占用空间小,可简化网络.When transporting dangerous goods, some factors such as road condition, weather, traffic information, population exposure and so on are usually described as one risk value. Considering the risk and the volume, an optimization options scheme is provided for transport dangerous goods. Once selecting a route in the actual transport, using the algorithm of maximal risk of road, the risk can be reduced to our controllable range. Combining with Dinic algorithm, controllable risk and maximal flow algorithm is real- ized. An real example shows that comparing with the classical algorithm relative to minimal cost flow, the new algorithm presented here makes the complexity lower and takes much smaller spaces, and in additon, simplifies the network.

关 键 词：危险品运输 最大风险路 增量矩阵 可控风险 最大流 

分 类 号：O23[理学—运筹学与控制论]