计算机应用 ›› 2020, Vol. 40 ›› Issue (12): 3687-3694.DOI: 10.11772/j.issn.1001-9081.2020050639

• 应用前沿、交叉与综合 • 上一篇    下一篇

基于嵌套遗传算法的拣货作业联合优化

孙军艳, 陈智瑞, 牛亚儒, 张媛媛, 韩昉   

  1. 陕西科技大学 机电工程学院, 西安 710021
  • 收稿日期:2020-05-14 修回日期:2020-08-04 出版日期:2020-12-10 发布日期:2020-08-26
  • 通讯作者: 陈智瑞(1997-),女,陕西汉中人,硕士研究生,主要研究方向:供应链管理。390722942@qq.com
  • 作者简介:孙军艳(1978-),女,陕西大荔人,副教授,博士,主要研究方向:物流信息、供应链管理;牛亚儒(1993-),女,陕西渭南人,硕士研究生,主要研究方向:物流信息;张媛媛(1993-),女,陕西咸阳人,硕士研究生,主要研究方向:自动化;韩昉(1982-),女,陕西西安人,讲师,博士研究生,主要研究方向:自动化
  • 基金资助:
    陕西省工业科技攻关项目(2018GY-026);陕西省重点研发计划项目(2019GY-024);陕西科技大学博士科研启动基金资助项目(2018BJ-12)。

Joint optimization of picking operation based on nested genetic algorithm

SUN Junyan, CHEN Zhirui, NIU Yaru, ZHANG Yuanyuan, HAN Fang   

  1. College of Mechanical&Electrical Engineering, Shaanxi University of Science&Technology, Xi'an Shaanxi 710021, China
  • Received:2020-05-14 Revised:2020-08-04 Online:2020-12-10 Published:2020-08-26
  • Supported by:
    This work is partially supported by the Industrial Science and Technology Research Project of Shaanxi Province (2018GY-026), the Key Research and Development Program of Shaanxi Province (2019GY-024), the Doctoral Research Starting Foundation of Shaanxi University of Science & Technology (2018BJ-12).

摘要: 针对物流配送中心拣货作业过程中传统订单分批和拣货路径分步优化难以获得整体最优解的问题,为了提高拣货作业效率,提出了一种基于嵌套遗传算法的订单分批和路径优化的联合拣货策略。首先,建立了以拣货总时间最短为目标函数的订单分批与拣货路径联合优化模型;然后,考虑双重优化的复杂性,设计了一种嵌套遗传算法对模型进行求解,外层不断优化订单分批结果,内层根据外层订单分批结果优化拣货路径。算例结果表明,与传统的订单分步优化、分批分步优化策略相比,所提策略的拣货时间分别减少了45.6%、6%,基于嵌套遗传算法的联合优化模型得出的拣货路径更短、拣货时间更少。为验证该算法对不同规模订单均有较优性能,分别对10、20、50张订单规模的算例进行仿真实验,结果表明,随着订单量的增加,整体拣货距离和时间进一步减少,拣货时间的减少从6%增加到7.2%。基于嵌套遗传算法的拣货作业联合优化模型和其求解算法可以有效解决订单分批与拣货路径联合优化问题,为配送中心拣选系统的优化提供依据。

关键词: 订单分批, 拣货路径优化, 联合优化, 嵌套遗传算法, 拣货作业

Abstract: It is difficult to obtain the overall optimal solution by the traditional order batching and the picking path step-by-step optimization of picking operation in the logistics distribution center. In order to improve the efficiency of picking operation, a joint picking strategy based on nested genetic algorithm for order batching and path optimization was proposed. Firstly, the joint optimization model of order batching and picking path was established with the shortest total picking time as the objective function. Then, a nested genetic algorithm was designed to solve the model with the consideration of the complexity of double optimizations. The order batching result was continuously optimized in the outer layer, and the picking path was optimized in the inner layer according to the order batching result in the outer layer. Results of the examples show that, compared with the traditional strategies of order step-by-step optimization and step-by-step optimization in batches, the proposed strategy has reduced the picking time by 45.6% and 6% respectively, and the joint optimization model based on nested genetic algorithm results in shorter picking path and less picking time. To verify that the proposed algorithm has better performance on orders with different sizes, the simulation experiments were performed to the examples with 10, 20, 50 orders respectively. The results show that, with the increase of order quantity, the overall picking distance and time are further reduced, the decrease of picking time is risen from 6% to 7.2%.The joint optimization model of picking operation based on nested genetic algorithm and its solution algorithm can effectively solve the joint optimization problem of order batching and picking path, and provide the basis for the optimization of picking system in the distribution center.

Key words: order batching, picking path optimization, joint optimization, nested genetic algorithm, picking operation

中图分类号: