Research on a Dynamic Task Update Assignment Strategy Based on a “Parts to Picker” Picking System

Author:

Liang Kaibo1ORCID,Zhou Li2,Yang Jianglong2ORCID,Liu Huwei12ORCID,Li Yakun2ORCID,Jing Fengmei2ORCID,Shan Man2ORCID,Yang Jin2

Affiliation:

1. School of Management and Engineering, Capital University of Economics and Business, Beijing 100070, China

2. School of Information, Beijing Wuzi University, Beijing 101149, China

Abstract

Order picking is a crucial operation in the storage industry, with a significant impact on storage efficiency and cost. Responding quickly to customer demands and shortening picking time is crucial given the random nature of order arrival times and quantities. This paper presents a study on the order-picking process in a distribution center, employing a “parts-to-picker” system, based on dynamic order batching and task optimization. Firstly, dynamic arriving orders with uncertain information are transformed into static picking orders with known information. A new method of the hybrid time window is proposed by combining fixed and variable time windows, and an order consolidation batch strategy is established with the aim of minimizing the number of target shelves for picking. A heuristic algorithm is designed to select a shelf selection model, taking into account the constraint condition that the goods on the shelf can meet the demand of the selection list. Subsequently, task division of multi-AGV is carried out on the shelf to be picked, and the matching between the target shelf and the AGVs, as well as the order of the AGVs to complete the task of picking, is determined. A scheduling strategy model is constructed to consider the task completion time as the incorporation of moving time, queuing time, and picking time, with the shortest task completion time as the objective function and AGV task selection as the decision variable. The improved ant colony algorithm is employed to solve the problem. The average response time of the order batching algorithm based on a hybrid time window is 4.87 s, showing an improvement of 22.20% and 40.2% compared to fixed and variable time windows, respectively. The convergence efficiency of the improved ant colony algorithm in AGV task allocation is improved four-fold, with a better convergence effect. By pre-selecting the nearest picking station for the AGVs, the multi-AGV picking system can increase the queuing time. Therefore, optimizing the static picking station selection and dynamically selecting the picking station queue based on the queuing situation are proposed. The Flexsim simulation results show that the queue-waiting and picking completion times are reduced to 34% of the original, thus improving the flexibility of the queuing process and enhancing picking efficiency.

Funder

the key project of Beijing Social Science Foundation “Strategic research on improving the service quality of capital logistics based on big data technology”

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference64 articles.

1. Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review;Ramaekers;Eur. J. Oper. Res.,2018

2. A simulation-based comparison of two goods-to-person order picking systems in an online retail setting;Bozer;Int. J. Prod. Res.,2018

3. Hybrid order picking: A simulation model of a joint manual and autonomous order picking system;Winkelhaus;Comput. Ind. Eng.,2022

4. Ellinger, M., Geißen, T., and Spee, D. (2012, January 1). How to Choose an Order-Picking System. Proceedings of the 12th IMHRC, Gardanne, France.

5. Optimal selection of movable shelves under cargo-to-person picking mode;Li;Int. J. Simul. Model.,2017

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3