Journal of Shanghai Jiao Tong University ›› 2021, Vol. 55 ›› Issue (10): 1291-1302.doi: 10.16183/j.cnki.jsjtu.2019.176

Special Issue: 《上海交通大学学报》2021年12期专题汇总专辑 《上海交通大学学报》2021年“自动化技术、计算机技术”专题

Previous Articles     Next Articles

Multi-Order Batch Optimization of Warehouse Based on Cascaded Improved Differential Evolution Algorithm

CHEN Guangfeng, YU Lichao()   

  1. School of Mechanical Engineering, Donghua University, Shanghai 201620, China
  • Received:2019-06-23 Online:2021-10-28 Published:2021-11-01
  • Contact: YU Lichao


In order to improve the flexibility and response efficiency of warehouse dispatching, a cascaded improved differential evolution algorithm is proposed to construct the allocation of goods with the picking trolley running time, shelf stability, and inventory capacity as resource conditions. The maximum completion time for each item in the batch order assigned to the optimal location of the corresponding partition is the two-level target model that is re-batch-allocated for the conditional order. The Lagrangian interpolation algorithm is integrated into the improved algorithm of the standard differential evolution algorithm to solve the two-level target model, and the two-level solution process is cascaded to complete the cascaded differential evolution algorithm to solve the multi-order batch allocation problem. Based on the adaptive adjustment of differential evolution parameters, the improved differential evolution algorithm combines the local search ability of Lagrangian interpolation to optimize the differential evolution algorithm, and uses local and global switching factors to dynamically adjust the evolution direction and improve the convergence performance of the algorithm. The improved differential evolution algorithm is applied to solve the problem of multi-order batch allocation. The experimental results show that the improved algorithm optimization results are better than the particle swarm optimization algorithm, the genetic algorithm, and the standard differential evolution algorithm, which reduces the maximum completion time of each batch of orders and effectively balance the workload.

Key words: order batch allocation optimization, shelf stability, maximum completion time, Lagrangian difference, differential evolution

CLC Number: