Abstract
Order picking process is one of the most time-consuming activities at a 3PL’s warehouse system. This paper aims to determine picking process and routing method in finding the optimal order picking by using Single Picker Routing Problem in a multidimensional warehouse. Single Picker Routing Problem (SPRP) is method development of general Traveling Salesman Problem (TSP). SPRP is used to determine the minimum route in picking process to several points including depot areas and choosing a concerned location. In this paper, we develop a model to minimize travel time considering “x-axis”, “y-axis” and “z-axis” (height of racking system) using Genetic Algorithm (GA). Genetic Algorithm as the chosen method is carried out to calculate process quickly because the number of variables in the case study used in. The result of the model is the picking sequence not only considering 2D layout, but also the height of the racking system. By applying the model to the case study, the improvement of picking time is 60%.
Please note that the LNCS Editorial assumes that all authors have used the western naming convention, with given names preceding surnames. This determines the structure of the names in the running heads and the author index.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Manzini, R.: Warehousing in the Global Supply Chain. Springer, Bologna, London, Dordrecht, Heidelberg (2012)
Frazelle, E.H.: World-Class Warehousing and Material Handling. McGraw-Hill, Singapore (2002)
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7, 326–329 (1960)
Gavish, B., Graves, S.C.: The traveling salesman problem and related problems (1978)
Henn, S., Scholz, A., Stuhlmann, M., Wascher, G.: A New Mathematical Programming Formulation for the Single-Picker Routing problem in a Single- Block Layout, Working Paper No. 5/2015, Bezug über den Herausgeber (2015). ISSN 1615–4274
Claus, A.: A new formulation for the traveling salesman problem. SIAM J. Algebraic Discrete Methods 5, 21–25 (1984)
Bottani, E., et al.: Optimisation of storage allocation in order picking operations through a genetic algorithm (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Damayanti, D.D., Setyawan, E.B., Andrawina, L., Santosa, B. (2018). Warehouse Picking Model for Single Picker Routing Problem in Multi Dimensional Warehouse Layout Using Genetic Algorithm Approach to Minimize Delay. In: Ghazali, R., Deris, M., Nawi, N., Abawajy, J. (eds) Recent Advances on Soft Computing and Data Mining. SCDM 2018. Advances in Intelligent Systems and Computing, vol 700. Springer, Cham. https://doi.org/10.1007/978-3-319-72550-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-72550-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72549-9
Online ISBN: 978-3-319-72550-5
eBook Packages: EngineeringEngineering (R0)