Show simple item record

dc.creatorCano J.A.
dc.descriptionThis article aims to validate the parameters of a genetic algorithm for the order batching problem (OBP) in warehouses by defining the parameter values offering the best solution performance. Thus, a description of the OBP and the solution approaches based on item-oriented and group-oriented genetic algorithms are introduced. Then, the characteristics of a group-oriented genetic algorithm are shown, and experiments are performed to establish the parameter values related to population size, crossover rate, elitism rate, and mutation rate. Therefore, we provide the set of parameter values for the genetic algorithm offering better quality results in terms of total distance traveled, and some recommendations to reduce the computing time of the algorithm are presented. Copyright © 2019. Jose Alejandro CANO.
dc.publisherIBIMA Publishing
dc.sourceIBIMA Business Review
dc.subjectGenetic algorithms
dc.subjectOrder batching
dc.subjectOrder picking
dc.subjectWarehouse management
dc.titleParameters for a genetic algorithm: An application for the order batching problem
dc.publisher.programAdministración de Empresas
dc.publisher.facultyFacultad de Ciencias Económicas y Administrativas
dc.affiliationCano, J.A., Universidad de Medellín, 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 J. Oper. Res., 26, pp. 655-683. ,
dc.relation.referencesAzadnia, 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. ,
dc.relation.referencesBozer, Y.A., Kile, J.W., Order batching in walk-and-pick order picking systems (2008) Int. J. Prod. Res., 46, pp. 1887-1909. ,
dc.relation.referencesBustillo, 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. ,, J.M., F., G., A., A. Eds, Institute of Electrical and Electronics Engineers Inc., Seville, Spain
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems (2019) J. King Saud Univ. - Eng. Sci., ,
dc.relation.referencesCano, J.A., Correa-Espinal, A., Gómez-Montoya, R.A., Solución del problema de conformación de lotes en almacenes utilizando algoritmos genéticos (2018) Inf. Tecnológica, 29, pp. 235-244. ,
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) Int. J. Ind. Eng. Manag., 8, pp. 229-238
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., Cortés, P., Genetic Algorithms for the Picker Routing Problem in Multi-block Warehouses (2019) Lecture Notes in Business Information Processing, pp. 313-322. ,, Abramowicz, W., Corchuelo, R. Eds, Springer, Cham
dc.relation.referencesCano, 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
dc.relation.referencesCano, J.A., Gomez, R.A., Salazar, F., Routing policies in multi-parallel warehouses: An analysis of computing times (2017) Espacios, 38, p. 23
dc.relation.referencesCergibozan, Ç., Tasan, A.S., Order batching operations: An overview of classification, solution techniques, and future research (2016) J. Intell. Manuf., pp. 1-15. ,
dc.relation.referencesChen, M.-C., Huang, C.-L., Chen, K.-Y., Wu, H.-P., Aggregation of orders in distribution centers using data mining (2005) Expert Syst. Appl., 28, pp. 453-460. ,
dc.relation.referencesChen, N., Shen, C., A selecting method between picker-to-parts system and put system based on order cluster (2016) Int. J. Control Autom., 9, pp. 189-210. ,
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) Int. J. Prod. Econ., 159, pp. 158-167. ,
dc.relation.referencesChirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Adv. Manuf., 2, pp. 203-211. ,
dc.relation.referencesGademann, N., van de Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse (2005) IIE Trans, 37, pp. 63-75. ,
dc.relation.referencesHenn, 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. ,
dc.relation.referencesHsieh, L.-F., Huang, Y.-C., New batch construction heuristics to optimise the performance of order picking systems (2011) Int. J. Prod. Econ., 131, pp. 618-630. ,
dc.relation.referencesHsu, C.-M., Chen, K.-Y., Chen, M.-C., Batching orders in warehouses by minimizing travel distance with genetic algorithms (2005) Comput. Ind., 56, pp. 169-178. ,
dc.relation.referencesHwang, H., Kim, D.G., Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system (2005) Int. J. Prod. Res., 43, pp. 3657-3670. ,
dc.relation.referencesKoch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) J. Bus. Econ., 86, pp. 131-153. ,
dc.relation.referencesKulak, 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. ,
dc.relation.referencesMenéndez, B., Pardo, E.G., Alonso-Ayuso, A., Molina, E., Duarte, A., Variable Neighborhood Search strategies for the Order Batching Problem (2017) Comput. Oper. Res., 78, pp. 500-512. ,
dc.relation.referencesMenéndez, B., Pardo, E.G., Sánchez-Oro, J., Duarte, A., Parallel variable 30. 733896 neighborhood search for the min-max order batching problem (2017) Int. Trans. Oper. Res., 24, pp. 635-662. ,
dc.relation.referencesMutingi, M., Mbohwa, C., Optimizing order batching in order picking systems: Hybrid grouping genetic algorithm (2017) Grouping Genetic Algorithms: Advances and Applications, pp. 121-140. ,, Mutingi, M., Mbohwa, C. Eds, Springer International Publishing Switzerland, Cham, Switzerland
dc.relation.referencesÖncan, 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, pp. 19-24. , Newswood Limited, Kowloon
dc.relation.referencesPan, J.C.-H., Shih, P.-H., Wu, M.-H., Storage assignment problem with travel distance and blocking considerations for a picker-to-part order picking system (2012) Comput. Ind. Eng., 62, pp. 527-535. ,
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) Int. J. Prod. Res., 46, pp. 6533-6555. ,
dc.relation.referencesWon, J., Olafsson, S., Joint order batching and order picking in warehouse operations (2005) Int. J. Prod. Res., 43, pp. 1427-1442. ,

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record