论文部分内容阅读
为求解时变条件下的最佳应急物流路线,研究时变应急物流网络中路径选择的优化问题。用图论和运筹学的理论和方法,建立最佳应急物流路线的数学模型。基于改进的Dijstra算法,设计求解这一模型的区间搜索算法。该算法是通过构造辅助函数调用改进的Dijkstra算法,在最优解的近似区间内多次迭代,逐渐逼近最优解,是一种近似的、快速的算法。通过仿真实例验证所建模型及算法,结果表明,当疏散行动可行且疏散起始时刻已知的情况下,可以求出最佳疏散路线;当疏散起始时刻未知时,还可以求出使疏散行动安全可行的最晚起始时刻。
In order to solve the optimal emergency logistics route under time-varying conditions, the optimization of route selection in time-varying emergency logistics network is studied. Using the theories and methods of graph theory and operations research, the mathematical model of the best emergency logistics route is established. Based on the improved Dijstra algorithm, an interval search algorithm for solving this model is designed. The proposed algorithm is an approximate and fast algorithm by constructing an auxiliary function called Dijkstra’s improved algorithm, iterating multiple times in the approximate interval of the optimal solution and gradually approaching the optimal solution. The simulation model is used to verify the proposed model and algorithm. The results show that the evacuation route can be obtained when evacuation is feasible and the evacuation start time is known. When evacuation start time is unknown, The latest starting moment for the safe and feasible operation.