Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/15196
Título: | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
Autor(es): | Macedo, Rita Alves, Cláudio Carvalho, J. M. Valério de Clautiaux, François Hanafi, Said |
Palavras-chave: | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
Data: | 2011 |
Editora: | Elsevier Science BV |
Revista: | European Journal of Operational Research |
Resumo(s): | In this paper, we address a variant of the vehicle routing problem called the vehicle routing problem with time windows and multiple routes. It considers that a given vehicle can be assigned to more than one route per planning period. We propose a new exact algorithm for this problem. Our algorithm is iterative and it relies on a pseudo-polynomial network flow model whose nodes represent time instants, and whose arcs represent feasible vehicle routes. This algorithm was tested on a set of benchmark instances from the literature. The computational results show that our method is able to solve more instances than the only other exact method described so far in the literature, and it clearly outperforms this method in terms of computing time. |
Tipo: | Artigo |
URI: | https://hdl.handle.net/1822/15196 |
DOI: | 10.1016/j.ejor.2011.04.037 |
ISSN: | 0377-2217 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals LES/ALG - Artigos em revistas científicas internacionais com arbitragem |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
MVRPTW.pdf Acesso restrito! | 662,4 kB | Adobe PDF | Ver/Abrir |