.png){kind=icon}
返回
Items assignment optimization for complex automated picking Systems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-017-1529-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Order picking operation is the most expensive and time consuming process of all assignments in distribution center. The high efficient and low consumption automated systems, especially complex automated picking systems have been widely promoted and used. How to improve the efficiency and accuracy of the automated picking system becomes an important issue for improving the business capability of the distribution centers. By analyzing the operating mode of complex automated picking systems, the model of complex automated sorting systems is established and the operation time model is constructed based on the serial order picking strategy with the sequence from right to left. The items assignment optimization models for different types of picking machines are constructed, minimizing total picking time. The improved niche genetic algorithm is designed. In order to improve algorithm convergence speed, the k-means clustering method is used and the results are regarded as the initial population of clustering algorithm. By restricting the number of chromosomes whose location distribution of a certain item is fixed, the niche elimination operation process is improved and the diversity of population is maintained. Through the simulation analysis, the items assignment optimization algorithm leads to 7.5% decrease of the total order picking time, in comparison with the results determined by the traditional EIQ-ABC method. On the basis of items assignment optimization simulation experiments, items configuration and sort comparison tests in a multi-items picking area are designed, again validating the effectiveness.
Keyword:
Complex automated picking systems
Items assignment
Order picking strategy
Niched genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.1
论文数:
5.1K
被引数:
7.5K
机构
引用论文
A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time最小化平均流程时间的流水车间排序问题的改进遗传算法
.png){kind=icon}
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容