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

M. Mourgaya 1 François Vanderbeck 1, 2
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00342627
Contributor : François Vanderbeck <>
Submitted on : Thursday, November 27, 2008 - 6:52:05 PM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM

Links full text

Identifiers

Citation

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, EDP Sciences, 2006, 40, pp.169-194. ⟨10.1051/ro:2006015⟩. ⟨inria-00342627⟩

Share

Metrics

Record views

291