Problème de tournées de véhicules multipériodiques : classification et heuristique pour la planification tactiqueThe periodic Vehicle routing problem: classification and heuristic

Issue		RAIRO Oper. Res. Volume 40, Number 2, April-June 2006 ROADEF 03


Page(s)		169 - 194
DOI		10.1051/ro:2006015
Published online		12 October 2006

RAIRO Oper. Res. 40 (2006) 169-194
DOI: 10.1051/ro:2006015

Problème de tournées de véhicules multipériodiques : classification et heuristique pour la planification tactique

M. Mourgaya and F. Vanderbeck

Laboratoire de Mathématiques Appliquées de Bordeaux (MAB), Université Bordeaux 1, 33405 Talence Cedex, France;

(Reçu le 31 Decembre 2005 Published online 12 October 2006.)

Abstract
Periodic Vehicle Routing Problem: classification and heuristic for tactical planning. 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.

Résumé
Le problème de tournées de véhicules multipériodiques con-siste à planifier des visites clients sur un horizon de temps donné en les affectant à des tournées de véhicules. Les fréquences de visites ou espacements entre elles sont prescrits. Ces contraintes peuvent prendre la forme de scénarios de visites admissibles. Nous étudions les différentes variantes de ce problème et proposons une classification. Nous nous restreignons ensuite aux décisions tactiques et présentons un algorithme heuristique pour la planification des visites qui optimise la répartition de la charge et la régionalisation des tournées (qu'on désire spécialisées

What is OpenURL?

The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.

If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.