Mostrar el registro sencillo del ítem

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]

dc.creatorCano J.A.
dc.creatorCorrea-Espinal A.A.
dc.creatorGómez-Montoya R.A.
dc.date2018
dc.date.accessioned2021-02-05T15:00:18Z
dc.date.available2021-02-05T15:00:18Z
dc.identifier.issn7168756
dc.identifier.urihttp://hdl.handle.net/11407/6163
dc.descriptionThis 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.
dc.language.isospa
dc.publisherCentro de Informacion Tecnologica
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85061505817&doi=10.4067%2fS0718-07642018000600235&partnerID=40&md5=97cbdce4bbec0ea5864c766b4b17a865
dc.sourceInformacion Tecnologica
dc.titleSolving the Order Batching Problem in Warehouses using Genetic Algorithms [Solución del Problema de Conformación de Lotes en Almacenes utilizando Algoritmos Genéticos]
dc.typeArticleeng
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.publisher.programAdministración de Empresasspa
dc.identifier.doi10.4067/S0718-07642018000600235
dc.relation.citationvolume29
dc.relation.citationissue6
dc.relation.citationstartpage235
dc.relation.citationendpage244
dc.publisher.facultyFacultad de Ciencias Económicas y Administrativasspa
dc.affiliationCano, J.A., Facultad de Ciencias Económicas y Administrativas, Universidad de Medellín, Cra. 87 # 30-65, Medellín, Colombia
dc.affiliationCorrea-Espinal, A.A., Facultad de Minas, Universidad Nacional de Colombia, Cra. 80 # 65-223, Medellín, Colombia
dc.affiliationGó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, Colombia
dc.relation.referencesAlbareda-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
dc.relation.referencesAzadnia, 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
dc.relation.referencesBozer, 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
dc.relation.referencesBustillo, 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
dc.relation.referencesCano, 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
dc.relation.referencesCano, 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
dc.relation.referencesCano, 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
dc.relation.referencesCergibozan, 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
dc.relation.referencesChen, 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
dc.relation.referencesChirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Advances in Manufacturing, 2 (3), pp. 203-211. , y
dc.relation.referencesCorté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
dc.relation.referencesCortina, 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
dc.relation.referencesGademann, 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
dc.relation.referencesGó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
dc.relation.referencesGó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
dc.relation.referencesHsu, 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
dc.relation.referencesKoch, 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
dc.relation.referencesOncan, 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
dc.relation.referencesPan, 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
dc.relation.referencesPé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
dc.relation.referencesTsai, 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
dc.relation.referencesZhu, 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.type.versioninfo:eu-repo/semantics/publishedVersion
dc.type.driverinfo:eu-repo/semantics/article


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem