Toewysingsheuristieke om die volgorde van bestellings vir 'n uitsoeklyn te bepaal
Date
2012
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
LitNet
Abstract
’n Sisteem vir die opmaak van bestellings word ondersoek. Die sisteem vereis dat die werkers in ’n kloksgewyse rigting om ’n uitsoeklyn beweeg. Die uitsoeklyn bestaan uit vaste vakkies wat elk ’n unieke produk bevat. Die bestellings en die produkte in die vakkies is bekend voordat bestellings opgemaak word. Die volgorde moet bepaal word waarin die bestellings in ’n uitsoeklyn opgemaak moet word sodat die totale afstand afgelê deur die werkers geminimeer word. Die probleem word opgelos met twee klasse van heuristieke. Die eerste klas is gebaseer op ’n veralgemeende toewysingsprobleem. Die tweede klas gebruik voorkeurverhoudings. Al die heuristieke word vergelyk op grond van hulle oplossingskwaliteit vir werklike datastelle. Een van die metodes wat die voorkeurverhoudings in ag neem lewer die beste resultate.
An order picking system is considered that operates by means of a picking line requiring pickers to move in a clockwise direction. The picking line consists of ?xed locations, each containing a unique item of inventory. The orders and locations of the products within the picking line are known in advance. The problem requires a sequence in which orders must be picked such that the distance travelled by the pickers is minimised. The problem is solved by means of heuristics. Two classes of heuristics are presented. The ?rst class is based on a generalised assignment approach and the second class utilises preference ratios. All the heuristics are compared by means of their solution quality for real-life data sets. A variation of the preference ratio approach displays the best results.
An order picking system is considered that operates by means of a picking line requiring pickers to move in a clockwise direction. The picking line consists of ?xed locations, each containing a unique item of inventory. The orders and locations of the products within the picking line are known in advance. The problem requires a sequence in which orders must be picked such that the distance travelled by the pickers is minimised. The problem is solved by means of heuristics. Two classes of heuristics are presented. The ?rst class is based on a generalised assignment approach and the second class utilises preference ratios. All the heuristics are compared by means of their solution quality for real-life data sets. A variation of the preference ratio approach displays the best results.
Description
CITATION: De Villiers, A. P. & Visagie, S. E. 2012. Toewysingsheuristieke om die volgorde van bestellings vir 'n uitsoeklyn te bepaal. LitNet Akademies, 9(1):1-22.
The original publication is available at http://www.litnet.co.za
The original publication is available at http://www.litnet.co.za
Keywords
Heuristic algorithms, Heuristics, Order picking systems, Business logistics
Citation
De Villiers, A. P. & Visagie, S. E. 2012. Toewysingsheuristieke om die volgorde van bestellings vir 'n uitsoeklyn te bepaal. LitNet Akademies, 9(1):1-22.