• CN:11-2187/TH
  • ISSN:0577-6686

机械工程学报 ›› 2019, Vol. 55 ›› Issue (18): 225-232.doi: 10.3901/JME.2019.18.225

• 交叉与前沿 • 上一篇    

“四向车”拣选系统订单排序优化

田彬, 吴颖颖, 吴耀华, 曹伟洁   

  1. 山东大学控制科学与工程学院 济南 250061
  • 收稿日期:2018-12-05 修回日期:2019-04-11 发布日期:2020-01-07
  • 通讯作者: 吴颖颖(通信作者),女,1985年出生,博士,讲师。主要研究方向为自动拣选系统调度优化、物流系统规划、设计和仿真等。E-mail:sophia.wu@sdu.edu.cn
  • 作者简介:田彬,男,1995年出生。主要研究方向为自动化拣选系统,物流系统调度与优化。E-mail:christian_bin@mail.sdu.edu.cn;吴耀华,男,1963年出生,博士,教授,博士研究生导师。主要研究方向为自动分拣系统、集成化物流系统规划、设计,仿真和物流技术装备等。E-mail:yaohua.wu@sdu.edu.cn;曹伟洁,女,1993年出生。主要研究方向为自动拣选系统,多层穿梭车系统调度与优化。E-mail:caoweijie1022@163.com
  • 基金资助:
    国家自然科学基金资助项目(61703241)。

Order Sequencing Optimization for “Four-Way” Shuttle Based Order Picking System

TIAN Bin, WU Yingying, WU Yaohua, CAO Weijie   

  1. School of Control Science and Engineering, Shandong University, Jinan 250061
  • Received:2018-12-05 Revised:2019-04-11 Published:2020-01-07

摘要: "四向车"拣选系统采用"四向车-提升机-辊道"的作业模式,可有效提高订单拣选效率,缩短订单拣选时间,近年来得到了广泛应用。目前,优化订单拣选时间成为提高"四向车"拣选系统效率的关键因素及难点问题。为缩短订单拣选时间,提高"四向车"拣选系统效率,提出一种批量订单排序的优化模型,模型的优化目标可简化为缩短"四向车"在储位之间的往返时间。由订单排序模型的特点可知,在订单总量大于50时,该模型可确定为NP-Hard问题,难以在有限时间内求得最优解。为在有限时间内求得可接受范围内的解,提出改进耦合度订单排序贪婪算法,根据订单储位耦合度大小对批量订单进行排序并确定各订单中SKU拣选顺序,从而最小化批量订单拣选时间。试验结果表明,相比传统算法,该算法可以有效缩短订单拣选时间,提高拣选系统效率。

关键词: “四向车”拣选系统, 货到人, 订单排序, 耦合度, 拣选时间

Abstract: The "Four-Way" shuttle based order picking system has been widely used in recent years, which adopts the "Four-Way shuttle-Hoister-Roller" operation model and can effectively enhance order picking efficiency and shorten order picking time. At present, the optimization of order picking time has become a key factor and difficult problem to improve the efficiency of the four-way shuttle based order picking system. To shorten order picking time and enhance the efficiency of "Four-Way" shuttle picking system, an optimization model is proposed for batch order sequencing whose target is simplified to decrease the travel time of four-way shuttles between storage positions. Considering the characteristic of order sequencing problems when the order quantity is larger than 50, this model can be seen as NP-hard problem, which is hard to obtain the optimal solution within limited time. To attain a solution under an acceptable range within limited time a modified coupling degree greedy algorithm is developed to solve this problem, which is mainly based on order storage position coupling degree for determining the sequence of orders and SKUs so as to minimize the order picking time. The test results show that compared with traditional algorithms this algorithm can effectively cut down order picking time and increase the picking system's efficiency.

Key words: “four-way” shuttle system, part-to-picker, order sequencing, coupling degree, order picking time

中图分类号: