主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2025, Vol. 33 ›› Issue (3): 239-255.doi: 10.16381/j.cnki.issn1003-207x.2022.1049cstr: 32146.14/j.cnki.issn1003-207x.2022.1049

• • 上一篇    下一篇

考虑配送截止时间的“货到人”订单拣选优化问题研究

赵金龙1,2, 蒋忠中1,2,3(), 万明重1,2, 张春征1,2   

  1. 1.东北大学工商管理学院,辽宁 沈阳 110167
    2.东北大学辽宁省服务型制造研究院,辽宁 沈阳 110167
    3.教育部工业智能与系统优化前沿科学中心(东北大学),辽宁 沈阳 110189
  • 收稿日期:2022-05-11 修回日期:2022-09-18 出版日期:2025-03-25 发布日期:2025-04-07
  • 通讯作者: 蒋忠中 E-mail:zzjiang@mail.neu.edu.cn
  • 基金资助:
    国家社会科学基金重大项目(23&ZD050)

Order Picking Optimization in "Parts-to-Picker" Systems Considering Delivery Due Dates

Jinlong Zhao1,2, Zhongzhong Jiang1,2,3(), Mingzhong Wan1,2, Chunzheng Zhang1,2   

  1. 1.School of Business Administration,Northeastern University,Shenyang 110167,China
    2.Liaoning Province Service-Oriented Manufacturing Research Institute,Northeastern University,Shenyang 110167,China
    3.Industrial Intelligence and System Optimization Frontier Science Center (Northeastern University),Ministry of Education,Shenyang 110189,China
  • Received:2022-05-11 Revised:2022-09-18 Online:2025-03-25 Published:2025-04-07
  • Contact: Zhongzhong Jiang E-mail:zzjiang@mail.neu.edu.cn

摘要:

电商企业每日产生数量庞大的订单,如何高效地实现订单拣选及配送成为电商企业面临的重要挑战。一方面,订单数量大、商品种类多等特点使传统“人到货”拣选模式效率大幅降低;另一方面, 诸如当日达、次日达等考虑配送截止时间的配送策略对电商企业提出了更高的时效性要求。为此,本文以最小化订单总延迟时间为目标,构建考虑配送截止时间的“货到人”订单拣选优化整数规划模型。针对该模型的特点,首先,提出改进的知识引导果蝇优化算法确定订单分配和排序决策;然后,设计最短等待时间订单拣选规则,优化货架访问顺序;最后,通过数值实验验证了模型的可行性和算法的有效性。实验结果表明,在确保快速求解的前提下,相较于现实中常用的先到先服务策略,改进的知识引导果蝇优化算法及最短等待时间订单拣选规则能显著提高解的质量。本文提出的模型和算法可为电商企业提高运营效率、降低物流成本提供科学的决策依据。

关键词: “货到人”订单拣选, 配送截止时间, 知识引导, 果蝇优化算法, 启发式算法

Abstract:

With the rapid advancement and widespread adoption of E-commerce, online shopping has become an integral component of modern life. However, the unique characteristics of online orders pose significant challenges to warehouse operational efficiency. A primary concern is the heightened consumer demand for timely deliveries, particularly with the increasing prevalence of next-day and same-day delivery services, which substantially amplify delivery complexities. Additionally, the sheer volume of daily orders, each typically comprising multiple stock-keeping units (SKUs), coupled with the overlap of SKUs across different orders, further complicates the process. Moreover, real-time orders often originate from diverse geographic regions, introducing additional logistical challenges. These factors collectively exert considerable pressure on the order picking and delivery systems of E-commerce enterprises. According to Statista, during 2020–2021, over 4.5% of Amazon orders experienced delays. In traditional picker-to-parts systems, pickers spend approximately 60% of their time traveling within the warehouse. To enhance efficiency and reduce operational costs, E-commerce platforms have increasingly adopted automated order picking systems, such as parts-to-picker systems or robotic mobile fulfillment systems (RMFS), exemplified by Amazon’s Kiva system and JD.com’s Ground wolf system. Motivated by these operational challenges, this study focuses on optimizing decision-making processes in intelligent warehouses with delivery deadlines to minimize total order tardiness.

Key operational challenges include order assignment, order sequencing, and rack visit sequencing. (i) Order assignment: In warehouses with multiple parallel picking stations, balancing workloads and optimizing efficiency across stations is critical due to variations in order sizes, SKU compositions, and delivery due dates. (ii) Order sequencing: Orders arrive with varying due dates, necessitating prioritization of urgent orders to reduce the likelihood of tardiness. (iii) Rack visit sequencing: Adjacent orders at a picking station may share common SKUs, enabling simultaneous retrieval. However, since each rack carries only one type of SKU, determining the optimal sequence for retrieving SKUs—equivalent to sequencing rack visits—becomes a pivotal issue.

To address these challenges, this study formulates a mixed-integer programming model aimed at minimizing total order tardiness in parts-to-picker systems with delivery due dates. Leveraging the model’s characteristics, an improved knowledge-guided fruit fly optimization algorithm (IKGFOA) is proposed to determine optimal order allocation and sequencing schedules. The algorithm incorporates heuristic rules to accelerate solution convergence and introduces a knowledge-guided search mechanism to balance local and global search capabilities, thereby enhancing the rationality of order assignment and sequencing decisions. Additionally, a shortest waiting time (SWT) rule is designed to optimize order picking and rack visit sequences at each picking station.

The feasibility of the proposed model and the effectiveness of the algorithm are validated through numerical experiments. Small-scale experiments demonstrate that the IKGFOA-SWT algorithm achieves solutions comparable to those obtained by CPLEX under certain conditions. Large-scale experiments further confirm the algorithm’s superiority over the commonly used first-come-first-served (FCFS) strategy in real-world applications. The model and algorithms developed in this study provide E-commerce enterprises with scientifically robust decision-making tools, emphasizing the importance of incorporating delivery due dates into operational optimization strategies to minimize order tardiness in intelligent warehouses.

Key words: “parts-to-picker” order picking, delivery due dates, knowledge-guided, fruit fly optimization algorithm, heuristic algorithm

中图分类号: