Idioma:

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

Macedo, Rita ; Alves, Cláudio ; Valério de Carvalho, J.M. ; Clautiaux, François ; Hanafi, Saïd

European journal of operational research, 2011-11, Vol.214 (3), p.536-545 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por

Enviar para

Título:
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
Autor: Macedo, Rita ; Alves, Cláudio ; Valério de Carvalho, J.M. ; Clautiaux, François ; Hanafi, Saïd
Assuntos: Algorithms ; Applied sciences ; Benchmarking ; Combinatorial optimization ; Computational efficiency ; Computer networks ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Integer programming ; Integer programming Combinatorial optimization Routing Network flows ; Logistics ; Mathematical models ; Mathematical programming ; Network flow problem ; Network flows ; Operational research and scientific management ; Operational research. Management science ; Polynomials ; Route optimization ; Routing ; Routing (telecommunications) ; Studies ; Vehicles ; Windows (intervals)
É parte de: European journal of operational research, 2011-11, Vol.214 (3), p.536-545
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: ► We propose a new model for a vehicle routing problem with multiple trips. ► The problem applies for example to the delivery of perishable goods. ► We describe an iterative algorithm that solves exactly this model. ► The algorithm outperforms previous state-of-the-art algorithms. 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.
Editor: Amsterdam: Elsevier B.V
Idioma: Inglês

Links

Voltar para lista de resultados

Anterior Resultado 9 Avançar Ir para próxima página

Realização: Logos de Redes Sociais:

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

Macedo, Rita ; Alves, Cláudio ; Valério de Carvalho, J.M. ; Clautiaux, François ; Hanafi, Saïd

Amsterdam: Elsevier B.V

Buscando em bases de dados remotas. Favor aguardar.