Skip navigation
Por favor, use este identificador para citar o enlazar este ítem: http://rid.unrn.edu.ar/handle/20.500.12049/8795

Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.contributor.authorMiguel, Fabio Maximiliano-
dc.contributor.authorFrutos, Mariano-
dc.contributor.authorMéndez, Máximo-
dc.contributor.authorTohmé, Fernando-
dc.date.accessioned2022-05-26T14:52:33Z-
dc.date.available2022-05-26T14:52:33Z-
dc.date.issued2021-05-12-
dc.identifier.citationMiguel, 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–186es_ES
dc.identifier.issn1865-0937es_ES
dc.identifier.otherhttps://link.springer.com/chapter/10.1007/978-3-030-76307-7_14es_ES
dc.identifier.urihttp://rid.unrn.edu.ar/handle/20.500.12049/8795-
dc.description.abstractWe 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.es_ES
dc.format.extentp. 177–186es_ES
dc.language.isoeses_ES
dc.publisherSpringer Naturees_ES
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/-
dc.titleSolving Order Batching/Picking Problems with an Evolutionary Algorithmes_ES
dc.typeArticuloes_ES
dc.rights.licenseCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)-
dc.description.filiationMiguel Fabio M. Universidad Nacional de Río Negro. Río Negro, Argentinaes_ES
dc.description.filiationFrutos Mariano. Universidad Nacional del Sur. Departamento de Ingeniería, IIESS UNS CONICET. Bahía Blanca, Argentinaes_ES
dc.description.filiationMéndez Máximo. Universidad de Las Palmas de Gran Canaria (ULPGC). Instituto Universitario SIANI. Las Palmas, Españaes_ES
dc.description.filiationTohmé Fernando. Universidad Nacional del Sur. Departamento de Economía, INMABB UNS CONICET. Bahía Blanca, Argentinaes_ES
dc.subject.keywordOrder Batchinges_ES
dc.subject.keywordorder pickinges_ES
dc.subject.keywordEvolutionary algorithmes_ES
dc.type.versioninfo:eu-repo/semantics/acceptedVersiones_ES
dc.subject.materiaIngenierías, Ciencia y Teconologías (general)es_ES
dc.origin.lugarDesarrolloUniversidad Nacional de Río Negroes_ES
dc.relation.journalissue1407es_ES
dc.description.reviewtruees_ES
dc.description.resumenWe 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.es_ES
dc.identifier.doihttps://doi.org/10.1007/978-3-030-76307-7_14-
dc.relation.journalTitleCommunications in Computer and Information Sciencees_ES
Aparece en las colecciones: Artículos

Archivos en este ítem:
Archivo Descripción Tamaño Formato  
Miguel et. al. SPRINGER (2021) Publicado.pdfSolving Order Batching/Picking Problems with an Evolutionary Algorithm493,9 kBAdobe PDFVisualizar/Abrir

Este documento es resultado del financiamiento otorgado por el Estado Nacional, por lo tanto queda sujeto al cumplimiento de la Ley N° 26.899


Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons