Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and distribution centers where the order-batching problem applies for order picking systems. For this, a new representation of solutions is proposed, in which each gene of a chromosome represents a custo...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2018
- Institución:
- Universidad de Medellín
- Repositorio:
- Repositorio UDEM
- Idioma:
- spa
- OAI Identifier:
- oai:repository.udem.edu.co:11407/6163
- Acceso en línea:
- http://hdl.handle.net/11407/6163
- Palabra clave:
- Rights
- License
- http://purl.org/coar/access_right/c_16ec
| Summary: | This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and distribution centers where the order-batching problem applies for order picking systems. For this, a new representation of solutions is proposed, in which each gene of a chromosome represents a customer order to be retrieved, easing the application of crossover and mutation operators. Through computational experiments, it is shown that the genetic algorithm generates significant savings in distance traveled and number of batches compared to a basic rule of order batch formation, especially in scenarios where a greater number of batches is required. We conclude that the genetic algorithm provides efficient solutions in a reasonable computational time, thus its implementation is highly recommended in operative environments of warehouses and distribution centers. © Centro de Informacion Tecnologica. All rights reserved. |
|---|