Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/53170
Título: | Exact solution of the multi-trip inventory routing problem using a pseudo-polynomial model |
Autor(es): | Braga, Nuno Alves, Cláudio Macedo, Rita |
Palavras-chave: | Inventory Routing Problem Integer Linear Programing Network Flow Models Multi-trip |
Data: | 2017 |
Editora: | SCITEPRESS |
Resumo(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. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/53170 |
ISBN: | 9789897582189 |
DOI: | 10.5220/0006118502500257 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Exact solution of the multi-trip irp using a pseudo-pol. model.pdf Acesso restrito! | 200,86 kB | Adobe PDF | Ver/Abrir |