Routing policies in multi-parallel warehouses: An analysis of computing times

Jose A. Cano; Rodrigo A. Gomez; Fernando Salazar

Routing policies in multi-parallel warehouses: An analysis of computing times

Jose A. Cano, Rodrigo A. Gomez, Fernando Salazar

Grupo de Investigación en Cultura y Gestión Organizacional

Resultado de la investigación: Contribución a una revista › Artículo

8 Citas (Scopus)

Resumen

© 2017. 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.

Idioma original	Inglés estadounidense
Publicación	Espacios
Estado	Publicada - 1 ene 2017

Acceder al documento

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85037711557&origin=inward

Huella Profundice en los temas de investigación de 'Routing policies in multi-parallel warehouses: An analysis of computing times'. En conjunto forman una huella única.

Citar esto

Cano, J. A., Gomez, R. A., & Salazar, F. (2017). Routing policies in multi-parallel warehouses: An analysis of computing times. Espacios. https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85037711557&origin=inward

@article{67f9f951cdd04e1a8a7360a9a4634194,

title = "Routing policies in multi-parallel warehouses: An analysis of computing times",

abstract = "{\textcopyright} 2017. 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.",

author = "Cano, {Jose A.} and Gomez, {Rodrigo A.} and Fernando Salazar",

year = "2017",

month = jan,

day = "1",

language = "American English",

journal = "Espacios",

issn = "0798-1015",

publisher = "Revista Espacios",

}

TY - JOUR

T1 - Routing policies in multi-parallel warehouses: An analysis of computing times

AU - Cano, Jose A.

AU - Gomez, Rodrigo A.

AU - Salazar, Fernando

PY - 2017/1/1

Y1 - 2017/1/1

N2 - © 2017. 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.

AB - © 2017. 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.

M3 - Article

JO - Espacios

JF - Espacios

SN - 0798-1015

ER -