DocumentCode
2844364
Title
Application of Optimized Dijkstra Algorithm in Storage/Retrieval Routes Scheduling of a Stacker Crane
Author
Su Wengui ; Li, Li ; Zhou Xiaorong ; Liao Xiaoping
Author_Institution
Sch. of Mech. Eng., Guangxi Univ., Nanning, China
fYear
2009
fDate
19-20 Dec. 2009
Firstpage
1
Lastpage
4
Abstract
According to the characteristics of picking working in automated warehouse, a storage/retrieval scheduling optimization problem of a stacker crane is studied. The mathematic model of the order picking optimization is given based on two operation modes of a stacker crane, i.e. single access mode and combined access mode, and realized by means of the optimized Dijkstra algorithm, which makes it more intellectually to search path approaching to the target node and reduces traversing nodes. Experimental results show that this strategy can reduce the working distances of the stacker crane and promotes the efficiency of the automated warehouse.
Keywords
cranes; optimisation; order picking; scheduling; stacking; warehouse automation; automated warehouse; mathematic model; optimized Dijkstra algorithm; order picking optimization; retrieval routes scheduling; scheduling optimization; stacker crane; storage routes scheduling; Computational modeling; Cranes; Labeling; Mathematical model; Mathematics; Mechanical engineering; Processor scheduling; Scheduling algorithm; Storage automation; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4994-1
Type
conf
DOI
10.1109/ICIECS.2009.5364990
Filename
5364990
Link To Document