Please use this identifier to cite or link to this item:
Author(s): António Silva Fernandes
Title: Optimization Algorithms for the Inventory Routing Problem
Issue Date: 2016-07-22
Description: At 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
Subject: Engenharia electrotécnica, electrónica e informática
Electrical engineering, Electronic engineering, Information engineering
Scientific areas: Ciências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática
Engineering and technology::Electrical engineering, Electronic engineering, Information engineering
TID identifier: 201297671
Document Type: Dissertação
Rights: openAccess
Appears in Collections:FEUP - Dissertação

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

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