Advertisement

Warehouse Picking Model for Single Picker Routing Problem in Multi Dimensional Warehouse Layout Using Genetic Algorithm Approach to Minimize Delay

  • Dida Diah Damayanti
  • Erlangga Bayu Setyawan
  • Luciana Andrawina
  • Budi Santosa
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 700)

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%.

Keywords

Picking and routing method Traveling salesman problem (TSP) Single picker routing problem (SPRP) 

References

  1. 1.
    Manzini, R.: Warehousing in the Global Supply Chain. Springer, Bologna, London, Dordrecht, Heidelberg (2012)Google Scholar
  2. 2.
    Frazelle, E.H.: World-Class Warehousing and Material Handling. McGraw-Hill, Singapore (2002)Google Scholar
  3. 3.
    Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7, 326–329 (1960)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Gavish, B., Graves, S.C.: The traveling salesman problem and related problems (1978)Google Scholar
  5. 5.
    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–4274Google Scholar
  6. 6.
    Claus, A.: A new formulation for the traveling salesman problem. SIAM J. Algebraic Discrete Methods 5, 21–25 (1984)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Bottani, E., et al.: Optimisation of storage allocation in order picking operations through a genetic algorithm (2012)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Dida Diah Damayanti
    • 1
  • Erlangga Bayu Setyawan
    • 1
  • Luciana Andrawina
    • 1
  • Budi Santosa
    • 1
  1. 1.Faculty of Industrial and System EngineeringTelkom UniversityBandungIndonesia

Personalised recommendations