Utilize este identificador para referenciar este registo: https://hdl.handle.net/10216/77788
Registo completo
Campo DCValorIdioma
dc.creatorPedro Amorim
dc.creatorBernardo Almada Lobo
dc.creatorMarcio Belo Filho
dc.date.accessioned2025-11-13T17:48:25Z-
dc.date.available2025-11-13T17:48:25Z-
dc.date.issued2015
dc.identifier.issn0020-7543
dc.identifier.othersigarra:96780
dc.identifier.urihttps://hdl.handle.net/10216/77788-
dc.descriptionProduction and distribution problems with perishable goods are common in many industries. For the sake of the competitiveness of the companies, the supply chain planning of products with restricted lifespan should be addressed with an integrated approach. Particularly at the operational level, the sizing and scheduling of production lots have to be decided together with vehicle routing decisions to satisfy the customers. However, such joint decisions make the problems hard to solve for industries with a large product portfolio. This paper proposes an adaptive large neighbourhood search (ALNS) framework to tackle the problem. This metaheuristic is well-known to be effective for vehicle routing problems. The proposed approach relies on mixed-integer linear programming models and tools. The adaptive large neighbourhood search outperforms traditional procedures of the literature, namely exact methods and x-and-optimize, in terms of quality of the solution and computational time of the algorithms. Nine in ten runs of ALNS yielded better solutions than traditional procedures and the best solution value found by the latter methods 12:7% greater than the former, on average.
dc.description.abstractProduction and distribution problems with perishable goods are common in many industries. For the sake of the competitiveness of the companies, the supply chain planning of products with restricted lifespan should be addressed with an integrated approach. Particularly, at the operational level, the sizing and scheduling of production lots have to be decided together with vehicle routing decisions to satisfy the customers. However, such joint decisions make the problems hard to solve for industries with a large product portfolio. This paper proposes an adaptive large neighbourhood search (ALNS) framework to tackle the problem. This metaheuristic is well known to be effective for vehicle routing problems. The proposed approach relies on mixed-integer linear programming models and tools. The ALNS outperforms traditional procedures of the literature, namely, exact methods and fix-and-optimize, in terms of quality of the solution and computational time of the algorithms. Nine in ten runs of ALNS yielded better solutions than traditional procedures, outperforming on average 12.7% over the best solutions provided by the latter methods.
dc.language.isoeng
dc.relationinfo:eu-repo/grantAgreement/Autoridade de Gestão do Programa Operacional Regional do Norte/Programas Integrados de IC&DT/NORTE-07-0124-FEDER-000057/Smart Manufacturing and Logistics/BESTCASE-RL2
dc.rightsopenAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/
dc.subjectCiências Tecnológicas, Ciências da engenharia e tecnologias
dc.subjectTechnological sciences, Engineering and technology
dc.titleAn adaptive large neighbourhood search for the operational integrated production and distribution problem of perishable products
dc.typeArtigo em Revista Científica Internacional
dc.contributor.uportoFaculdade de Engenharia
dc.identifier.doi10.1080/00207543.2015.1010744
dc.identifier.authenticusP-00G-F7D
dc.subject.fosCiências da engenharia e tecnologias
dc.subject.fosEngineering and technology
Aparece nas coleções:FEUP - Artigo em Revista Científica Internacional

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
96780.pdf2.12 MBAdobe PDFThumbnail
Ver/Abrir


Este registo está protegido por Licença Creative Commons Creative Commons