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

Full description

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
id REPOUDEM2_c4f9a971524005c9f12b5b0acaf1290c
oai_identifier_str oai:repository.udem.edu.co:11407/4550
network_acronym_str REPOUDEM2
network_name_str Repositorio UDEM
repository_id_str
dc.title.spa.fl_str_mv Routing policies in multi-parallel warehouses: An analysis of computing times
title Routing policies in multi-parallel warehouses: An analysis of computing times
spellingShingle Routing policies in multi-parallel warehouses: An analysis of computing times
Computing time; Picker routing; Routing policies; Warehouse management
title_short Routing policies in multi-parallel warehouses: An analysis of computing times
title_full Routing policies in multi-parallel warehouses: An analysis of computing times
title_fullStr Routing policies in multi-parallel warehouses: An analysis of computing times
title_full_unstemmed Routing policies in multi-parallel warehouses: An analysis of computing times
title_sort Routing policies in multi-parallel warehouses: An analysis of computing times
dc.contributor.affiliation.spa.fl_str_mv Universidad de Medellín, Colombia; Universidad Nacional de Colombia, Colombia; Pontificia Universidad Javeriana, Colombia
dc.subject.keyword.eng.fl_str_mv Computing time; Picker routing; Routing policies; Warehouse management
topic Computing time; Picker routing; Routing policies; Warehouse management
description 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.
publishDate 2017
dc.date.created.none.fl_str_mv 2017
dc.date.accessioned.none.fl_str_mv 2018-04-13T16:33:18Z
dc.date.available.none.fl_str_mv 2018-04-13T16:33:18Z
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 7981015
dc.identifier.uri.none.fl_str_mv http://hdl.handle.net/11407/4550
identifier_str_mv 7981015
url http://hdl.handle.net/11407/4550
dc.language.iso.none.fl_str_mv eng
language eng
dc.relation.isversionof.spa.fl_str_mv https://www.scopus.com/inward/record.uri?eid=2-s2.0-85037711557&partnerID=40&md5=c4e4c9ef7219ebdd068af96e233a85a0
dc.relation.ispartofes.spa.fl_str_mv Espacios
dc.relation.references.spa.fl_str_mv Albareda-Sambola, M., Alonso-Ayuso, A., Molina, E., De Blas, C.S., Variable neighborhood search for order batching in a warehouse (2009) Asia-Pacific Journal of Operational Research, 26 (5), pp. 655-683; 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) The Scientific World Journal, 2013 (1), pp. 1-13; Boenzi, F., Digiesi, S., Facchini, F., Mossa, G., Mummolo, G., Greening activities in warehouses: A model for identifying sustainable strategies in material handling (2015) 26th DAAAM international symposium on intelligent manufacturing and automation, pp. 980-988. , Vienna, Austria: Danube Adria Association for Automation and Manufacturing, DAAAM; Bozer, Y.A., Kile, J.W., Order batching in walk-and-pick order picking systems (2008) International Journal of Production Research, 46 (7), pp. 1887-1909; Burinskiene, A., Order picking process at warehouses (2010) International Journal of Logistics Systems and Management, 6 (2), pp. 162-178; Bustillo, M., Menéndez, B., Pardo, E.G., Duarte, A., An algorithm for batching, sequencing and picking operations in a warehouse (2015) International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015, pp. 842-849. , Seville, Spain: Institute of Electrical and Electronics Engineers Inc; Chen, M.-C., Huang, C.-L., Chen, K.-Y., Wu, H.-P., Aggregation of orders in distribution centers using data mining (2005) Expert Systems with Applications, 28 (3), pp. 453-460; 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) International Journal of Production Economics, 159 (1), 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) International Journal of Production Economics, 170 (1), pp. 1-10; Cortés, P., Gómez-Montoya, R.A., Muñuzuri, J., Correa-Espinal, A., A tabu search approach to solving the picking routing problem for large-and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment (2017) Applied Soft Computingl, 53 (1), pp. 61-73; Dukic, G., Oluic, C., Order-picking methods: Improving order-picking efficiency (2007) International Journal of Logistics Systems and Management, 3 (4), pp. 451-460; Dukic, G., Oluic, C., Order-picking routing policies: Simple heuristics, advanced heuristics or optimal algorithm (2004) Strojniski Vestnik/Journal of Mechanical Engineering, 50 (11), pp. 530-535; Elbert, R., Franzke, T., Glock, C.H., Grosse, E.H., Agent-based analysis of picker blocking in manual order picking systems: Effects of routing combinations on throughput time (2016) Proceedings-Winter Simulation Conference, pp. 3937-3948. , Darmstadt, Germany: Institute of Electrical and Electronics Engineers Inc; Van Gils, T., Braekers, K., Ramaekers, K., Depaire, B., Caris, A., Improving order picking efficiency by analyzing combinations of storage, batching, zoning, and routing policies (2016) 7th International Conference on Computational Logistics, , ICCL 2016. Diepenbeek, Belgium: Springer Verlag; Gu, J., Goetschalckx, M., Mcginnis, L.F., Research on warehouse operation: A comprehensive review (2007) European Journal of Operational Research, 177 (1), pp. 1-21; Henn, S., Koch, S., Doerner, K.F., Strauss, C., Wäscher, G., Metaheuristics for the Order Batching Problem in Manual Order Picking Systems (2010) Business Research, 3 (1), pp. 82-105; Henn, S., Scholz, A., Stuhlmann, M., Wäscher, G., (2015) A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout, , (Working paper No. 5). Magdeburg, Germany: Otto-von-Guericke-Universität Magdeburg; Henn, S., Wäscher, G., Tabu search heuristics for the order batching problem in manual order picking systems (2012) European Journal of Operational Research, 222 (3), pp. 484-494; Hsieh, L.-F., Huang, Y.-C., New batch construction heuristics to optimise the performance of order picking systems (2011) International Journal of Production Economics, 131 (2), pp. 618-630; Hsieh, L.F., Tsai, L.H., The optimum design of a warehouse system on order picking efficiency (2006) International Journal of Advanced Manufacturing Technology, 28 (5-6), pp. 626-637; Hwang, H., Kim, D.G., Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system (2005) International Journal of Production Research, 43 (17), pp. 3657-3670; Hwang, H., Oh, Y.H., Lee, Y.K., An evaluation of routing policies for order-picking operations in low-level picker-to-part system (2004) International Journal of Production Research, 42 (18), pp. 3873-3889; Karásek, J., An Overview of Warehouse Optimization (2013) Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems, 2 (3), pp. 1-7; De Koster, R., Le-Duc, T., Roodbergen, K.J., Design and control of warehouse order picking: A literature review (2007) European Journal of Operational Research, 182 (2), pp. 481-501; Li, J., Huang, R., Dai, J.B., Joint optimisation of order batching and picker routing in the online retailer's warehouse in China (2017) International Journal of Production Research, 55 (2), pp. 447-461; Liu, J., Limère, V., Van Landeghem, H., An improved largest gap routing heuristic for order picking (2012) 10th International Industrial Simulation Conference 2012, pp. 179-184. , Dalian City, China: EUROSIS; Manzini, R., Bozer, Y., Heragu, S., Decision models for the design, optimization and management of warehousing and material handling systems (2015) International Journal of Production Economics, 170 (1), pp. 711-716; Matusiak, M., De Koster, R., Kroon, L., Saarinen, J., A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (2014) European Journal of Operational Research, 236 (3), pp. 968-977; Pan, J.C.H., Wu, M.H., Throughput analysis for order picking system with multiple pickers and aisle congestion considerations (2012) Computers and Operations Research, 39 (7), pp. 1661-1672; Petersen, C.G., Aase, G., A comparison of picking, storage, and routing policies in manual order picking (2004) International Journal of Production Economics, 92 (1), pp. 11-19; Petersen, C.G., Schmenner, R.W., An evaluation of routing and volume-based storage policies in an order picking operation (1999) Decision Sciences, 30 (2), pp. 481-501; Petersen, C.G., An evaluation of order picking routeing policies (1997) International Journal of Operations and Production Management, 17 (11), pp. 1098-1111; Petersen, C.G., The impact of routing and storage policies on warehouse efficiency (1999) International Journal of Operations and Production Management, 19 (10), pp. 1053-1064; Roodbergen, K.J., De Koster, R., Routing methods for warehouses with multiple cross aisles (2001) International Journal of Production Research, 39 (9), pp. 1865-1883; Roodbergen, K., Vis, I., A model for warehouse layout (2006) IIE Transactions, 38 (10), pp. 799-811; Salazar, F., Gomez, R.A., Cano, J.A., El problema de carga de pallets en centros de distribución utilizando diseño de mezclas (2017) Revista Espacios, 38 (2), p. 2. , http://www.revistaespacios.com/a17v38n02/17380202.html; Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., (2010) Facilities Planning, , (4th Ed.). New Jersey: Wiley
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.spa.fl_str_mv Revista Espacios
dc.publisher.faculty.spa.fl_str_mv Facultad de Ciencias Económicas y Administrativas
dc.source.spa.fl_str_mv Scopus
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_ 1814159268977311744
spelling 2018-04-13T16:33:18Z2018-04-13T16:33:18Z20177981015http://hdl.handle.net/11407/4550In 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.engRevista EspaciosFacultad de Ciencias Económicas y Administrativashttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85037711557&partnerID=40&md5=c4e4c9ef7219ebdd068af96e233a85a0EspaciosAlbareda-Sambola, M., Alonso-Ayuso, A., Molina, E., De Blas, C.S., Variable neighborhood search for order batching in a warehouse (2009) Asia-Pacific Journal of Operational Research, 26 (5), pp. 655-683; 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) The Scientific World Journal, 2013 (1), pp. 1-13; Boenzi, F., Digiesi, S., Facchini, F., Mossa, G., Mummolo, G., Greening activities in warehouses: A model for identifying sustainable strategies in material handling (2015) 26th DAAAM international symposium on intelligent manufacturing and automation, pp. 980-988. , Vienna, Austria: Danube Adria Association for Automation and Manufacturing, DAAAM; Bozer, Y.A., Kile, J.W., Order batching in walk-and-pick order picking systems (2008) International Journal of Production Research, 46 (7), pp. 1887-1909; Burinskiene, A., Order picking process at warehouses (2010) International Journal of Logistics Systems and Management, 6 (2), pp. 162-178; Bustillo, M., Menéndez, B., Pardo, E.G., Duarte, A., An algorithm for batching, sequencing and picking operations in a warehouse (2015) International Conference on Industrial Engineering and Systems Management, IEEE IESM 2015, pp. 842-849. , Seville, Spain: Institute of Electrical and Electronics Engineers Inc; Chen, M.-C., Huang, C.-L., Chen, K.-Y., Wu, H.-P., Aggregation of orders in distribution centers using data mining (2005) Expert Systems with Applications, 28 (3), pp. 453-460; 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) International Journal of Production Economics, 159 (1), 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) International Journal of Production Economics, 170 (1), pp. 1-10; Cortés, P., Gómez-Montoya, R.A., Muñuzuri, J., Correa-Espinal, A., A tabu search approach to solving the picking routing problem for large-and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment (2017) Applied Soft Computingl, 53 (1), pp. 61-73; Dukic, G., Oluic, C., Order-picking methods: Improving order-picking efficiency (2007) International Journal of Logistics Systems and Management, 3 (4), pp. 451-460; Dukic, G., Oluic, C., Order-picking routing policies: Simple heuristics, advanced heuristics or optimal algorithm (2004) Strojniski Vestnik/Journal of Mechanical Engineering, 50 (11), pp. 530-535; Elbert, R., Franzke, T., Glock, C.H., Grosse, E.H., Agent-based analysis of picker blocking in manual order picking systems: Effects of routing combinations on throughput time (2016) Proceedings-Winter Simulation Conference, pp. 3937-3948. , Darmstadt, Germany: Institute of Electrical and Electronics Engineers Inc; Van Gils, T., Braekers, K., Ramaekers, K., Depaire, B., Caris, A., Improving order picking efficiency by analyzing combinations of storage, batching, zoning, and routing policies (2016) 7th International Conference on Computational Logistics, , ICCL 2016. Diepenbeek, Belgium: Springer Verlag; Gu, J., Goetschalckx, M., Mcginnis, L.F., Research on warehouse operation: A comprehensive review (2007) European Journal of Operational Research, 177 (1), pp. 1-21; Henn, S., Koch, S., Doerner, K.F., Strauss, C., Wäscher, G., Metaheuristics for the Order Batching Problem in Manual Order Picking Systems (2010) Business Research, 3 (1), pp. 82-105; Henn, S., Scholz, A., Stuhlmann, M., Wäscher, G., (2015) A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout, , (Working paper No. 5). Magdeburg, Germany: Otto-von-Guericke-Universität Magdeburg; Henn, S., Wäscher, G., Tabu search heuristics for the order batching problem in manual order picking systems (2012) European Journal of Operational Research, 222 (3), pp. 484-494; Hsieh, L.-F., Huang, Y.-C., New batch construction heuristics to optimise the performance of order picking systems (2011) International Journal of Production Economics, 131 (2), pp. 618-630; Hsieh, L.F., Tsai, L.H., The optimum design of a warehouse system on order picking efficiency (2006) International Journal of Advanced Manufacturing Technology, 28 (5-6), pp. 626-637; Hwang, H., Kim, D.G., Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system (2005) International Journal of Production Research, 43 (17), pp. 3657-3670; Hwang, H., Oh, Y.H., Lee, Y.K., An evaluation of routing policies for order-picking operations in low-level picker-to-part system (2004) International Journal of Production Research, 42 (18), pp. 3873-3889; Karásek, J., An Overview of Warehouse Optimization (2013) Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems, 2 (3), pp. 1-7; De Koster, R., Le-Duc, T., Roodbergen, K.J., Design and control of warehouse order picking: A literature review (2007) European Journal of Operational Research, 182 (2), pp. 481-501; Li, J., Huang, R., Dai, J.B., Joint optimisation of order batching and picker routing in the online retailer's warehouse in China (2017) International Journal of Production Research, 55 (2), pp. 447-461; Liu, J., Limère, V., Van Landeghem, H., An improved largest gap routing heuristic for order picking (2012) 10th International Industrial Simulation Conference 2012, pp. 179-184. , Dalian City, China: EUROSIS; Manzini, R., Bozer, Y., Heragu, S., Decision models for the design, optimization and management of warehousing and material handling systems (2015) International Journal of Production Economics, 170 (1), pp. 711-716; Matusiak, M., De Koster, R., Kroon, L., Saarinen, J., A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (2014) European Journal of Operational Research, 236 (3), pp. 968-977; Pan, J.C.H., Wu, M.H., Throughput analysis for order picking system with multiple pickers and aisle congestion considerations (2012) Computers and Operations Research, 39 (7), pp. 1661-1672; Petersen, C.G., Aase, G., A comparison of picking, storage, and routing policies in manual order picking (2004) International Journal of Production Economics, 92 (1), pp. 11-19; Petersen, C.G., Schmenner, R.W., An evaluation of routing and volume-based storage policies in an order picking operation (1999) Decision Sciences, 30 (2), pp. 481-501; Petersen, C.G., An evaluation of order picking routeing policies (1997) International Journal of Operations and Production Management, 17 (11), pp. 1098-1111; Petersen, C.G., The impact of routing and storage policies on warehouse efficiency (1999) International Journal of Operations and Production Management, 19 (10), pp. 1053-1064; Roodbergen, K.J., De Koster, R., Routing methods for warehouses with multiple cross aisles (2001) International Journal of Production Research, 39 (9), pp. 1865-1883; Roodbergen, K., Vis, I., A model for warehouse layout (2006) IIE Transactions, 38 (10), pp. 799-811; Salazar, F., Gomez, R.A., Cano, J.A., El problema de carga de pallets en centros de distribución utilizando diseño de mezclas (2017) Revista Espacios, 38 (2), p. 2. , http://www.revistaespacios.com/a17v38n02/17380202.html; Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., (2010) Facilities Planning, , (4th Ed.). New Jersey: WileyScopusRouting policies in multi-parallel warehouses: An analysis of computing timesArticleinfo:eu-repo/semantics/articlehttp://purl.org/coar/version/c_970fb48d4fbd8a85http://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1Universidad de Medellín, Colombia; Universidad Nacional de Colombia, Colombia; Pontificia Universidad Javeriana, ColombiaCano J.A., Gomez R.A., Salazar F.Cano, J.A., Universidad de Medellín, Colombia; Gomez, R.A., Universidad Nacional de Colombia, Colombia; Salazar, F., Pontificia Universidad Javeriana, ColombiaComputing time; Picker routing; Routing policies; Warehouse managementIn 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.http://purl.org/coar/access_right/c_16ec11407/4550oai:repository.udem.edu.co:11407/45502020-05-27 19:17:10.02Repositorio Institucional Universidad de Medellinrepositorio@udem.edu.co

Publicaciones similares