Solving the picker routing problem in multi-block high-level storage systems using metaheuristics
Resumen
This study aims to minimize the travel time in multi-block high-level storage systems considering height level constraints for picking devices to leave aisles. Considering these operating environments, the formulation of minimum travel times between each pair of storage positions is proposed and the picker routing problem (PRP) is solved by means of Genetic Algorithms (GA) and Ant Colony Optimization (ACO). A parameter tuning is performed for both metaheuristics, and the performance of the GA and ACO is compared with the optimal solution for small-sized problems demonstrating the reliability of the algorithms solving the PRP. Then, the performance of the GA and ACO is tested under several warehouse configurations and pick-list sizes obtaining that both metaheuristics provide high-quality solutions within short computing times. It is concluded that the GA outperforms the ACO in both efficiency and computing time, so it is recommended to implement the GA to solve the PRP in joint order picking problems. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Colecciones
- Indexados Scopus [1813]
Ítems relacionados
Mostrando ítems relacionados por Título, Autor o Palabra clave.
-
Reclassification queries in a geographical data warehouse
(Universidad del ZuliaIngeniería de SistemasFacultad de Ingenierías, 2010)A data warehouse is a specialized database designed to support decision-making and is usually modeled using a multidimensional view of data. A multidimensional model includes dimensions that are composed of levels. The ... -
Genetic Algorithms for the Picker Routing Problem in Multi-block Warehouses
This article presents a genetic algorithm (GA) to solve the picker routing problem in multiple-block warehouses in order to minimize the traveled distance. The GA uses survival, crossover, immigration, and mutation operators, ... -
Using genetic algorithms for order batching in multi-parallel-aisle picker-to-parts systems
This article aims to introduce a metaheuristic to solve the order batching problem in multi-parallel-aisle warehouse systems to minimise the travelled distance. The proposed metaheuristic is based on an item-oriented genetic ...