期刊文献+

多层穿梭车系统输送机缓存长度建模与优化 被引量:1

Conveyor’s Buffer Length Modeling and Optimization of Multi-Shuttle System
原文传递
导出
摘要 目前,多层穿梭车系统存在由于输送机缓存长度不合适,而导致出库阻塞或拣选空闲等问题,进而影响系统的整体效率。为提高系统作业效率,减少输送设备成本,在对多层穿梭车系统出库作业流程进行深入分析的基础上,建立输送机缓存输入输出平衡模型;在输送机缓存满足分拣作业正常运行的情况下,提出该缓存长度的最优条件及临界条件。运用开环排队网络建模方法对料箱出库作业流程进行分析,建立料箱平均出库时间模型,并根据料箱出库作业流量分布与人工拣选效率的关系,构建输送机缓存长度的优化模型;为缩短料箱平均出库时间,利用k-means聚类算法和储区排列规则对储位优化,进一步降低输送机缓存长度。仿真结果显示,优化后的品项分配与随机分配相比,补货缓存长度更趋合理,长度减少约12%。该研究一方面可指导规划设计人员对输送机缓存长度进行设计,另一方面可提高系统的整体作业效率,降低运营成本。 At present, the multi-shuttle system has problems such as the unsuitable conveyor's buffer length, which leads to problems such as outbound block or picking idle, affecting the overall efficiency of the system. To improve the operation efficiency of the multi-shuttle system and reduce the input cost of the conveying equipment, based on in-depth analysis of the multi-shuttle system outbound operation process, the conveyor buffer input and output balance model is established;In the case of normal operation of the picking operation, the optimal conditions and critical conditions of the buffer length are proposed. The open queuing network modeling method is used to analyze the outbound operation process of the case, and the average outbound-time model of the case is established. According to the relationship between the flow distribution of the case outbound operation and the manual picking efficiency, the optimization of the buffer length model of the conveyor is established;In order to shorten the average outbound time of the case, the k-means clustering algorithm and the storage arrangement rule are used to optimize the storage position, further reducing the conveyor buffer length. The simulation results show that the optimized item allocation is more reasonable than the random allocation, and the replenishment buffer length is reduced by about 12%. On the one hand, this study can guide the designer to design the conveyor buffer length, on the other hand, it can improve the overall operating efficiency of the system and reduce the operating cost.
作者 秦艺萍 王艳艳 吴耀华 胡金昌 QIN Yiping;WANG Yanyan;WU Yaohua;HU Jinchang(College of Control Science and Engineering, Shandong University, Jinan 250061)
出处 《机械工程学报》 EI CAS CSCD 北大核心 2019年第14期206-214,共9页 Journal of Mechanical Engineering
基金 山东大学基本科研业务费专项资金(2018JC035) 山东省重点研发计划(2017GGX60103) 山东省自然科学基金(ZR2017MF014)资助项目
关键词 多层穿梭车系统 输送机缓存长度 开环排队网络 K-MEANS算法 储位优化 multi-shuttle system conveyor buffer length open queuing networks k-means algorithm storage assignment optimization
  • 相关文献

参考文献4

二级参考文献17

  • 1张贻弓,吴耀华.双拣货区自动分拣系统品项分配优化[J].机械工程学报,2009,45(11):152-157. 被引量:16
  • 2YingWANG ChenZHOU.FLUID-BASED SIMULATION APPROACH FOR HIGH VOLUME CONVEYOR TRANSPORTATION SYSTEMS[J].Systems Science and Systems Engineering,2004,13(3):297-317. 被引量:2
  • 3王雄志,王国庆.配送中心定向补货作业问题[J].系统工程,2006,24(1):48-52. 被引量:8
  • 4王雄志,周丽虹.配送中心补货作业问题的蚂蚁算法[J].暨南大学学报(自然科学与医学版),2007,28(3):263-267. 被引量:3
  • 5JASON M, STEPHAN V. Order sequencing on a unidirectional cyclical picking line[J]. European Journal of Operational Research, 2013, 231(1): 79-87.
  • 6SEBASTIAN H. Algorithms for on-line order batehing in an order picking warehouse[J]. Computers & Operations Research, 2012, 39(11): 2549-2563.
  • 7SEBASTIAN H, VERENA S. Metaheuristics for order batching and sequencing in manual order picking systems[J]. Computers & Operations Research, 2013,66(2). 338-351.
  • 8SEBASTIAN H, GERHARD W. Tabu search heuristics for the order batching problem in manual order picking systems[J]. European Journal of Operational Research, 2012, 222(3): 484-494.
  • 9MENGFEI , RENE B M, de KOSTER. The impact of order batching and picking area zoning on order picking system performance[J]. European Journal of Operational Research, 2009, 198(2): 480-490.
  • 10JASON C H P, MING-HUNG W. A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system[J]. Computers & Industrial Engineering, 2009, 57(1): 261-268.

共引文献46

同被引文献18

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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