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

Research on hierarchical linkage scheduling emergency supplies based on genetic algorithm

提出了在多物资、多车型特征的应急物资分层调度情况下求解调度系统中各运输工具具体调度方案的算法。该算法以系统调度任务完成时间最小为目标,基于遗传算法采用整体联动的求解思想。实际应用中的调度问题往往具有层次性,针对物资分层联动调度问题,给出了物资两层调度的算例,并建立了相应的数学模型。算例中第一层调度系统由一级仓库、二级仓库、一级运输工具和一级路网构成;第二层调度系统由灾害点、二级仓库、二级运输工具和二级路网构成。将两层调度系统视做整体,采用基于遗传算法的整体联动求解方法对算例进行求解得出结果,并对结果进行分析论证,验证算法的可行性与有效性。

This paper presented an algorithm to calculate the plan for emergency supplies hierarchical scheduling which con- tained multiple types of vehicles and multiple types of supplies. The objective of this genetic-based algorithm was to find out the minimal scheduling time. And it implemented a global linkage approach in the algorithm. The scheduling problem in real- ity was often hierarchical. This paper constructed a two-stage scheduling case of materials and formed a model. This case con- sisted of a primary transportation system which included primary storages, secondary storages, primary means of transport and primary road network, and a secondary transportation system which included disaster points, secondary storages, secondary means of transport and secondary road network. Based on the genetic-based algorithm with a global linkage approach, it ob- tained the results by regarding the two scheduling stages as a whole. The feasibility and effectiveness of this algorithm is valida- ted via the analysis of results.