SINGLE FIXED CRANE OPTIMISATION WITHIN A DISTRIBUTION CENTRE

J. Matthews, S.E. Visagie
2011 South African Journal of Industrial Engineering  
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
more » ... 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. * Corresponding author http://sajie.journals.ac.za J , the time is 10:15, and the list of pending jobs is Let the crane finish job 0 J at 10:18. The next job ( 1 J ) is then given to the crane, and the list of pending jobs changes to 2 J -3 J . At 10:20 job 4 J enters the system, and because of its deadline it is placed at the top of the list, resulting in a pending job list of 4 J -2 J -3 J . Once job 1 J is completed, job 4 J is sent to the crane. The crane is still busy with job 4 J when jobs 5 J and 6 J enter the system at 10:30. The pending job list is now Re-optimisation then takes place while job 4 J is performed, resulting in a pending job list of 3 J -5 J -2 J -6 J at 11:32 when job 4 J is completed.
doi:10.7166/22-2-19 fatcat:n346hpau5zg6znqh7dchzu7lim