Optimal model of multi-person and multi-location picking path based on time window constraint and application of improved genetic algorithm

被引：0
|
作者：
Hu X. [1 ,2 ]
Zhou Q. [1 ,2 ]
Song X. [3 ]
Kan T. [3 ]
机构：
[1] School of Management, Hefei University of Technology, Hefei
[2] Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Hefei
[3] Anhui Winners Industrial Automation Co., Ltd., Hefei
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2022年 / 28卷 / 11期
关键词：
improved genitic algorithm; multi-person selection; multiple stock locations; order picking; path conflict; path optimization; time window constraints;
D O I：
10.13196/j.cims.2022.11.003
中图分类号：
学科分类号：
摘要：
Taking Anhui BY's parts library as the research object, Aiming at the current research status of single-person and single-storage picking path planning，the actual existing multi-person simultaneous picking and Multi-Location Problem ( MLP) was considered，and the multiple storage and multi-person picking path optimization model was established. The number of picking people was first determined. For the multi-person picking path optimization model，an Improved Genetic Algorithm for Time Window Constraints (TWC-IGA) was proposed to solve the model. The path was optimized by IGA and the picking route collection was obtained. Then the time window constraints and two-stage strategy was used for route conflict prediction，obstacle avoidance and dynamic local adjustment. Through the simulation experiments，the proposed model was compared with genetic algorithms and greedy algorithms. The result showed that the stability and convergence speed of the proposed model were better, and the picking efficiency was greatly improved，which was effective for actual picking. © 2022 CIMS. All rights reserved.
引用
收藏
页码：3354 / 3364
页数：10
相关论文
共 15 条
  • [1] DE KOSTER R, LE-DUC T, ROODBERGEN K J., Design and control of warehouse order picking: A literature review[J], European Journal of Operational Research, 182, 2, pp. 481-501, (2006)
  • [2] LI Zhibin, HOU Shiwang, CHENG Houhu, Method for initial population of TSP, Computer Engineering and Applications, 52, 17, pp. 172-176, (2016)
  • [3] GE Huahui, FENG Yixiong, MI Shanghua, Et al., Intelligent manufacturing digital workshop layout optimization with automated guided vehicle consideration, Computer Integrated Manufacturing Systems, 25, 7, pp. 1655-1664, (2019)
  • [4] ZHOU H L, SONG M L, PEDRYCZ W., A comparative study of improved GA and PSO in solving multiple traveling salesmen problem[J], Applied Soft Computing, 64, pp. 564-580, (2018)
  • [5] SHETTY N, SAH B, CHUNG S H., Route optimization for warehouse order picking operations via vehicle routing and simulation[J], SN Applied Sciences, 2, (2020)
  • [6] FENG Man, ZHANG Xiaoqing, KONG Jili, Combined strategy based on clustering and dynamic programming for picking routing in warehouse, Operations Research and Management Science, 28, 8, pp. 86-92, (2019)
  • [7] LIU Jiansheng, OUYANG Changfeng, XU Haining, Hybrid optimization method of order picking route for multi-vehicle schedulingin fishbone layout, Journal of Huazhong University of Science and Technology:Natural Science, 48, 4, pp. 67-72, (2020)
  • [8] LI Dongdong, Research on the optimization of picking route in dual-zone warehouse, (2015)
  • [9] HUANG TM, Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time[J], International Journal of Production Research, 46, 22, pp. 6533-6555, (2007)
  • [10] ZHANG Yu, Optimization of location allocation and multi-person job picking path in warehouse management system [D], (2019)
12