Metaheuristic approaches to order sequencing on a unidirectional pickling line

De Villiers, A. P. ; Matthews, J. ; Visagie, S. E. (2013)

CITATION: De Villiers, A. P., Matthews, J. & Visagie, S. E. 2013. Metaheuristic approaches to order sequencing on a unidirectional pickling line. ORiON, 29(1):55–73, doi:10.5784/29-1-152.

The original publication is available at http://orion.journals.ac.za

Article

In this paper the sequencing of orders on a unidirectional picking line is considered. The aim of the order sequencing is to minimise the number of cycles travelled by a picker within the picking line to complete all orders. A tabu search, simulated annealing, genetic algorithm, generalised extremal optimisation and a random local search are presented as possible solution approaches. Computational results based on real life data instances are presented for these metaheuristics and compared to the performance of a lower bound and the solutions used in practise. The random local search exhibits the best overall solution quality, however, the generalised extremal optimisation approach delivers comparable results in considerably shorter computational times.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/94059
This item appears in the following collections: