Resumen
This article aims to introduce mathematical programming models for the joint order batching and picker routing problem (JOBPRP) and the joint order batching, sequencing and routing problem (JOBSPRP). For this purpose, we present formulations for the traveled distance and travel time between picking positions in low-level and high-level picker-to-part systems (2D and 3D warehouses) and single-block and multiple-block warehouses. Likewise, we formulate Steiner traveling salesman problem (STSP) models considering multiple pickers, heterogeneous picking vehicles, multiple objectives and due windows. We calculate the number of binary variables, continuous variables and constraints for the proposed models, in order to show the complexity of solving these order picking problems using exact solution methods. As a result, we introduce several mathematical models for manual order picking systems, which could serve as references for researchers interested in finding optimal or high-quality solutions to joint order picking problems, considering realistic warehouse and distribution center environments.
| Idioma original | Inglés |
|---|---|
| Publicación | Journal of King Saud University - Engineering Sciences |
| DOI | |
| Estado | Publicada - 1 ene 2019 |
Huella dactilar
Citar esto
}
Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems. / Cano, Jose Alejandro; Correa-Espinal, Alexander A.; Gómez-Montoya, Rodrigo Andrés.
En: Journal of King Saud University - Engineering Sciences, 01.01.2019.Resultado de la investigación: Contribución a una revista › Artículo › Investigación › revisión exhaustiva
TY - JOUR
T1 - Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
AU - Cano, Jose Alejandro
AU - Correa-Espinal, Alexander A.
AU - Gómez-Montoya, Rodrigo Andrés
PY - 2019/1/1
Y1 - 2019/1/1
N2 - This article aims to introduce mathematical programming models for the joint order batching and picker routing problem (JOBPRP) and the joint order batching, sequencing and routing problem (JOBSPRP). For this purpose, we present formulations for the traveled distance and travel time between picking positions in low-level and high-level picker-to-part systems (2D and 3D warehouses) and single-block and multiple-block warehouses. Likewise, we formulate Steiner traveling salesman problem (STSP) models considering multiple pickers, heterogeneous picking vehicles, multiple objectives and due windows. We calculate the number of binary variables, continuous variables and constraints for the proposed models, in order to show the complexity of solving these order picking problems using exact solution methods. As a result, we introduce several mathematical models for manual order picking systems, which could serve as references for researchers interested in finding optimal or high-quality solutions to joint order picking problems, considering realistic warehouse and distribution center environments.
AB - This article aims to introduce mathematical programming models for the joint order batching and picker routing problem (JOBPRP) and the joint order batching, sequencing and routing problem (JOBSPRP). For this purpose, we present formulations for the traveled distance and travel time between picking positions in low-level and high-level picker-to-part systems (2D and 3D warehouses) and single-block and multiple-block warehouses. Likewise, we formulate Steiner traveling salesman problem (STSP) models considering multiple pickers, heterogeneous picking vehicles, multiple objectives and due windows. We calculate the number of binary variables, continuous variables and constraints for the proposed models, in order to show the complexity of solving these order picking problems using exact solution methods. As a result, we introduce several mathematical models for manual order picking systems, which could serve as references for researchers interested in finding optimal or high-quality solutions to joint order picking problems, considering realistic warehouse and distribution center environments.
KW - Mathematical programming modeling
KW - Order batching
KW - Order picking
KW - Picker routing
KW - Sequencing
UR - http://www.scopus.com/inward/record.url?scp=85061970038&partnerID=8YFLogxK
U2 - 10.1016/j.jksues.2019.02.004
DO - 10.1016/j.jksues.2019.02.004
M3 - Artículo
JO - Journal of King Saud University - Engineering Sciences
JF - Journal of King Saud University - Engineering Sciences
SN - 1018-3639
ER -