摘要
研究了多受灾点的应急物资运送方案的优化问题。首先将各城市路径分布图进行简化,对各节点重新编号,采用Floyd算法求出各城市运送物资到达受灾地所需要的时间,建立了一个多目标应急物资配送模型并进行求解。其次,建立了基于双层规划方法的应急物资配送模型,采用动态优选策略求得全局满意应急方案。最后,为实现整体救灾目标,求得了近似最优解作为应急物资运送方案。
This paper studies the optimization of emergency supplies transportation scheme for multiple disaster areas.Firstly,the route distribution map of each city is simplified,and each node is renumbered.Floyd algorithm is employed to calculate the time required for each city to transport materials to the disaster-stricken area,a multi-objective emergency materials distribution model is established and solved.Secondly,the emergency material distribution model based on the bi-level programming method is established,and the dynamic optimization strategy is adopted to obtain the overall satisfactory emergency plan.Finally,in order to achieve the overall disaster relief goal,the approximate optimal solution is obtained as the emergency material transportation scheme.
作者
王金英
包立军
WANG Jin-ying;BAO Li-jun(College of Science,Liaoning University of Technology,Jinzhou 121001,China;Network Security Detachment,Jinzhou Public Security Bureau,Jinzhou 121001,China)
出处
《辽宁工业大学学报（自然科学版）》
2021年第5期325-329,共5页
Journal of Liaoning University of Technology(Natural Science Edition)
基金
辽宁省教育厅高校科研基金(JJL201915403)。
关键词
最短路径
FLOYD算法
资源竞争
动态优选策略
shortest path
Floyd algorithm
resource competition
dynamic optimizing strategy
