Please use this identifier to cite or link to this item:

TitleExact solution of the multi-trip inventory routing problem using a pseudo-polynomial model
Author(s)Braga, Nuno
Alves, Cláudio
Macedo, Rita
KeywordsInventory Routing Problem
Integer Linear Programing
Network Flow Models
Issue date2017
Abstract(s)In this paper, we address an inventory routing problem where a vehicle can perform more than one trip in a working day. This problem was denominated multi-trip vehicle routing problem. In this problem a set of customers with demand for the planning horizon must be satisfied by a supplier. The supplier, with a set of vehicles, delivers the demand using pre-calculated valid routes that define the schedule of the delivery of goods on the planning horizon. The problem is solved with a pseudo-polynomial network flow model that is solved exactly in a set of instances adapted from the literature. An extensive set of computational experiments on these instances were conducted varying a set of parameters of the model. The results obtained with this model show that it is possible to solve instances up to 50 customers and with 15 periods in a reasonable computational time.
TypeConference paper
AccessRestricted access (UMinho)
Appears in Collections:CAlg - Artigos em livros de atas/Papers in proceedings

Files in This Item:
File Description SizeFormat 
Exact solution of the multi-trip irp using a pseudo-pol. model.pdf
  Restricted access
200,86 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID