Parameters for a genetic algorithm: An application for the order batching problem
This 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...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2019
- Institución:
- Universidad de Medellín
- Repositorio:
- Repositorio UDEM
- Idioma:
- eng
- OAI Identifier:
- oai:repository.udem.edu.co:11407/5672
- Acceso en línea:
- http://hdl.handle.net/11407/5672
- Palabra clave:
- Genetic algorithms
Order batching
Order picking
Parameters
Warehouse management
- Rights
- License
- http://purl.org/coar/access_right/c_16ec
| id |
REPOUDEM2_272ee437dd8d9591f24cecf0142d1472 |
|---|---|
| oai_identifier_str |
oai:repository.udem.edu.co:11407/5672 |
| network_acronym_str |
REPOUDEM2 |
| network_name_str |
Repositorio UDEM |
| repository_id_str |
|
| dc.title.none.fl_str_mv |
Parameters for a genetic algorithm: An application for the order batching problem |
| title |
Parameters for a genetic algorithm: An application for the order batching problem |
| spellingShingle |
Parameters for a genetic algorithm: An application for the order batching problem Genetic algorithms Order batching Order picking Parameters Warehouse management |
| title_short |
Parameters for a genetic algorithm: An application for the order batching problem |
| title_full |
Parameters for a genetic algorithm: An application for the order batching problem |
| title_fullStr |
Parameters for a genetic algorithm: An application for the order batching problem |
| title_full_unstemmed |
Parameters for a genetic algorithm: An application for the order batching problem |
| title_sort |
Parameters for a genetic algorithm: An application for the order batching problem |
| dc.subject.none.fl_str_mv |
Genetic algorithms Order batching Order picking Parameters Warehouse management |
| topic |
Genetic algorithms Order batching Order picking Parameters Warehouse management |
| description |
This 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. |
| publishDate |
2019 |
| dc.date.accessioned.none.fl_str_mv |
2020-04-29T14:53:37Z |
| dc.date.available.none.fl_str_mv |
2020-04-29T14:53:37Z |
| dc.date.none.fl_str_mv |
2019 |
| 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 |
19473788 |
| dc.identifier.uri.none.fl_str_mv |
http://hdl.handle.net/11407/5672 |
| dc.identifier.doi.none.fl_str_mv |
10.5171/2019.802597 |
| identifier_str_mv |
19473788 10.5171/2019.802597 |
| url |
http://hdl.handle.net/11407/5672 |
| 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-85073113910&doi=10.5171%2f2019.802597&partnerID=40&md5=a3f5799cc7fe9c59c6ad8a8b85c3325b |
| dc.relation.citationvolume.none.fl_str_mv |
2019 |
| 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 J. Oper. Res., 26, pp. 655-683. , https://doi.org/10.1142/S0217595909002390 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. , https://doi.org/10.1155/2013/246578 Bozer, Y.A., Kile, J.W., Order batching in walk-and-pick order picking systems (2008) Int. J. Prod. Res., 46, pp. 1887-1909. , https://doi.org/10.1080/00207540600920850 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. , https://doi.org/10.1109/IESM.2015.7380254, J.M., F., G., A., A. Eds, Institute of Electrical and Electronics Engineers Inc., Seville, Spain Cano, 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., , https://doi.org/10.1016/j.jksues.2019.02.004 Cano, 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. , https://doi.org/10.4067/S0718-07642018000600235 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., 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. , https://doi.org/10.1007/978-3-030-20485-3_24, Abramowicz, W., Corchuelo, R. Eds, Springer, Cham 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., 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. , https://doi.org/10.1007/s10845-016-1248-4 Chen, 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. , https://doi.org/10.1016/j.eswa.2004.12.006 Chen, 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. , https://doi.org/10.14257/ijca.2016.9.7.18 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. , https://doi.org/10.1016/j.ijpe.2014.09.029 Chirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Adv. Manuf., 2, pp. 203-211. , https://doi.org/10.1007/s40436-014-0074-1 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. , https://doi.org/10.1080/07408170590516917 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. , https://doi.org/10.1007/s10696-012-9164-1 Hsieh, 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. , https://doi.org/10.1016/j.ijpe.2011.02.006 Hsu, 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. , https://doi.org/10.1016/j.compind.2004.06.001 Hwang, 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. , https://doi.org/10.1080/00207540500151325 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. , https://doi.org/10.1007/s11573-015-0789-x 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. , https://doi.org/10.1007/s10696-011-9101-8 Mené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. , https://doi.org/10.1016/j.cor.2016.01.020 Mené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. , https://doi.org/10.1111/itor.12309 Mutingi, M., Mbohwa, C., Optimizing order batching in order picking systems: Hybrid grouping genetic algorithm (2017) Grouping Genetic Algorithms: Advances and Applications, pp. 121-140. , https://doi.org/10.1007/978-3-319-44394-2, Mutingi, M., Mbohwa, C. Eds, Springer International Publishing Switzerland, Cham, Switzerland Ö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 Pan, 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. , https://doi.org/10.1016/j.cie.2011.11.001 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. , https://doi.org/10.1080/00207540701441947 Won, J., Olafsson, S., Joint order batching and order picking in warehouse operations (2005) Int. J. Prod. Res., 43, pp. 1427-1442. , https://doi.org/10.1080/00207540410001 |
| 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 |
IBIMA Publishing |
| dc.publisher.program.none.fl_str_mv |
Administración de Empresas |
| dc.publisher.faculty.none.fl_str_mv |
Facultad de Ciencias Económicas y Administrativas |
| publisher.none.fl_str_mv |
IBIMA Publishing |
| dc.source.none.fl_str_mv |
IBIMA Business Review |
| 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_ |
1814159210656563200 |
| spelling |
20192020-04-29T14:53:37Z2020-04-29T14:53:37Z19473788http://hdl.handle.net/11407/567210.5171/2019.802597This 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.engIBIMA PublishingAdministración de EmpresasFacultad de Ciencias Económicas y Administrativashttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85073113910&doi=10.5171%2f2019.802597&partnerID=40&md5=a3f5799cc7fe9c59c6ad8a8b85c3325b2019Albareda-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. , https://doi.org/10.1142/S0217595909002390Azadnia, 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. , https://doi.org/10.1155/2013/246578Bozer, Y.A., Kile, J.W., Order batching in walk-and-pick order picking systems (2008) Int. J. Prod. Res., 46, pp. 1887-1909. , https://doi.org/10.1080/00207540600920850Bustillo, 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. , https://doi.org/10.1109/IESM.2015.7380254, J.M., F., G., A., A. Eds, Institute of Electrical and Electronics Engineers Inc., Seville, SpainCano, 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., , https://doi.org/10.1016/j.jksues.2019.02.004Cano, 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. , https://doi.org/10.4067/S0718-07642018000600235Cano, 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., 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. , https://doi.org/10.1007/978-3-030-20485-3_24, Abramowicz, W., Corchuelo, R. Eds, Springer, ChamCano, 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., 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-15. , https://doi.org/10.1007/s10845-016-1248-4Chen, 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. , https://doi.org/10.1016/j.eswa.2004.12.006Chen, 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. , https://doi.org/10.14257/ijca.2016.9.7.18Chen, 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. , https://doi.org/10.1016/j.ijpe.2014.09.029Chirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Adv. Manuf., 2, pp. 203-211. , https://doi.org/10.1007/s40436-014-0074-1Gademann, N., van de Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse (2005) IIE Trans, 37, pp. 63-75. , https://doi.org/10.1080/07408170590516917Henn, 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. , https://doi.org/10.1007/s10696-012-9164-1Hsieh, 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. , https://doi.org/10.1016/j.ijpe.2011.02.006Hsu, 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. , https://doi.org/10.1016/j.compind.2004.06.001Hwang, 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. , https://doi.org/10.1080/00207540500151325Koch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) J. Bus. Econ., 86, pp. 131-153. , https://doi.org/10.1007/s11573-015-0789-xKulak, 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. , https://doi.org/10.1007/s10696-011-9101-8Mené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. , https://doi.org/10.1016/j.cor.2016.01.020Mené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. , https://doi.org/10.1111/itor.12309Mutingi, M., Mbohwa, C., Optimizing order batching in order picking systems: Hybrid grouping genetic algorithm (2017) Grouping Genetic Algorithms: Advances and Applications, pp. 121-140. , https://doi.org/10.1007/978-3-319-44394-2, Mutingi, M., Mbohwa, C. Eds, Springer International Publishing Switzerland, Cham, SwitzerlandÖ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, KowloonPan, 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. , https://doi.org/10.1016/j.cie.2011.11.001Tsai, 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. , https://doi.org/10.1080/00207540701441947Won, J., Olafsson, S., Joint order batching and order picking in warehouse operations (2005) Int. J. Prod. Res., 43, pp. 1427-1442. , https://doi.org/10.1080/00207540410001IBIMA Business ReviewGenetic algorithmsOrder batchingOrder pickingParametersWarehouse managementParameters for a genetic algorithm: An application for the order batching problemArticleinfo: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, Medellín, Colombiahttp://purl.org/coar/access_right/c_16ecCano J.A.11407/5672oai:repository.udem.edu.co:11407/56722020-05-27 18:26:57.606Repositorio Institucional Universidad de Medellinrepositorio@udem.edu.co |