Single fixed crane optimisation within a distribution centre

 

 

J. Matthews^I; S.E. Visagie^II

^IDepartment of Logistics, University of Stellenbosch, South Africa, 14855054@sun.ac.za
^IIDepartment of Logistics, University of Stellenbosch, South Africa, svisagie@sun.ac.za

 

 

---

ABSTRACT

This paper considersthe optimisation of the movement of a fixed crane operating in a single aisle of a distribution centre. The crane must move pallets in inventory between docking bays, storage locations, and picking lines. Both a static and a dynamic approach to the problem are presented. The optimisation is performed by means of tabu search, ant colony metaheuristics,and hybrids of these two methods. All these solution approaches were tested on real life data obtained from an operational distribution centre. Results indicate that the hybrid methods outperform the other approaches.

---

OPSOMMING

Die optimisering van die beweging van 'n vaste hyskraan in 'n enkele gang van 'n distribusiesentrum word in hierdie artikel beskou. Die hyskraan moet pallette vervoer tussen dokhokke, stoorposisies, en opmaaklyne. Beide 'n statiese en 'n dinamiese benadering tot die probleem word aangebied. Die optimisering word gedoen met behulp van tabu-soektogte, mierkolonieoptimisering,en hibriede van hierdie twee metodes. Al die oplossingsbenaderings is getoets met werklike data wat van 'n operasionele distribusiesentrum verkry is. Die resultate toon aan dat die hibriedmetodes die beste oplossings lewer.

---

 

 

“Full text available only in PDF format”

 

 

REFERENCES

[1] Alcaide, D., Rodriguez-Gonzalez, A. & Sicilia, J. 2003. An approach to solve a hierarchicalstochastic sequential ordering problem, Omega, 31(3), 169-187.         [ Links ]

[2] Ascheuer, N., Fischetti, M. & Grdtschel, M. 2001. Solving the asymmetrical travelling salesman problem with time windows by branch-and-cut, Mathematical Programming, 90(3), 475-506.         [ Links ]

[3] Cheng, C. & Mao, C. 2007. A modified ant colony system for solving the travelling sales-man problem with time windows, Mathematical and Computer Modelling, 46(9-10), 1225-1235.         [ Links ]

[4] Cordeau, J. & Laporte, G. 2003. A tabu search heuristic for the static multi-vehicle dial a ride problem, Transportation Research Part B, 37(6), 579-594.         [ Links ]

[5] Domingo, E. 2009. Manager at PEP distribution centre, Kuilsriver, South Africa [personal communication],         [ Links ] contactable at <krvmgr@pepstores.com>.

[6] Gambradella, L. & Dorigo, M. 2000. An ant system hybridized with a new local search for the sequential ordering problem, INFORMS Journal on Computing, 12(3), 237-255.         [ Links ]

[7] Ichoua, S., Gendreau, M. & Potvin, J. 2007.Planned route optimization for real-time vehicle routing. In Dynamic fleet management, concepts, systems, algorithms and case studies, chapter 1, 1-18. Springer, New York.         [ Links ]

[8] Józefowska, J., Waligóra, G. & Weglarz, J. 2002. Tabu list management methods for a discrete-continuous scheduling problem, European Journal of Operational Research, 137,288-302.         [ Links ]

[9] Landrieu, A., Mati, Y. & Binder, Z. 2001. A tabu search heuristic for the single vehicle pickup and delivery problem with time windows, Journal of Intelligent Manufacturing, 12(5-6), 497-508.         [ Links ]

[10] Lindo Systems. Lingo 11 [online,         [ Links ] cited May 1st, 2009],http://www.lindo.com/.

[11] Mafoli, F. & Sciomachen, A. 1997. A mixed-integer model for solving ordering problems with side constraints, Annals of Operations Research, 69(0), 277-297.         [ Links ]

[12] Microsoft Windows XP [online,         [ Links ] cited May 1st, 2009], available from http://www.microsoft.com/.

[13] Moon, C., Kim, J., Choi, C. & Seo, Y. 2002. An efficient genetic algorithm for the travelling salesman problem with precedence constraints, European Journal of Operational Research, 140(3), 606-617.         [ Links ]

[14] Mulcahy, D.E. 1994. Warehouse distribution and operations handbook. McGrawHill, U.S.A.         [ Links ]

[15] Nanry, W. & Barnes, J. 2000. Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B, 34(2), 107-121.         [ Links ]

[16] Nikolakopoulos, A. & Sarimveis, H. 2007. A threshold accepting heuristic with intense local search for the solution of special instances of the travelling salesman problem, European Journal of Operations Research, 177(3), 1911-1929.         [ Links ]

[17] Reinelt, G. 1995. Tsplib [online,         [ Links ] cited May 1st, 2009], available from: http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.

[18] Stecco, G., Cordeau, J.F. & Moretti, E. 2009. A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, Journal of Scheduling,112(1), 3-16.         [ Links ]

[19] Sun Microsystems. JAVA [online,         [ Links ] cited May 1st, 2009], available from http://java.sun.com/.

[20] Valls, V., Perez, M. & Quintanilla, M. 1998. A tabu search approach to machine scheduling, European Journal of Operational Research, 106(2-3), 277-300.         [ Links ]

 

 

* Corresponding author