DocumentCode
2037870
Title
Research on the schedule algorithm of the order picking optimization problem in bend aisle warehouse
Author
Zhang, Yu ; Zhang, Yangsen
Author_Institution
Comput. Sch., Beijing Inf. Sci. & Technol. Univ., Beijing, China
Volume
1
fYear
2010
fDate
10-12 Aug. 2010
Firstpage
299
Lastpage
303
Abstract
With the technical requirements for automated stereoscopic warehouse increasingly, the application of bend aisle stereoscopic warehouse is more and more extensive. Through taking the stereoscopic automated warehouse in Qinhuangdao as a research object, This paper describes the order picking path optimization and scheduling algorithm for bend aisle, solves the problem of a stacker´s order picking in two-tunnel.
Keywords
optimisation; order picking; scheduling; warehouse automation; Qinhuangdao; automated stereoscopic warehouse; bend aisle warehouse; order picking path optimization; scheduling algorithm; Algorithm design and analysis; Computers; Educational institutions; Hardware; Optimization; Schedules; Scheduling algorithm; Automated stereoscopic warehouse; bend aisle; order picking; schedule algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference on
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-5931-5
Type
conf
DOI
10.1109/FSKD.2010.5569665
Filename
5569665
Link To Document