arrow
Return

Items assignment optimization for complex automated picking Systems

delete2017-12-26
delete1
PRE
AI
刘德宝 cover
刘德宝 (Debao Liu)
X
Xiaofeng Zhao *
Y
Yanyan Wang
DOI:10.1007/s10586-017-1529-5delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Complex automated picking systems
Items assignment
Order picking strategy
Niched genetic algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
Papers:
5.1K
Citations:
7.5K

Organization

S
shandong university
Scholars:
9.5W
Papers: 6.4W
Citations: 94
Cited Papers

Cited Papers

Design of soft-X-ray tomographic system in WEST using GEM detectors
err2015-10-01
err0
errOAAI
errDidier Mazon; Maryna Chernyshova; Guillaume Jiolat; Tomasz Czarski; Philippe Malard; Ewa Kowalska-Strzeciwilk; Slawomir Jablonski; Waldemar Figacz; Roman Zagorski; Monika Kubkowska; Grzegorz Kasprowicz; Krzysztof Pozniak; Wojciech Zabolotny; Sébastien Larroque; Jean-Marc Verger; Martin O’Mullane; Jan Mlynar; Adrian Byszuk; Andrzej Wojenski
errShare
errSave
Optimizing a dynamic order-picking process
err2012-06-01
err48
PREAI
errBukchin, Yossi; Khmelnitsky, Eugene; Yakuel, Pini
errShare
errSave
Landscape of multilocus inherited neoplasia alleles syndrome in China.
err2019-05-20
err0
PREAI
errQuchang Ouyang; Jie Gao; Jun Huang; Pingping Dai; Mingming Zhang; Chen Chen; Yan-Fang Guan; Ling Yang; Xin Yi; Xuefeng Xia
errShare
errSave
errShare
errSave
no more