Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]

This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and distribution centers where the order-batching problem applies for order picking systems. For this, a new representation of solutions is proposed, in which each gene of a chromosome represents a custo...

Full description

Autores:

Tipo de recurso:

Fecha de publicación:: 2018

Institución:: Universidad de Medellín

Repositorio:: Repositorio UDEM

Idioma:: spa

id	REPOUDEM2_ab1246fef1b14fccedbc92ca4b83ab54
oai_identifier_str	oai:repository.udem.edu.co:11407/6163
network_acronym_str	REPOUDEM2
network_name_str	Repositorio UDEM
repository_id_str
dc.title.none.fl_str_mv	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
title	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
spellingShingle	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
title_short	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
title_full	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
title_fullStr	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
title_full_unstemmed	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
title_sort	Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
description	This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and distribution centers where the order-batching problem applies for order picking systems. For this, a new representation of solutions is proposed, in which each gene of a chromosome represents a customer order to be retrieved, easing the application of crossover and mutation operators. Through computational experiments, it is shown that the genetic algorithm generates significant savings in distance traveled and number of batches compared to a basic rule of order batch formation, especially in scenarios where a greater number of batches is required. We conclude that the genetic algorithm provides efficient solutions in a reasonable computational time, thus its implementation is highly recommended in operative environments of warehouses and distribution centers. © Centro de Informacion Tecnologica. All rights reserved.
publishDate	2018
dc.date.accessioned.none.fl_str_mv	2021-02-05T15:00:18Z
dc.date.available.none.fl_str_mv	2021-02-05T15:00:18Z
dc.date.none.fl_str_mv	2018
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	7168756
dc.identifier.uri.none.fl_str_mv	http://hdl.handle.net/11407/6163
dc.identifier.doi.none.fl_str_mv	10.4067/S0718-07642018000600235
identifier_str_mv	7168756 10.4067/S0718-07642018000600235
url	http://hdl.handle.net/11407/6163
dc.language.iso.none.fl_str_mv	spa
language	spa
dc.relation.isversionof.none.fl_str_mv	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061505817&doi=10.4067%2fS0718-07642018000600235&partnerID=40&md5=97cbdce4bbec0ea5864c766b4b17a865
dc.relation.citationvolume.none.fl_str_mv	29
dc.relation.citationissue.none.fl_str_mv	6
dc.relation.citationstartpage.none.fl_str_mv	235
dc.relation.citationendpage.none.fl_str_mv	244
dc.relation.references.none.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. , y Azadnia, A.H., Taheri, S., Order batching in warehouses by minimizing total tardiness: A hybrid Approach of Weighted Association Rule Mining and Genetic Algorithms (2013) The Scientific World Journal, pp. 1-13. , y 20132013 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. , y Bustillo, M., Menéndez, B., Pardo, E.G., Duarte, A., An algorithm for batching, sequencing and picking operations in a warehouse (2015) Int. Conference on Industrial Engineering and Systems Management, , y Sevilla, España Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., An evaluation of picking routing policies to improve warehouse efficiency (2017) International Journal of Industrial Engineering and Management, 8 (4), pp. 229-238. , y Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., (2018) A Review of Research Trends in Order Batching, Sequencing and Picker Routing Problems, Espacios, 39 (4), p. 3. , y Cano, J.A., Gomez, R.A., Salazar, F., (2017) Routing Policies in Multi-Parallel Warehouses: An Analysis of Computing Times, Espacios, 38 (51), p. 23. , y Cergibozan, C., Tasan, A.S., Order batching operations: An overview of classification, solution techniques, and future research (2016) Journal of Intelligent Manufacturing, pp. 1-15. , y 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, pp. 158-167. , y Chirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Advances in Manufacturing, 2 (3), pp. 203-211. , y 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 Computing, 53 (1), pp. 61-73. , y Cortina, J.J., López-Lezama, J.M., Muñoz-Galeano, N., Metaheurísticas Aplicadas al Problema de Interdicción en Sistemas de Potencia (2018) Información Tecnológica, 29 (2), pp. 73-88. , y Gademann, N., Van De Velde, S., Order Batching to Minimize Total Travel Time in a Parallel-aisle Warehouse (2005) IIE Transactions, 37 (1), pp. 63-75. , y 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) Dirección Y Organización, 59 (1), pp. 49-60. , y Gómez, R.A., Giraldo, O.G., Campo, E.A., Conformación de Lotes Mínimo Tiempo en la Operación de Acomodo Considerando k Equipos Homogéneos usando Metaheurísticos (2016) Información Tecnológica, 27 (6), pp. 53-62. , y Hsu, C.-M., Chen, K.-Y., Chen, M.-C., Batching orders in warehouses by minimizing travel distance with genetic algorithms (2005) Computers in Industry, 56 (2), pp. 169-178. , y Koch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) Journal of Business Economics, 86 (1), pp. 131-153. , y Oncan, T., A Genetic Algorithm for the Order Batching Problem in Low-level Picker-to-part Warehouse Systems (2013) Lecture Notes in Engineering and Computer Science, , Kowloon- Hong Kong Pan, J.C.-H., Shih, P.-H., Wu, M.-H., Order Batching in a Pick-and-pass Warehousing System with Group Genetic Algorithm (2015) Omega, 57 (B), pp. 238-248. , y Pérez-Rodríguez, R., Hernández-Aguirre, A., An Estimation of Distribution Algorithm based Approach for the Order Batching Problem (2015) Research in Computing Science, 93 (1), pp. 141-150. , y 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) International Journal of Production Research, 46 (22), pp. 6533-6555. , y Zhu, J., Zhang, H., Zhou, L., Guo, J., Order batching optimization in dual zone type warehouse (2015) Science Journal of Business and Management, 3 (3), pp. 77-81. , y
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	Centro de Informacion Tecnologica
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	Centro de Informacion Tecnologica
dc.source.none.fl_str_mv	Informacion Tecnologica
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_	1814159145376415744
spelling	20182021-02-05T15:00:18Z2021-02-05T15:00:18Z7168756http://hdl.handle.net/11407/616310.4067/S0718-07642018000600235This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and distribution centers where the order-batching problem applies for order picking systems. For this, a new representation of solutions is proposed, in which each gene of a chromosome represents a customer order to be retrieved, easing the application of crossover and mutation operators. Through computational experiments, it is shown that the genetic algorithm generates significant savings in distance traveled and number of batches compared to a basic rule of order batch formation, especially in scenarios where a greater number of batches is required. We conclude that the genetic algorithm provides efficient solutions in a reasonable computational time, thus its implementation is highly recommended in operative environments of warehouses and distribution centers. © Centro de Informacion Tecnologica. All rights reserved.spaCentro de Informacion TecnologicaAdministración de EmpresasFacultad de Ciencias Económicas y Administrativashttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85061505817&doi=10.4067%2fS0718-07642018000600235&partnerID=40&md5=97cbdce4bbec0ea5864c766b4b17a865296235244Albareda-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. , yAzadnia, A.H., Taheri, S., Order batching in warehouses by minimizing total tardiness: A hybrid Approach of Weighted Association Rule Mining and Genetic Algorithms (2013) The Scientific World Journal, pp. 1-13. , y 20132013Bozer, 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. , yBustillo, M., Menéndez, B., Pardo, E.G., Duarte, A., An algorithm for batching, sequencing and picking operations in a warehouse (2015) Int. Conference on Industrial Engineering and Systems Management, , y Sevilla, EspañaCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., An evaluation of picking routing policies to improve warehouse efficiency (2017) International Journal of Industrial Engineering and Management, 8 (4), pp. 229-238. , yCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., (2018) A Review of Research Trends in Order Batching, Sequencing and Picker Routing Problems, Espacios, 39 (4), p. 3. , yCano, J.A., Gomez, R.A., Salazar, F., (2017) Routing Policies in Multi-Parallel Warehouses: An Analysis of Computing Times, Espacios, 38 (51), p. 23. , yCergibozan, C., Tasan, A.S., Order batching operations: An overview of classification, solution techniques, and future research (2016) Journal of Intelligent Manufacturing, pp. 1-15. , yChen, 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, pp. 158-167. , yChirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Advances in Manufacturing, 2 (3), pp. 203-211. , yCorté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 Computing, 53 (1), pp. 61-73. , yCortina, J.J., López-Lezama, J.M., Muñoz-Galeano, N., Metaheurísticas Aplicadas al Problema de Interdicción en Sistemas de Potencia (2018) Información Tecnológica, 29 (2), pp. 73-88. , yGademann, N., Van De Velde, S., Order Batching to Minimize Total Travel Time in a Parallel-aisle Warehouse (2005) IIE Transactions, 37 (1), pp. 63-75. , yGó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) Dirección Y Organización, 59 (1), pp. 49-60. , yGómez, R.A., Giraldo, O.G., Campo, E.A., Conformación de Lotes Mínimo Tiempo en la Operación de Acomodo Considerando k Equipos Homogéneos usando Metaheurísticos (2016) Información Tecnológica, 27 (6), pp. 53-62. , yHsu, C.-M., Chen, K.-Y., Chen, M.-C., Batching orders in warehouses by minimizing travel distance with genetic algorithms (2005) Computers in Industry, 56 (2), pp. 169-178. , yKoch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) Journal of Business Economics, 86 (1), pp. 131-153. , yOncan, T., A Genetic Algorithm for the Order Batching Problem in Low-level Picker-to-part Warehouse Systems (2013) Lecture Notes in Engineering and Computer Science, , Kowloon- Hong KongPan, J.C.-H., Shih, P.-H., Wu, M.-H., Order Batching in a Pick-and-pass Warehousing System with Group Genetic Algorithm (2015) Omega, 57 (B), pp. 238-248. , yPérez-Rodríguez, R., Hernández-Aguirre, A., An Estimation of Distribution Algorithm based Approach for the Order Batching Problem (2015) Research in Computing Science, 93 (1), pp. 141-150. , yTsai, 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) International Journal of Production Research, 46 (22), pp. 6533-6555. , yZhu, J., Zhang, H., Zhou, L., Guo, J., Order batching optimization in dual zone type warehouse (2015) Science Journal of Business and Management, 3 (3), pp. 77-81. , yInformacion TecnologicaSolving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]Articleinfo: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., Facultad de Ciencias Económicas y Administrativas, Universidad de Medellín, Cra. 87 # 30-65, Medellín, ColombiaCorrea-Espinal, A.A., Facultad de Minas, Universidad Nacional de Colombia, Cra. 80 # 65-223, Medellín, ColombiaGómez-Montoya, R.A., Escuela Superior en Administración de Cadena de Suministro ESACS, Politécnico Colombiano Jaime Isaza Cadavid, Cra. 48 # 7-151, Medellín, Colombiahttp://purl.org/coar/access_right/c_16ecCano J.A.Correa-Espinal A.A.Gómez-Montoya R.A.11407/6163oai:repository.udem.edu.co:11407/61632021-02-05 10:00:18.688Repositorio Institucional Universidad de Medellinrepositorio@udem.edu.co

Solving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]

Publicaciones similares