Routing policies in multi-parallel warehouses: An analysis of computing times
In this paper, we study the computation time of routing policies for the picker routing problem in order to determine the feasibility of the simultaneous use of these policies in picking problems. For this, programming details of routing policies are shown, and simulations considering different ware...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2017
- Institución:
- Universidad de Medellín
- Repositorio:
- Repositorio UDEM
- Idioma:
- eng
- OAI Identifier:
- oai:repository.udem.edu.co:11407/4550
- Acceso en línea:
- http://hdl.handle.net/11407/4550
- Palabra clave:
- Computing time; Picker routing; Routing policies; Warehouse management
- Rights
- License
- http://purl.org/coar/access_right/c_16ec
| Summary: | In this paper, we study the computation time of routing policies for the picker routing problem in order to determine the feasibility of the simultaneous use of these policies in picking problems. For this, programming details of routing policies are shown, and simulations considering different warehouse sizes and pick list sizes are performed. Taking into account different population sizes and numbers of iterations, the computation time of routing policies in population-based metaheuristics for the order batching problem is estimated. © 2017. |
|---|