有限缓存区自动化分拣车间调度混合人工蜂群算法

A Hybrid Artificial Bee Colony Algorithm for Automatic Sorting Shop Scheduling Problem with Limited Buffers

自动化订单分拣效率低下的问题普遍存在于各个生产销售企业的配送中心。针对以提高分拣效率、降低整个物流过程的成本为最终目标的有限缓存区自动化分拣车间调度问题,通过融合可操作性强并且合理有效的混合人工蜂群算法加以改善。在引领蜂阶段引入并使用遗传算法,设计了4种混合结构的调度算法。并且进一步利用插入和交换邻域的邻域搜索算法提升了混合算法的局部改良能力。通过仿真实验验证了所提混合调度算法的高效率和优越性。

The poor efficiency of order picking are widespread in the distribution center of each production and sales enter-prises. In order to improve the sorting efficiency, reduce the cost of the whole logistics process as the ultimate goal of limited buffer automatic sorting shop scheduling problem, a strong operability and effective hybrid artificial bee colony （HABC） algorithm is improved. Four scheduling algorithms for hybrid structures are designed by introducing and using genet- ic algorithm in the lead bee phase. To improved the hybrid algorithm of local improvement ability further use of insert and swap neighborhood search algorithm in HABC. The simu- lation results show that the proposed hybrid scheduling algo- rithm has high efficiency and superiority.