Solving the vehicle routing problem with time windows and multiple routes using a pseudo-polynomial model - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2011

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

Résumé

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.

Dates et versions

hal-00616366 , version 1 (22-08-2011)

Identifiants

Citer

Rita Macedo, Claudio Alves, José Manuel Valério de Carvalho, François Clautiaux, Said Hanafi. Solving the vehicle routing problem with time windows and multiple routes using a pseudo-polynomial model. European Journal of Operational Research, 2011, 214 (3), pp.536-545. ⟨10.1016/j.ejor.2011.04.037⟩. ⟨hal-00616366⟩
221 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More