危险品配送的最小风险最低费用算法  

Minimum Risk and Minimum Cost algorithm about Hazardous Materials Transportation

作　　者：毛华[1] 刘辉[1] 史田敏[1,2] 

机构地区：[1]河北大学数学与计算机学院,河北保定071002 [2]沧州师范学院数学系,河北沧州061001

出　　处：《首都师范大学学报（自然科学版）》2014年第4期1-5,共5页Journal of Capital Normal University：Natural Science Edition

基　　金：河北省自然科学基金(A2013201119)资助项目

摘　　要：危险品道路运输因具有高风险性,一直备受关注.针对危险品配送路径优化问题,将所有可能影响风险的因素统一为一个风险函数考虑,同时综合考虑其他约束条件,提出一种基于深度优先的最小生成树改进算法,从而实现危险品运输中风险小而路径优之目的.实例表明,该算法复杂性低,占用空间小.The transportation of hazardous materials has drawn a wide attention because of its high risk. About the optimal routes of hazardous materials transportation, it considers all the affected factors as one characteristic risk function. Meanwhile, all the other constraints are taken into account. It proposes an optimal algorithm about hazardous materials distribution based on depth first searching minimum spanning tree. As a result, it arrives at the aim that the risk is smaller and the route is more optimal during transporting hazardous materials. A practical example shows that this algorithm makes the complexity low and takes the space small.

关 键 词：危险品运输 风险因素 风险矩阵 最小树 

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