期刊文献+

基于多旋转货架协同作业的拣选路径优化方法

Picking path optimization method based on multi-carousel collaborative operation
下载PDF
导出
摘要 为提升多旋转货架的拣选作业效率,保证军械货品的分类正确率,采取一种并行调度作业方式对货架转运路径进行优化,并提出了一种协同组合优化算法。首先,建立了包含分批货品数量、转运时间间隔等约束的多旋转货架协同拣选模型;其次,通过拣选时间序列化转换提高算法收敛性,引入多模块协同组合策略提升算法执行效率。仿真结果表明:与两种典型启发式算法相比,该算法能快速、有效求解协同拣选次序,使得作业时间最小。研究结果可为多模块特征下的仓储系统拣选路径规划提供参考。 In order to improve the picking efficiency of multi carousel and ensure the accuracy of goods classification,aparallel scheduling operation method was adopted to optimize the shelf transfer path,and a collaborative combinatorial optimization algorithm was proposed.Firstly,a carousel collabora-tive picking model with batch quantity and transshipment time interval constraints was established.Secondly,the convergence of the algorithm was improved by sorting time serialization transformation,and the multi module cooperative combination strategy was introduced to improve the execution effi-ciency of the algorithm.The simulation results show that compared with the two typical heuristic ones,the algorithm can solve the collaborative picking path quickly and effectively,and minimize the cost of operation time.The research results can provide reference for picking path planning of ware-housing system under multi module characteristics.
作者 芮万智 段军雨 贾正荣 RUI Wanzhi;DUAN Junyu;JIA Zhengrong(National Key Laboratory of Science and Technology on Vessel Integrated Power System,Naval Univ.of Engineering,Wuhan 430033,China)
出处 《海军工程大学学报》 CAS 北大核心 2023年第3期15-21,共7页 Journal of Naval University of Engineering
基金 国家自然科学基金资助项目(51977218)。
关键词 多旋转货架 MCS-OOPP模型 协同拣选 时间序列化 最优路径 multi-carousel MCS-OOPP model collaborative picking time serialization optimal path
  • 相关文献

参考文献4

二级参考文献26

  • 1冯艳君,李梅娟,王罡.基于蚁群优化算法的旋转货架拣选路径规划[J].渤海大学学报(自然科学版),2007,28(1):81-86. 被引量:3
  • 2Van den Berg J P. Multiple order pick sequencing in a carousel system: A solvable case of the rural post- man problem[J]. Journal of the Operational Research Society. 1996, 47 (12): 1504-1515.
  • 3Litvak N, Adan I. The travel time in carousel systems under the nearest item heuristic[J]. Journal of Ap- plied Probability, 2001, 38 (1): 45-54.
  • 4Litvak N, Adan I J B F, Wessels J. Order picking in carousel systems under the nearest item heuristic[J]. Probability in the Engineering and Informational Sci- ences, 2001, 15 (2): 135-164.
  • 5Litvak N, Zwet W R V. On the minimal travel time needed to collect n items on a circle[J]. The Annals of Applied Probability, 2004, 14 (2) :881-902.
  • 6Hassini E, Vickson R G. A two-carousel storage lo- cation problem[J]. Computers and Operations Re- search, 2003, 30 (4): 527-539.
  • 7Park B C, Park J Y, Foley R D. Carousel system performance [J]. Journal of Applied Probability, 2003, 40 (3): 602-612.
  • 8Colorni A, Dorigo M, Maniezzo V. An investigation of some properties of an ant algorithm [A]. Proc of the Parallel Problem Solving from Nature Conference (PPSN'92) [C]// Belgium: Elsevier Publishing, 1992.
  • 9Wang G. Optimal order picking in a double carousel storage system[R], working paper, 2007.
  • 10Han M H, McGinnis W J A. Analysis of rotary rack operation[J]. Material Flow, 1988, 4 (1): 283-293.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部