Por favor, use este identificador para citar o enlazar este ítem:
http://rid.unrn.edu.ar/handle/20.500.12049/8795
Título: | Solving Order Batching/Picking Problems with an Evolutionary Algorithm |
Autor(es): | Miguel, Fabio Maximiliano Frutos, Mariano Méndez, Máximo Tohmé, Fernando |
Fecha de publicación: | 12-may-2021 |
Editorial: | Springer Nature |
Citación: | 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 |
Revista: | Communications in Computer and Information Science |
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. |
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. |
URI: | http://rid.unrn.edu.ar/handle/20.500.12049/8795 |
Identificador DOI: | https://doi.org/10.1007/978-3-030-76307-7_14 |
ISSN: | 1865-0937 |
Otros enlaces: | https://link.springer.com/chapter/10.1007/978-3-030-76307-7_14 |
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