Application of Optimized Dijkstra Algorithm in Storage/Retrieval Routes Scheduling of a Stacker Crane

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.

Automated order picking systems and the links between design and performance: a systematic literature review

“…Studied performance aspects Parts-to-picker systems with automated storage and retrieval systems (AS/RSs) Throughput Throughput (Mahajan, Rao, and Peters 1998;Park, Foley, and Frazelle 2006;Manzini, Gamberi, and Regattieri 2006;Andriansyah et al 2011 Weighted tardiness (Kusiak, Hawaleshka, and Cormier 1985), operator and machine utilisation (Medeiros, Enscore, and Smith 1986;Bozer and White 1996), machine travel time (Hwang, Baek, and Lee 1988;Chiang et al 1994;Su 1995;Su et al 2009 (Medeiros, Enscore, and Smith 1986).…”

“…Order batching affects machine travel time (Hwang, Baek, and Lee 1988), as do order picking sequencing and routing (Su et al 2009) and storage policy (Ramtin and Pazour 2014). Storage and retrieval policies affect operator and machine utilisation (Bozer and White 1996).…”

“…Su (1995) reduces AS/RS machine travel time by optimising OP sequencing and routing. In a later study, Su et al (2009) study the effect of machine routing on the distance travelled by the machine. Ramtin and Pazour (2014) compare different storage policies in an AS/RS and investigate their effect on machine travel time.…”