Tackling the storage problem through genetic algorithms

Abstract

The capability of a company to implement an automated warehouse in an optimized way might be nowadays a crucial leverage in order to gain competitive advantage to satisfy the demand. The order picking is a warehouse function that needs to deal with the retrieval of articles from their storage locations. Merging several single customer orders into one, a picking order can increase efficiency of warehouse operations. The aim of this paper is to define throughout the use of ad-hoc genetic algorithm (GA) how better a warehouse can be set up. The paper deals with order batching, which has a major effect on efficiency of warehouse operations to avoid wastes of resources in terms of processes and to control possibility of unexpected costs in advance.

Keywords

Genetic algorithms (GA) / Warehouse management / Order batching / Optimization

References

[1] Koch S, Wäscher G (2005) A grouping genetic algorithm for the order batching problem in distribution warehouses. In: Working Paper No. 26/2011. Otto-von-Guericke-Universität Magdeburg

[2] Zhang GQ, Lai KK. Tabu search approach for multi-level warehouse layout problem with adjacent constraints. Eng Optim, 2010, 42(6): 775-790.

[3] Ratliff HD, Rosenthal AS. Orderpicking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper Res, 1983, 31: 507-521.

[4] Yang L, Feng Y. Fuzzy multi-level warehouse layout problem: new model and algorithm. J Syst Sci Syst Eng, 2006, 15(4): 493-503.

[5] Henn S, Koch S, Wascher G (2012) Order batching in order picking warehouses: a survey of solution approaches. In: Manzini R (ed) Warehousing in the global supply chain. Springer, London, p 105

[6] Gademann N, Van De Velde S. Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans, 2005, 37(1): 63-75.

[7] Kratica J, Kovacevic-Vujcic V, Cangalovic M. Computing the metric dimension of graph by genetic algorithms. Comput Optim Appl, 2009, 44(2): 343-361.

[8] Ho YC, Su TS, Shi ZB. Order-batching methods for an order-picking warehouse with two cross aisles. Comput Ind Eng, 2008, 55(2): 321-347.

[9] Zhang GQ, Xue J, Lai KK. A class of genetic algorithms for multiple-level warehouse layout problems. Int J Prod Res, 2002, 40(3): 731-744.

[10] Weicker K, Weicker N (2007) Towards qualitative models of interactions in evolutionary algorithms. In: De Jong KA, Poli R, Rowe JE (eds) Foundations of genetic algorithms VII. Morgan Kaufmann, San Francisco, pp 365, 382

[11] Äut ÄS, Tuzkaya UR, Doga B. A particle swarm optimization algorithm for the multiple-level warehouse layout design problem. Comput Ind Eng, 2008, 54(4): 783-799.

[12] Pan CH, Liu SY. A comparative study of order batching algorithms. Omega Int J Manag Sci, 1995, 23(6): 691-700.

[13] Matic D, Filipovic V, Savic A, et al. A genetic algorithm for solving multiple warehouse layout problem. Kragujev J Math, 2011, 35(1): 119-138.

[14] Tsai CY, Liou JJH, Huang TM. Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. Int J Prod Res, 2007, 46(22): 6533-6555.

[15] Kratica J, Kovacevic-Vujcic V, Cangalovic M. Computing strong metric dimension of some special classes of graphs by genetic algorithms. Yugosl J Oper Res, 2008, 18(4): 143-151.