Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/112235
Full metadata record
DC FieldValueLanguage
dc.creatorAntónio Silva Fernandes
dc.date.accessioned2025-11-13T14:38:15Z-
dc.date.available2025-11-13T14:38:15Z-
dc.date.issued2016-07-22
dc.date.submitted2016-07-29
dc.identifier.othersigarra:142121
dc.identifier.urihttps://hdl.handle.net/10216/112235-
dc.descriptionAt this point there are already three variants of optimization algorithms, oriented at the Inventory Routing Problem, based on the GRASP metaheuristic capable of solving instances of one vehicle and one product with reasonable GAP and multi products one vehicle with more GAP than desired for most of the instances. The algorithms were developed in c++ and are being compared with a benchmark for the Multi-vehicle Multi-product Inventory Routing Problem. Tests are being made to access computational times affinity with solution improvement. The developed work is within the planned schedule able to consult at http://gnomo.fe.up.pt/~ee10089/SIEM/
dc.language.isopor
dc.rightsopenAccess
dc.subjectEngenharia electrotécnica, electrónica e informática
dc.subjectElectrical engineering, Electronic engineering, Information engineering
dc.titleOptimization Algorithms for the Inventory Routing Problem
dc.typeDissertação
dc.contributor.uportoFaculdade de Engenharia
dc.identifier.doi10.34626/sq00-gh90
dc.identifier.tid201297671
dc.subject.fosCiências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática
dc.subject.fosEngineering and technology::Electrical engineering, Electronic engineering, Information engineering
thesis.degree.disciplineMestrado Integrado em Engenharia Electrotécnica e de Computadores
thesis.degree.grantorFaculdade de Engenharia
thesis.degree.grantorUniversidade do Porto
thesis.degree.level1
Appears in Collections:FEUP - Dissertação

Files in This Item:
File Description SizeFormat 
142121.pdfOptimization Algorithms for the Inventory Routing Problem829.2 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.