Publicação

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model

Ver documento

Detalhes bibliográficos
Resumo: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.
Autores principais:Macedo, Rita
Outros Autores:Alves, Cláudio; Carvalho, J. M. Valério de; Clautiaux, François; Hanafi, Said
Assunto:Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows
Ano:2011
País:Portugal
Tipo de documento:artigo
Tipo de acesso:acesso restrito
Instituição associada:Universidade do Minho
Idioma:inglês
Origem:RepositóriUM - Universidade do Minho

Registos relacionados

Registos relacionados