基于遗传算法的应急物资分层调度研究

Research on Hierarchical Scheduling of Emergency Supplies Based on Genetic Algorithm

针对多车型、多物资特征的应急物资调度问题,设计分层调度方案,同时给出由两层物资调度系统组成的调度算例,并将该算例转化为2个相关的单层物资调度问题。以最小化系统调度任务完成时间为目标函数,利用遗传算法对一级和二级调度方案进行求解,得出系统中每种车型依次将何种货物从何地运往何处的具体方案。通过车辆各自运输任务的运货量计算和仓库点物资的实时统计结果表明,该分层调度方案符合各仓库出货量不超过现存量且各灾害点物资需求得到满足的供求条件,求解步骤简单且运行速度快。

Aiming at the hierarchical scheduling problem of multi-vehicle and multi-supply,this paper proposes a hierarchical scheduling scheme.A two-layer scheduling example is demonstrated for the problem,and it decouples the tow-layer example into two single-layer problems.Taking minimize system scheduling task completion time as the objective function,it uses the genetic algorithm to get the scheduling scheme which describes the specific type of carried cargo,the source and the destination for each type of vehicle in sequence.In this hierarchical scheduling scheme,the output in each warehouse is below its storage,the requirement quantity of supplies in each emergency point meets requirement by the real-time statistics in each warehouse and the calculation of carried cargo in each task.The solving process of this scheme is simple and fast.