A New Exact Algorithm to Solve the Multi-Trip Vehicle Routing Problem with Time Windows and Limited Duration - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Accéder directement au contenu
Rapport Année : 2011

A New Exact Algorithm to Solve the Multi-Trip Vehicle Routing Problem with Time Windows and Limited Duration

Résumé

This article tackles the multi-trip vehicule routing problem with time windows and limited duration. A trip is a timed route such that a succession of trips can be assigned to one vehicle. We provide a two-phase exact algorithm to solve it. The first phase enumerates possible ordered lists of client matching trip maximum duration criterion. The second phase uses a Branch and Price scheme to generate and choose best set of trips to visit all customers. We propose a set covering formulation as the column generation master problem, where columns (variables) represent trips. The sub-problem selects appropriate timing for trips and has a pseudo-polynomial complexity. Computional results on Solomon's benchmarks are presented. The computional times obtained with our new algorithm are much lower than the ones obtained in the sole exact algorithm previously published on this problem.
Fichier principal
Vignette du fichier
LimitedHernandez2011WorkingPaperAbstract.pdf (59.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

lirmm-00616667 , version 1 (23-08-2011)
lirmm-00616667 , version 2 (04-05-2012)

Identifiants

  • HAL Id : lirmm-00616667 , version 2

Citer

Rodolphe Giroudeau, Oliver Naud, Florent Hernandez, Dominique Feillet. A New Exact Algorithm to Solve the Multi-Trip Vehicle Routing Problem with Time Windows and Limited Duration. RR-11023, 2011. ⟨lirmm-00616667v2⟩
312 Consultations
1119 Téléchargements

Partager

Gmail Facebook X LinkedIn More