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.author | Miguel, Fabio Maximiliano | - |
| dc.contributor.author | Frutos, Mariano | - |
| dc.contributor.author | Méndez, Máximo | - |
| dc.contributor.author | Tohmé, Fernando | - |
| dc.date.accessioned | 2022-05-26T14:52:33Z | - |
| dc.date.available | 2022-05-26T14:52:33Z | - |
| dc.date.issued | 2021-05-12 | - |
| dc.identifier.citation | 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 | es_ES |
| dc.identifier.issn | 1865-0937 | es_ES |
| dc.identifier.other | https://link.springer.com/chapter/10.1007/978-3-030-76307-7_14 | es_ES |
| dc.identifier.uri | http://rid.unrn.edu.ar/handle/20.500.12049/8795 | - |
| dc.description.abstract | 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. | es_ES |
| dc.format.extent | p. 177–186 | es_ES |
| dc.language.iso | es | es_ES |
| dc.publisher | Springer Nature | es_ES |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | - |
| dc.title | Solving Order Batching/Picking Problems with an Evolutionary Algorithm | es_ES |
| dc.type | Articulo | es_ES |
| dc.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | - |
| dc.description.filiation | Miguel Fabio M. Universidad Nacional de Río Negro. Río Negro, Argentina | es_ES |
| dc.description.filiation | Frutos Mariano. Universidad Nacional del Sur. Departamento de Ingeniería, IIESS UNS CONICET. Bahía Blanca, Argentina | es_ES |
| dc.description.filiation | Méndez Máximo. Universidad de Las Palmas de Gran Canaria (ULPGC). Instituto Universitario SIANI. Las Palmas, España | es_ES |
| dc.description.filiation | Tohmé Fernando. Universidad Nacional del Sur. Departamento de Economía, INMABB UNS CONICET. Bahía Blanca, Argentina | es_ES |
| dc.subject.keyword | Order Batching | es_ES |
| dc.subject.keyword | order picking | es_ES |
| dc.subject.keyword | Evolutionary algorithm | es_ES |
| dc.type.version | info:eu-repo/semantics/acceptedVersion | es_ES |
| dc.subject.materia | Ingenierías, Ciencia y Teconologías (general) | es_ES |
| dc.origin.lugarDesarrollo | Universidad Nacional de Río Negro | es_ES |
| dc.relation.journalissue | 1407 | es_ES |
| dc.description.review | true | es_ES |
| dc.description.resumen | 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. | es_ES |
| dc.identifier.doi | https://doi.org/10.1007/978-3-030-76307-7_14 | - |
| dc.relation.journalTitle | Communications in Computer and Information Science | es_ES |
| Aparece en las colecciones: | Artículos | |
Archivos en este ítem:
| Archivo | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| Miguel et. al. SPRINGER (2021) Publicado.pdf | Solving Order Batching/Picking Problems with an Evolutionary Algorithm | 493,9 kB | Adobe PDF | Visualizar/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
