求解双层应急物资调度的改进蜂群算法

Improved Bee Colony Algorithm for Solving Double Layer Emergency Resource Scheduling

  • 摘要: 目前大多数的应急调度模型多以一层出救点来建立,而现实应急物资调度中,出救点不仅仅只有一层,而存在双层甚至是多层. 本文以非线性连续供给与消耗应急物资调度为背景,以物资调度总成本最小和整体反应时间最早为目标,建立由受灾点、分配中心和储备库组成的双层应急物资调度模型. 针对多目标多层级之间联动的应急物资调度模型的特点,采用基于反向学习策略和广泛学习策略的改进人工蜂群算法,得到Pareto最优解集,并分析Pareto前沿解集中解的个数与均匀性测度. 通过仿真实验验证了该模型的合理性和算法的有效性,实验结果表明该算法只需较少的成本和较早整体反应时间.

     

    Abstract: At present, most emergency scheduling models are constructed on single-layer rescue points, but these points may double or even become multilayer rescue points in actual emergency resource scheduling. Based on nonlinear continuous supply and consumption of emergency resource scheduling, we developed an emergency resource scheduling model with two layers of affected points, i.e., distribution centers and reserve bases, to minimize total cost and reaction times. Based on the characteristics of multi-targets and multi-layers of the emergency resource scheduling model, our improved artificial bee colony algorithm uses opposition-based and comprehensive learning concepts to obtain Pareto-optimal solution sets and then analyzes the number of solutions for a Pareto front and uniformity measure. The simulation results show the model to be reasonable and the algorithm to be effective. Therefore, the proposed algorithm can minimize costs and achieve quicker overall reaction times.

     

/

返回文章
返回