Picking Routing Problem with K homogenous material handling equipment for a refrigerated warehouse
DOI:
https://doi.org/10.17533/udea.redin.n80a02Keywords:
picking, PSO (Particle Swarm Optimization) discrete, genetic algorithm, refrigerated warehouseAbstract
This paper aims at formulating a Picking Routing Problem with K homogenousmaterial handling equipment for a refrigerated warehouse (PRPHE). Discrete particleswarm optimization (PSO) and genetic algorithm (GA) metaheuristics are developed andvalidated for solving PRPHE. The discrete PSO is a novel approach to solving cold routingpicking problems, which has not been detected in the scientific literature and is considered acontribution to the state of the art. The main difference between classical and discrete PSOis the structure and algebraic formulation of the positions and velocities of the particles,which are discrete rather than continuous under our approach. A full factorial design wasdeveloped with the following four factors: picking routing metaheuristic (PRM), depot, pickinglist size (PLS) and homogeneous material handling equipment (MHE). Based on the resultsof the experimental analysis, we identified that GA metaheuristics generated better solutionsthan discrete PSO for PRPHE. These statistical results demonstrated that GA metaheuristicsproduced time savings of between 22.89 and 86.75 seconds per set of cold picking routes,as well as an increase in the operational efficiency of between 1.98 and 2.81%, as comparedwith PSO discrete. Finally, it should be noted that this paper is one of the first in tacklingpicking routing in a refrigerated warehouse, thereby contributing to knowledge in this field.
Downloads
References
D. Battini, M. Calzavara, A. Persona and F. Sgarbossa,“A comparative analysis of different paperless pickingsystems”, Industrial Management & Data Systems, vol.115, no. 3, pp. 483-503, 2015.
D. Battini, M. Calzavara, A. Persona and F. Sgarbossa,“Order picking system design: the storage assignmentand travel distance estimation (SA&TDE) joint method”,International Journal of Production Research, vol. 53, no.4, pp. 1077-1093, 2015.
S. Henn, “Algorithms for on-line order batching in anorder picking warehouse”, Computers & OperationsResearch, vol. 39, no. 11, pp. 2549-2563, 2012.
C. Ban et al., “Design of an Inventory ManagementSystem for Refrigerated Warehouses on MobileEnvironments”, in Future Information CommunicationTechnology and Applications, 1st ed., H. Jung, J. Kim, T.Sahama and C. Yang (eds). Amsterdam, Netherlands:Springer, 2013, pp. 773-782.
B. Menéndez, E. Pardo, A. Duarte, A. Ayuso and E.Molina, “General Variable Neighborhood Searchapplied to the picking process in a warehouse”,Electronic Notes in Discrete Mathematics, vol. 47, pp.77-84, 2015.
O. Kulak, Y. Sahin and M. Taner, “Joint order batchingand picker routing in single and multiple-cross-aisle warehouses using cluster-based Tabu searchalgorithms”, Flexible Services and ManufacturingJournal, vol. 24, no. 1, pp. 52-80, 2012.
W. Lu, D. McFarlane, V. Giannikas and Q. Zhang, “Analgorithm for dynamic order-picking in warehouseoperations”, European Journal of Operational Research,vol. 248, no. 1, pp. 107-122, 2016.
J. Pan, P. Shih and M. Wu, “Order batching in a pick-and-pass warehousing system with group geneticalgorithm”, Omega, vol. 57, pp. 238-248, 2015.
A. Bonassa and C. Cunha, “The order-picking routingproblem for low-level order picker in a warehouse”,Gestão & Produção, vol. 18, no. 1, pp. 105-118, 2011.
F. Chen, H. Wang, Y. Xie and C. Qi, “An ACO-basedonline routing method for multiple order pickers withcongestion consideration in warehouse”, Journal ofIntelligent Manufacturing, vol. 27, no. 2, pp. 389-408,2014.
S. Henn and G. Wäscher, “Tabu search heuristics forthe order batching problem in manual order pickingsystems”, European Journal of Operational Research,vol. 222, no. 3, pp. 484-494, 2012.
L. Liu, X. Gao and Q. Song, “Research of VRP Model withSemi-soft Time Window Constraints”, Open Cybernetics& Systemics Journal, vol. 9, pp. 1083-1087, 2015.
B. Yang et al., “Routing with time-windows for multipleenvironmental vehicle types”, Computers & IndustrialEngineering, vol. 89, pp. 150-161, 2015.
M. Lin, K. Chin, K. Tsui and T. Wong, “Genetic baseddiscrete particle swarm optimization for Elderly DayCare Center timetabling”, Computers & OperationsResearch, vol. 65, pp. 125-138, 2016.
J. Kennedy and R. Eberhart, “A discrete binary versionof the particle swarm algorithm”, in InternationalConference on Systems, Man, and Cybernetics,Computational Cybernetics and Simulation, Orlando,USA, 1997, pp. 4104-4108.
V. Kachitvichyanukul, P. Sombuntham and S.Kunnapapdeelert, “Two solution representationsfor solving multi-depot vehicle routing problem withmultiple pickup and delivery requests via PSO”,Computers & Industrial Engineering, vol. 89, pp. 125-136, 2015.
S. Talukder, “Mathematical modelling and applicationsof particle swarm optimization”, M.S. thesis, BlekingeInstitute of Technology, Karlskrona, Sweden, 2011.
T. Vidal, T. Crainic, M. Gendreau and C. Prins, “A hybridgenetic algorithm with adaptive diversity managementfor a large class of vehicle routing problems with time-windows”, Computers & Operations Research, vol. 40,no. 1, pp. 475-489, 2013.
A. Mohtashami, “A novel dynamic genetic algorithm-based method for vehicle scheduling in cross dockingsystems with frequent unloading operation”, Computers& Industrial Engineering, vol. 90, pp. 221-240, 2015.
J. Pan, P. Shih, M. Wu and J. Lin, “A storage assignmentheuristic method based on genetic algorithm for a pick-and-pass warehousing system”, Computers & IndustrialEngineering, vol. 81, pp. 1-13, 2015.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Revista Facultad de Ingeniería Universidad de Antioquia
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Revista Facultad de Ingeniería, Universidad de Antioquia is licensed under the Creative Commons Attribution BY-NC-SA 4.0 license. https://creativecommons.org/licenses/by-nc-sa/4.0/deed.en
You are free to:
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial — You may not use the material for commercial purposes.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
The material published in the journal can be distributed, copied and exhibited by third parties if the respective credits are given to the journal. No commercial benefit can be obtained and derivative works must be under the same license terms as the original work.
Twitter