基于改进飞蛾扑火算法求解多需求点的应急物资调度

Emergency Material Scheduling Based on Multi-requirement Points Applying the Improved Moth-flame Optimization Algorithm

快速有效的应急物资调度在救灾中扮演着重要的角色,因此研究应急物资调度问题具有重要的理论和实践意义.目前,大多数研究都是基于未考虑道路发生损坏情况下的,很少有学者研究基于道路损坏情况下的应急物资调度问题.为此,本文研究基于道路可行、道路可修复和道路不可通行三种道路损坏情况下多救援点对多需求点的多种应急物资调度问题,建立同时兼顾运输过程中物资装载总时间最少和所消耗成本最少的最优化目标函数,并使用改进飞蛾扑火群智能算法求解最优应急物资调度方案,取得了较理想的结果,可以为应急调度问题提供决策参考.

The fast and efficient emergency material scheduling are very important in the disaster rescue,and being of great theoretical and practical significance to study.Till now,most studies have been based on the lack of road damage,and a few scholars have studied the emergency materials scheduling based on road damage.The problem of multiple emergency supplies dispatch of multi-rescue points to multi-requirement points based on three kinds of road damage,which are feasible,repairable and impassable,was thus studied in this paper.The optimal objective function which takes into account the minimum loading time and the minimum cost during transportation was established,and the Improved Moth-flame optimization algorithm was applied to solve the optimal emergency supplies scheduling scheme,and the results are satisfactory,which can provide references for decision makers of emergency supplies scheduling.