Periodic Vehicle Routing Problem: classification and heuristic -- Problème de tournées de véhicules multipériodiques : classification et heuristique pour la planification tactique - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles RAIRO - Operations Research Year : 2006

Periodic Vehicle Routing Problem: classification and heuristic -- Problème de tournées de véhicules multipériodiques : classification et heuristique pour la planification tactique

Abstract

The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take the form of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical planning for which we propose a heuristic: we optimise the planning of customer visits to achieve both workload balancing and regionalisation of the routes. The objective of regionalisation reflects a desire to specialize routes to restricted geographical area. The standard minimisation of distance travelled is left for the underlying operational decision making model. Our heuristic achieves practical solutions for an industrial instance with 16658 visits to schedule over a horizon of 20 days.

Dates and versions

inria-00342627 , version 1 (27-11-2008)

Identifiers

Cite

M. Mourgaya, François Vanderbeck. Periodic Vehicle Routing Problem: classification and heuristic -- Problème de tournées de véhicules multipériodiques : classification et heuristique pour la planification tactique. RAIRO - Operations Research, 2006, 40, pp.169-194. ⟨10.1051/ro:2006015⟩. ⟨inria-00342627⟩

Collections

CNRS INRIA INRIA2
213 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More