) 东华大学 机械学院, 上海 201620
收稿日期:2019-06-23出版日期:2021-10-28发布日期:2021-11-01通讯作者:余立潮E-mail:15216879773@163.com作者简介:陈广锋(1976-),男,上海市人,副教授,主要研究方向为智能检测与控制.基金资助:国家重点研发计划资助项目(2017YFB1304000)Multi-Order Batch Optimization of Warehouse Based on Cascaded Improved Differential Evolution Algorithm
CHEN Guangfeng, YU Lichao() School of Mechanical Engineering, Donghua University, Shanghai 201620, China
Received:2019-06-23Online:2021-10-28Published:2021-11-01Contact:YU Lichao E-mail:15216879773@163.com摘要/Abstract
摘要： 为了提高仓储车间货物调度的柔性和响应效率,提出一种级联的改进差分进化算法,构建以拣货小车运行时间、货架稳定性及货位的存货能力为资源条件的货位分配和以每批订单中每一货物分配到对应分区的最优货位的最大完工时间为条件的订单重新分批分配的两级目标模型.将拉格朗日插值算法融进标准差分进化算法得到改进算法,分别求解两级目标模型,并将两级求解过程级联,完成级联关系的差分进化算法求解多订单分批分配问题.改进的差分进化算法在自适应地调整差分进化参数基础上,结合拉格朗日插值优化差分进化算法的局部搜索能力,运用局部和全局切换因子动态调整进化方向,提高算法的收敛性能.将改进的差分进化算法应用于求解多订单分批分配问题,实验结果证明,改进的算法优化结果明显优于粒子群优化算法、遗传算法及标准差分进化算法,减少了每一批订单的最大完工时间,有效地均衡工作负载.
关键词: 订单分批分配优化, 货架稳定性, 最大完工时间, 拉格朗日插值, 差分进化
Abstract: 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
PDF全文下载地址:
点我下载PDF
