Solving Order Batching/Picking Problems with an Evolutionary Algorithm

Autores
Miguel, Fabio Maximiliano; Frutos, Mariano; Méndez, Máximo; Tohmé, Fernando
Año de publicación
2021
Idioma
español castellano
Tipo de recurso
artículo
Estado
versión aceptada
Descripción
Fil: Miguel Fabio M. Universidad Nacional de Río Negro. Río Negro, Argentina
Fil: Frutos Mariano. Universidad Nacional del Sur. Departamento de Ingeniería, IIESS UNS CONICET. Bahía Blanca, Argentina
Fil: Méndez Máximo. Universidad de Las Palmas de Gran Canaria (ULPGC). Instituto Universitario SIANI. Las Palmas, España
Fil: Tohmé Fernando. Universidad Nacional del Sur. Departamento de Economía, INMABB UNS CONICET. Bahía Blanca, Argentina
We present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.
We present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.
Materia
Ingenierías, Ciencia y Teconologías (general)
Order Batching
order picking
Evolutionary algorithm
Ingenierías, Ciencia y Teconologías (general)
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
RID-UNRN (UNRN)
Institución
Universidad Nacional de Río Negro
OAI Identificador
oai:rid.unrn.edu.ar:20.500.12049/8795
Acceder
id RIDUNRN_69b6f121d5b60ccfd30cf922e12aaeb6
oai_identifier_str oai:rid.unrn.edu.ar:20.500.12049/8795
network_acronym_str RIDUNRN
repository_id_str 4369
network_name_str RID-UNRN (UNRN)
spelling Solving Order Batching/Picking Problems with an Evolutionary AlgorithmMiguel, Fabio MaximilianoFrutos, MarianoMéndez, MáximoTohmé, FernandoIngenierías, Ciencia y Teconologías (general)Order Batchingorder pickingEvolutionary algorithmIngenierías, Ciencia y Teconologías (general)Fil: Miguel Fabio M. Universidad Nacional de Río Negro. Río Negro, ArgentinaFil: Frutos Mariano. Universidad Nacional del Sur. Departamento de Ingeniería, IIESS UNS CONICET. Bahía Blanca, ArgentinaFil: Méndez Máximo. Universidad de Las Palmas de Gran Canaria (ULPGC). Instituto Universitario SIANI. Las Palmas, EspañaFil: Tohmé Fernando. Universidad Nacional del Sur. Departamento de Economía, INMABB UNS CONICET. Bahía Blanca, ArgentinaWe present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.We present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.Springer Nature2021-05-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfMiguel, F.M., Frutos, M., Méndez, M., Tohmé, F. (2021). Solving Order Batching/Picking Problems with an Evolutionary Algorithm. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science; 1407; 177–1861865-0937https://link.springer.com/chapter/10.1007/978-3-030-76307-7_14http://rid.unrn.edu.ar/handle/20.500.12049/8795https://doi.org/10.1007/978-3-030-76307-7_14spa1407Communications in Computer and Information Scienceinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/4.0/reponame:RID-UNRN (UNRN)instname:Universidad Nacional de Río Negro2025-10-16T10:06:08Zoai:rid.unrn.edu.ar:20.500.12049/8795instacron:UNRNInstitucionalhttps://rid.unrn.edu.ar/jspui/Universidad públicaNo correspondehttps://rid.unrn.edu.ar/oai/snrdrid@unrn.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:43692025-10-16 10:06:09.304RID-UNRN (UNRN) - Universidad Nacional de Río Negrofalse
dc.title.none.fl_str_mv Solving Order Batching/Picking Problems with an Evolutionary Algorithm
title Solving Order Batching/Picking Problems with an Evolutionary Algorithm
spellingShingle Solving Order Batching/Picking Problems with an Evolutionary Algorithm
Miguel, Fabio Maximiliano
Ingenierías, Ciencia y Teconologías (general)
Order Batching
order picking
Evolutionary algorithm
Ingenierías, Ciencia y Teconologías (general)
title_short Solving Order Batching/Picking Problems with an Evolutionary Algorithm
title_full Solving Order Batching/Picking Problems with an Evolutionary Algorithm
title_fullStr Solving Order Batching/Picking Problems with an Evolutionary Algorithm
title_full_unstemmed Solving Order Batching/Picking Problems with an Evolutionary Algorithm
title_sort Solving Order Batching/Picking Problems with an Evolutionary Algorithm
dc.creator.none.fl_str_mv Miguel, Fabio Maximiliano
Frutos, Mariano
Méndez, Máximo
Tohmé, Fernando
author Miguel, Fabio Maximiliano
author_facet Miguel, Fabio Maximiliano
Frutos, Mariano
Méndez, Máximo
Tohmé, Fernando
author_role author
author2 Frutos, Mariano
Méndez, Máximo
Tohmé, Fernando
author2_role author
author
author
dc.subject.none.fl_str_mv Ingenierías, Ciencia y Teconologías (general)
Order Batching
order picking
Evolutionary algorithm
Ingenierías, Ciencia y Teconologías (general)
topic Ingenierías, Ciencia y Teconologías (general)
Order Batching
order picking
Evolutionary algorithm
Ingenierías, Ciencia y Teconologías (general)
dc.description.none.fl_txt_mv Fil: Miguel Fabio M. Universidad Nacional de Río Negro. Río Negro, Argentina
Fil: Frutos Mariano. Universidad Nacional del Sur. Departamento de Ingeniería, IIESS UNS CONICET. Bahía Blanca, Argentina
Fil: Méndez Máximo. Universidad de Las Palmas de Gran Canaria (ULPGC). Instituto Universitario SIANI. Las Palmas, España
Fil: Tohmé Fernando. Universidad Nacional del Sur. Departamento de Economía, INMABB UNS CONICET. Bahía Blanca, Argentina
We present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.
We present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.
description Fil: Miguel Fabio M. Universidad Nacional de Río Negro. Río Negro, Argentina
publishDate 2021
dc.date.none.fl_str_mv 2021-05-12
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv Miguel, F.M., Frutos, M., Méndez, M., Tohmé, F. (2021). Solving Order Batching/Picking Problems with an Evolutionary Algorithm. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science; 1407; 177–186
1865-0937
https://link.springer.com/chapter/10.1007/978-3-030-76307-7_14
http://rid.unrn.edu.ar/handle/20.500.12049/8795
https://doi.org/10.1007/978-3-030-76307-7_14
identifier_str_mv Miguel, F.M., Frutos, M., Méndez, M., Tohmé, F. (2021). Solving Order Batching/Picking Problems with an Evolutionary Algorithm. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science; 1407; 177–186
1865-0937
url https://link.springer.com/chapter/10.1007/978-3-030-76307-7_14
http://rid.unrn.edu.ar/handle/20.500.12049/8795
https://doi.org/10.1007/978-3-030-76307-7_14
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv 1407
Communications in Computer and Information Science
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/4.0/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/4.0/
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Springer Nature
publisher.none.fl_str_mv Springer Nature
dc.source.none.fl_str_mv reponame:RID-UNRN (UNRN)
instname:Universidad Nacional de Río Negro
reponame_str RID-UNRN (UNRN)
collection RID-UNRN (UNRN)
instname_str Universidad Nacional de Río Negro
repository.name.fl_str_mv RID-UNRN (UNRN) - Universidad Nacional de Río Negro
repository.mail.fl_str_mv rid@unrn.edu.ar
_version_ 1846145930960568320
score 12.712165

Publicaciones similares