时变条件下的最佳应急物流路线选择  

Selection of optimal emergency logistics path under a time-varying condition

作　　者：孙佳[1] 盖文妹[2] 

机构地区：[1]中国民航管理干部学院航空安全管理系 [2]北京科技大学东凌经济管理学院

出　　处：《中国安全科学学报》2015年第10期160-165,共6页China Safety Science Journal

摘　　要：为求解时变条件下的最佳应急物流路线,研究时变应急物流网络中路径选择的优化问题。用图论和运筹学的理论和方法,建立最佳应急物流路线的数学模型。基于改进的Dijstra算法,设计求解这一模型的区间搜索算法。该算法是通过构造辅助函数调用改进的Dijkstra算法,在最优解的近似区间内多次迭代,逐渐逼近最优解,是一种近似的、快速的算法。通过仿真实例验证所建模型及算法,结果表明,当疏散行动可行且疏散起始时刻已知的情况下,可以求出最佳疏散路线;当疏散起始时刻未知时,还可以求出使疏散行动安全可行的最晚起始时刻。The optimization problem of path selection in a time-varying emergency logistics network was addressed. A model was built for path selection by using graph theory and operations research theory. An interval-searched algorithm was designed to solve the multi-objective time-varying shortest path problem presented in the model. On the basis of the improved Dijkstra algorithm algorithm,an interval search algorithm was designed for solving the model. Simulation results show that the proposed model and algorithm can be used to solve the best evacuation routes if the evacuation is feasible and evacuation starting time is known,and can also be used to solve a safe and feasible starting time to start the evacuation if the evacuation starting time is unknown.

关 键 词：应急物流管理 路径优化 多目标优化 改进Dijstra算法 时变 

分 类 号：X913.3[环境科学与工程—安全科学] U116.2[交通运输工程]