Genetic Algorithms for the Picker Routing Problem in Multi-block Warehouses
Cargando...
Compartir
Fecha
Título de la revista
ISSN de la revista
Título del volumen
Editor
Springer Verlag
Resumen
Descripción
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, and is complemented by a local search heuristic. The genetic algorithm provides average distance savings of 13.9% when compared with s-shape strategy, and distance savings of 23.3% when compared with the GA with the aisle-by-aisle policy. We concluded that the GA performs better as the number of blocks increases, and as the percentage of picking locations to visit decreases. © 2019, Springer Nature Switzerland AG.
Palabras clave
Artificial intelligence, Genetic algorithm, Multi-block warehouse, Order picking, Picker routing, Warehouse management