| 路径-脆弱点最短距离最大化的危险品运输网络设计 |
| |
| 引用本文： | 项寅,姜冠群.路径-脆弱点最短距离最大化的危险品运输网络设计[J].中国安全生产科学技术,2019,15(2):57-63. |
| |
| 作者姓名： | 项寅 姜冠群 |
| |
| 作者单位： | （上海财经大学 商学院，上海 200433） |
| |
| 基金项目： | 基金项目: 国家自然科学基金项目（71571114） |
| |
| 摘 要： | 为了实现危险品运输网络的有效设计，进而降低危险品运输风险。将分布于公路两侧的医院、学校、居民区、购物中心等人口集聚场所定义为“脆弱点”，并通过计算运输路径和脆弱点间的加权距离来评估路段风险；结合双层理论构建模型，上层规划为政府的网络设计问题，通过关闭部分路段来最大化危险品车辆行驶路径与各脆弱点间的最小加权距离，下层规划则为承运商的车辆路径选择问题；为求解模型，设计1类启发式算法，并对算法的计算时间复杂性进行证明，最后根据算例分析发现，该算法经过有限数量的迭代即可得到风险最小的、次小的、…、第k小的运输路径及对应的路段关闭方案，为寻求兼顾运输风险和运输成本的最优方案提供决策支持。
|
| 关 键 词： | 危险品运输 网络设计 启发式算法 双层规划 |
Design of dangerous goods transportation network with maximizing minimum distance between path and vulnerable points |
| |
| XIANG Yin,JIANG Guanqun.Design of dangerous goods transportation network with maximizing minimum distance between path and vulnerable points[J].Journal of Safety Science and Technology,2019,15(2):57-63. |
| |
| Authors: | XIANG Yin JIANG Guanqun |
| |
| Affiliation: | (College of Business, Shanghai University of Finance & Economics, Shanghai 200433, China) |
| |
| Abstract: | In order to carry out the effective design of dangerous goods transportation network, thus reduce the risk of dangerous goods transportation, the population aggregation places such as hospital, school, residential area, shopping center laying beside the roads were defined as the “vulnerable points”, and the risk of road section was assessed through calculating the weighted distance between the transportation path and the vulnerable points. A model was constructed by using the bi level theory, the upper level programming was the network design problem of government, and the minimum weighted distance between the path of dangerous goods vehicles and each vulnerable point was maximized by closing some road sections, while the lower level programming was the vehicle path selection problem of carrier. A heuristic algorithm was proposed to solve the model, and the complexity of calculation time of the algorithm was proved. Through the case analysis, it showed that the algorithm could obtain the transportation paths with the smallest risk, the second smallest risk, up to the kth smallest risk and their corresponding schemes of road section closing through the finite iteration. It provides the decision support for the government to seek the optimal scheme giving consideration to both transport risk and transport cost. |
| |
| Keywords: | dangerous goods transportation network design heuristic algorithm bi level programming |
|
| 点击此处可从《中国安全生产科学技术》浏览原始摘要信息 |
|
点击此处可从《中国安全生产科学技术》下载全文 |
|
