Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems

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

Full description

Autores:

Tipo de recurso:

Fecha de publicación:: 2020

Institución:: Universidad de Medellín

Repositorio:: Repositorio UDEM

Idioma:: eng

id	REPOUDEM2_bff157b7c7f6f313b3cf3736f379c3a4
oai_identifier_str	oai:repository.udem.edu.co:11407/5979
network_acronym_str	REPOUDEM2
network_name_str	Repositorio UDEM
repository_id_str
dc.title.none.fl_str_mv	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
title	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
spellingShingle	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems Mathematical programming modeling Order batching Order picking Picker routing Sequencing Materials handling Mathematical programming Travel time Traveling salesman problem Mathematical programming models Order batching Order picking Picker routing Sequencing Warehouses
title_short	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
title_full	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
title_fullStr	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
title_full_unstemmed	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
title_sort	Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
dc.subject.spa.fl_str_mv	Mathematical programming modeling Order batching Order picking Picker routing Sequencing
topic	Mathematical programming modeling Order batching Order picking Picker routing Sequencing Materials handling Mathematical programming Travel time Traveling salesman problem Mathematical programming models Order batching Order picking Picker routing Sequencing Warehouses
dc.subject.keyword.eng.fl_str_mv	Materials handling Mathematical programming Travel time Traveling salesman problem Mathematical programming models Order batching Order picking Picker routing Sequencing Warehouses
description	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. © 2019 The Authors
publishDate	2020
dc.date.accessioned.none.fl_str_mv	2021-02-05T14:58:22Z
dc.date.available.none.fl_str_mv	2021-02-05T14:58:22Z
dc.date.none.fl_str_mv	2020
dc.type.eng.fl_str_mv	Article
dc.type.coarversion.fl_str_mv	http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.coar.fl_str_mv	http://purl.org/coar/resource_type/c_6501 http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.none.fl_str_mv	info:eu-repo/semantics/article
dc.identifier.issn.none.fl_str_mv	10183639
dc.identifier.uri.none.fl_str_mv	http://hdl.handle.net/11407/5979
dc.identifier.doi.none.fl_str_mv	10.1016/j.jksues.2019.02.004
identifier_str_mv	10183639 10.1016/j.jksues.2019.02.004
url	http://hdl.handle.net/11407/5979
dc.language.iso.none.fl_str_mv	eng
language	eng
dc.relation.isversionof.none.fl_str_mv	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061970038&doi=10.1016%2fj.jksues.2019.02.004&partnerID=40&md5=150c25394a0da7932196bb404586192f
dc.relation.citationvolume.none.fl_str_mv	32
dc.relation.citationissue.none.fl_str_mv	3
dc.relation.citationstartpage.none.fl_str_mv	219
dc.relation.citationendpage.none.fl_str_mv	228
dc.relation.references.none.fl_str_mv	Azadnia, A.H., Taheri, S., Ghadimi, P., Mat Saman, M.Z., Wong, K.Y., Order batching in warehouses by minimizing total tardiness: A hybrid approach of weighted association rule mining and genetic algorithms (2013) Sci. World J., 2013, pp. 1-13 Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., A review of research trends in order batching, sequencing and picker routing problems (2018) Espacios, 39, p. 3 Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., An evaluation of picking routing policies to improve warehouse efficiency (2017) Int. J. Ind. Eng. Manag., 8, pp. 229-238 Cano, J.A., Gomez, R.A., Salazar, F., Routing policies in multi-parallel warehouses: an analysis of computing times (2017) Espacios, 38, p. 23 Cergibozan, Ç., Tasan, A.S., Order batching operations: an overview of classification, solution techniques, and future research (2016) J. Intell. Manuf., pp. 1-15 Chen, T.L., Cheng, C.Y., Chen, Y.Y., Chan, L.K., An efficient hybrid algorithm for integrated order batching, sequencing and routing problem (2015) Int. J. Prod. Econ., 159, pp. 158-167 Cheng, C.-Y., Chen, Y.-Y., Chen, T.-L., Yoo, J.J.-W., Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem (2015) Int. J. Prod. Econ., 170, pp. 1-10 De Koster, R., Le-Duc, T., Roodbergen, K.J., Design and control of warehouse order picking: A literature review (2007) Eur. J. Oper. Res., 182, pp. 481-501 Gademann, N., van de Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse (2005) IIE Trans., 37, pp. 63-75 Gómez, R.A., Correa, A., Muñuzuri, J., Cortes, P., Análisis comparativo del problema de conformación de lotes con ruteo en la preparación de pedidos respecto al HVRP (Heterogeneous Vehicle Routing Problem) (2016) Dir. y Organ., 59, pp. 49-60 Henn, S., Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses (2015) Flex. Serv. Manuf. J., 27, pp. 86-114 Henn, S., Schmid, V., Metaheuristics for order batching and sequencing in manual order picking systems (2013) Comput. Ind. Eng., 66, pp. 338-351 Koch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) J. Bus. Econ., 86, pp. 131-153 Kulak, O., Sahin, Y., Taner, M.E., Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms (2012) Flex. Serv. Manuf. J., 24, pp. 52-80 Li, J., Huang, R., Dai, J.B., Joint optimisation of order batching and picker routing in the online retailer's warehouse in China (2017) Int. J. Prod. Res., 55, pp. 447-461 Lin, C.-C., Kang, J.-R., Hou, C.-C., Cheng, C.-Y., Joint order batching and picker Manhattan routing problem (2016) Comput. Ind. Eng., 95, pp. 164-174 Lu, W., McFarlane, D., Giannikas, V., Zhang, Q., An algorithm for dynamic order-picking in warehouse operations (2016) Eur. J. Oper. Res., 248, pp. 107-122 Matusiak, M., De Koster, R., Kroon, L., Saarinen, J., A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (2014) Eur. J. Oper. Res., 236, pp. 968-977 Matusiak, M., de Koster, R., Saarinen, J., Utilizing individual picker skills to improve order batching in a warehouse (2017) Eur. J. Oper. Res., 263, pp. 888-899 Muter, I., Öncan, T., An exact solution approach for the order batching problem (2015) IIE Trans., 47, pp. 728-738 Öncan, T., MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (2015) Eur. J. Oper. Res., 243, pp. 142-155 Öncan, T., Caǧirici, M., MILP formulations for the order batching problem in low-level picker-to-part warehouse systems (2013) IFAC Proc., 46, pp. 471-476 Pan, J.C.-H., Wu, M.-H., Chang, W.-L., A travel time estimation model for a high-level picker-to-part system with class-based storage policies (2014) Eur. J. Oper. Res., 237, pp. 1054-1066 Scholz, A., Henn, S., Stuhlmann, M., Wäscher, G., A new mathematical programming formulation for the single-picker routing problem (2016) Eur. J. Oper. Res., 253, pp. 68-84 Scholz, A., Schubert, D., Wäscher, G., Order picking with multiple pickers and due dates –Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (2017) Eur. J. Oper. Res., 263, pp. 461-478 Scholz, A., Wäscher, G., Order batching and picker routing in manual order picking systems: the benefits of integrated routing (2017) Cent. Eur. J. Oper. Res., 25, pp. 491-520 Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., Facilities Planning (2010), fourth ed. Wiley New Jersey Tsai, C.-Y., Liou, J.J.H., Huang, T.-M., Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time (2008) Int. J. Prod. Res., 46, pp. 6533-6555 Valle, C.A., Beasley, J.E., da Cunha, A.S., Optimally solving the joint order batching and picker routing problem (2017) Eur. J. Oper. Res., 262, pp. 817-834 Won, J., Olafsson, S., Joint order batching and order picking in warehouse operations (2005) Int. J. Prod. Res., 43, pp. 1427-1442 Zhang, J., Wang, X., Huang, K., Integrated on-line scheduling of order batching and delivery under B2C e-commerce (2016) Comput. Ind. Eng., 94, pp. 280-289 Zhang, J., Wang, X., Chan, F.T.S., Ruan, J., On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm (2017) Appl. Math. Model., 45, pp. 271-284
dc.rights.coar.fl_str_mv	http://purl.org/coar/access_right/c_16ec
rights_invalid_str_mv	http://purl.org/coar/access_right/c_16ec
dc.publisher.none.fl_str_mv	King Saud University
dc.publisher.program.spa.fl_str_mv	Administración de Empresas
dc.publisher.faculty.spa.fl_str_mv	Facultad de Ciencias Económicas y Administrativas
publisher.none.fl_str_mv	King Saud University
dc.source.none.fl_str_mv	Journal of King Saud University - Engineering Sciences
institution	Universidad de Medellín
repository.name.fl_str_mv	Repositorio Institucional Universidad de Medellin
repository.mail.fl_str_mv	repositorio@udem.edu.co
_version_	1808481181256122368
spelling	20202021-02-05T14:58:22Z2021-02-05T14:58:22Z10183639http://hdl.handle.net/11407/597910.1016/j.jksues.2019.02.004This 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. © 2019 The AuthorsengKing Saud UniversityAdministración de EmpresasFacultad de Ciencias Económicas y Administrativashttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85061970038&doi=10.1016%2fj.jksues.2019.02.004&partnerID=40&md5=150c25394a0da7932196bb404586192f323219228Azadnia, A.H., Taheri, S., Ghadimi, P., Mat Saman, M.Z., Wong, K.Y., Order batching in warehouses by minimizing total tardiness: A hybrid approach of weighted association rule mining and genetic algorithms (2013) Sci. World J., 2013, pp. 1-13Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., A review of research trends in order batching, sequencing and picker routing problems (2018) Espacios, 39, p. 3Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., An evaluation of picking routing policies to improve warehouse efficiency (2017) Int. J. Ind. Eng. Manag., 8, pp. 229-238Cano, J.A., Gomez, R.A., Salazar, F., Routing policies in multi-parallel warehouses: an analysis of computing times (2017) Espacios, 38, p. 23Cergibozan, Ç., Tasan, A.S., Order batching operations: an overview of classification, solution techniques, and future research (2016) J. Intell. Manuf., pp. 1-15Chen, T.L., Cheng, C.Y., Chen, Y.Y., Chan, L.K., An efficient hybrid algorithm for integrated order batching, sequencing and routing problem (2015) Int. J. Prod. Econ., 159, pp. 158-167Cheng, C.-Y., Chen, Y.-Y., Chen, T.-L., Yoo, J.J.-W., Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem (2015) Int. J. Prod. Econ., 170, pp. 1-10De Koster, R., Le-Duc, T., Roodbergen, K.J., Design and control of warehouse order picking: A literature review (2007) Eur. J. Oper. Res., 182, pp. 481-501Gademann, N., van de Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse (2005) IIE Trans., 37, pp. 63-75Gómez, R.A., Correa, A., Muñuzuri, J., Cortes, P., Análisis comparativo del problema de conformación de lotes con ruteo en la preparación de pedidos respecto al HVRP (Heterogeneous Vehicle Routing Problem) (2016) Dir. y Organ., 59, pp. 49-60Henn, S., Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses (2015) Flex. Serv. Manuf. J., 27, pp. 86-114Henn, S., Schmid, V., Metaheuristics for order batching and sequencing in manual order picking systems (2013) Comput. Ind. Eng., 66, pp. 338-351Koch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) J. Bus. Econ., 86, pp. 131-153Kulak, O., Sahin, Y., Taner, M.E., Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms (2012) Flex. Serv. Manuf. J., 24, pp. 52-80Li, J., Huang, R., Dai, J.B., Joint optimisation of order batching and picker routing in the online retailer's warehouse in China (2017) Int. J. Prod. Res., 55, pp. 447-461Lin, C.-C., Kang, J.-R., Hou, C.-C., Cheng, C.-Y., Joint order batching and picker Manhattan routing problem (2016) Comput. Ind. Eng., 95, pp. 164-174Lu, W., McFarlane, D., Giannikas, V., Zhang, Q., An algorithm for dynamic order-picking in warehouse operations (2016) Eur. J. Oper. Res., 248, pp. 107-122Matusiak, M., De Koster, R., Kroon, L., Saarinen, J., A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (2014) Eur. J. Oper. Res., 236, pp. 968-977Matusiak, M., de Koster, R., Saarinen, J., Utilizing individual picker skills to improve order batching in a warehouse (2017) Eur. J. Oper. Res., 263, pp. 888-899Muter, I., Öncan, T., An exact solution approach for the order batching problem (2015) IIE Trans., 47, pp. 728-738Öncan, T., MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (2015) Eur. J. Oper. Res., 243, pp. 142-155Öncan, T., Caǧirici, M., MILP formulations for the order batching problem in low-level picker-to-part warehouse systems (2013) IFAC Proc., 46, pp. 471-476Pan, J.C.-H., Wu, M.-H., Chang, W.-L., A travel time estimation model for a high-level picker-to-part system with class-based storage policies (2014) Eur. J. Oper. Res., 237, pp. 1054-1066Scholz, A., Henn, S., Stuhlmann, M., Wäscher, G., A new mathematical programming formulation for the single-picker routing problem (2016) Eur. J. Oper. Res., 253, pp. 68-84Scholz, A., Schubert, D., Wäscher, G., Order picking with multiple pickers and due dates –Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (2017) Eur. J. Oper. Res., 263, pp. 461-478Scholz, A., Wäscher, G., Order batching and picker routing in manual order picking systems: the benefits of integrated routing (2017) Cent. Eur. J. Oper. Res., 25, pp. 491-520Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., Facilities Planning (2010), fourth ed. Wiley New JerseyTsai, C.-Y., Liou, J.J.H., Huang, T.-M., Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time (2008) Int. J. Prod. Res., 46, pp. 6533-6555Valle, C.A., Beasley, J.E., da Cunha, A.S., Optimally solving the joint order batching and picker routing problem (2017) Eur. J. Oper. Res., 262, pp. 817-834Won, J., Olafsson, S., Joint order batching and order picking in warehouse operations (2005) Int. J. Prod. Res., 43, pp. 1427-1442Zhang, J., Wang, X., Huang, K., Integrated on-line scheduling of order batching and delivery under B2C e-commerce (2016) Comput. Ind. Eng., 94, pp. 280-289Zhang, J., Wang, X., Chan, F.T.S., Ruan, J., On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm (2017) Appl. Math. Model., 45, pp. 271-284Journal of King Saud University - Engineering SciencesMathematical programming modelingOrder batchingOrder pickingPicker routingSequencingMaterials handlingMathematical programmingTravel timeTraveling salesman problemMathematical programming modelsOrder batchingOrder pickingPicker routingSequencingWarehousesMathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systemsArticleinfo:eu-repo/semantics/articlehttp://purl.org/coar/version/c_970fb48d4fbd8a85http://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1Cano, J.A., Universidad de Medellín, Carrera 87 # 30-65, Medellín, ColombiaCorrea-Espinal, A.A., Universidad Nacional de Colombia, Carrera 80 # 65-223, Medellín, ColombiaGómez-Montoya, R.A., ESACS – Escuela Superior en Administración de Cadena de Suministro, Calle 4 # 18-55, Medellín, Colombiahttp://purl.org/coar/access_right/c_16ecCano J.A.Correa-Espinal A.A.Gómez-Montoya R.A.11407/5979oai:repository.udem.edu.co:11407/59792021-02-05 09:58:22.348Repositorio Institucional Universidad de Medellinrepositorio@udem.edu.co

Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems

Publicaciones similares