Solving the picker routing problem in multi-block high-level storage systems using metaheuristics

Thumbnail
Share this
Date
2023
Author
Cano J.A
Cortés P
Muñuzuri J
Correa-Espinal A.
Gestores bibliográficos
Metadata
Show full item record
Abstract
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.
URI
http://hdl.handle.net/11407/8557
Collections