A Dedicated Storage Location Assignment Algorithm that Optimises Order-picking Time
DOI:
https://doi.org/10.15678/ZNUEK.2015.0940.0410Keywords:
order-picking, warehousing, storage location assignment, optimisation, simulationsAbstract
An essential element of warehouse work which can be optimised is order-picking time. It can be minimised by determining the shortest picker's route and the appropriate storage location assignment of items. In this paper only one-block rectangular warehouses with picker-to-part order picking systems are considered. The warehouse processes are presented. The routing heuristics and the optimal algorithm and storage location assignment methods are described. Against this background the original dedicated storage location assignment algorithms are presented. The efficiency of the methods is verified using simulations. For the calculations the original software Warehouse Real-Time Simulator is used.Downloads
References
Bartholdi III J.J., Hackman S.T. [2011], Warehouse and Distribution Science, Georgia Institute of Technology, Atlanta.
De Koster R., Le Duc T., Roodbergen K.J. [2007], Design and Control of Warehouse Order Picking: A Literature Review, „European Journal of Operational Research", vol. 182(2), http://dx.doi.org/10.1016/j.ejor.2006.07.009.
De Koster R., Van Der Poort E.S. [1998], Routing Order Pickers in a Warehouse: A Comparison between Optimal and Heuristic Solutions, „IIE Transactions", vol. 30, http://dx.doi.org/10.1023/A:1007599307171.
De Koster R., Van Der Poort E.S., Roodbergen K.J. [1998], When to Apply Optimal or Heuristic Routing for Orderpickers [w:] Advances in Distribution Logistics, red. B. Fleischmann, J.A.E.E. van Nunen, M.G. Speranza, P. Stähly, Springer, Berlin, http://dx.doi.org/10.1007/978-3-642-46865-0_16.
Fijałkowski J. [2003], Transport wewnętrzny w systemach logistycznych, Oficyna Wydawnicza Politechniki Warszawskiej, Warszawa.
Heskett J.L. [1963], Cube-per-order Index - a Key to Warehouse Stock Location, „Transport and Distribution Management", nr 3.
Huber Ch. [2011], Throughput Analysis of Manual Order Picking Systems with Congestion Consideration, KIT Scientific Publishing, Karlsruhe.
Kallina C., Lynn J. [1976], Application of the Cube-per-order Index Rule for Stock Location in a Distribution Warehouse, „Interfaces", vol. 7(1), http://dx.doi.org/10.1287/inte.7.1.37.
Le-Duc T. [2005], Design and Control of Efficient Order Picking Processes, Erasmus University Rotterdam, Rotterdam.
Ratliff H.D., Rosenthal A.S. [1983], Order-picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem, „Operations Research", vol. 31(3), http://dx.doi.org/10.1287/opre.31.3.507.
Roodbergen K.J. [2001], Layout and Routing Methods for Warehouses, Erasmus University Rotterdam, Rotterdam.
Roodbergen K.J., De Koster R. [2001], Routing Order Pickers in a Warehouse with a Middle Aisle, „European Journal of Operational Research", vol. 133(1), http://dx.doi.org/10.1016/S0377-2217(00)00177-6.
Sabo A. [2013], Analiza problemu kompletacji zamówień w magazynie wysokiego składowania [w:] Decyzje optymalne w wybranych obszarach praktyki gospodarczej, red. T. Trzaskalik, Wydawnictwo Uniwersytetu Ekonomicznego w Katowicach, Katowice.
Tarczyński G. [2013], Warehouse Real-Time Simulator - How to Optimize Order Picking Time, Working Paper, SSRN: http://ssrn.com/abstract=2354827, http://dx.doi.org/10.2139/ssrn.2354827.
Wäscher G. [2004], Order Picking: A Survey of Planning Problems and Methods [w:] Supply Chain Management and Reverse Logistics, eds. M. Dyckhoff, R. Lackes, J. Reese, Springer, Berlin-New York, http://dx.doi.org/10.1007/978-3-540-24815-6_15.
