Afficher la notice abrégée

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorMOURGAYA, M.
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorVANDERBECK, François
dc.date.accessioned2024-04-04T02:44:11Z
dc.date.available2024-04-04T02:44:11Z
dc.date.issued2006
dc.identifier.issn0399-0559
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191387
dc.description.abstractEnThe 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.
dc.language.isofr
dc.publisherEDP Sciences
dc.titlePeriodic Vehicle Routing Problem: classification and heuristic -- Problème de tournées de véhicules multipériodiques : classification et heuristique pour la planification tactique
dc.typeArticle de revue
dc.identifier.doi10.1051/ro:2006015
bordeaux.journalRAIRO - Operations Research
bordeaux.page169-194
bordeaux.volume40
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierinria-00342627
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00342627v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.title=Periodic%20Vehicle%20Routing%20Problem:%20classification%20and%20heuristic%20--%20Probl%C3%A8me%20de%20tourn%C3%A9es%20de%20v%C3%A9hicules%20multip%C3%A9riodiques%20:%20c&rft.atitle=Periodic%20Vehicle%20Routing%20Problem:%20classification%20and%20heuristic%20--%20Probl%C3%A8me%20de%20tourn%C3%A9es%20de%20v%C3%A9hicules%20multip%C3%A9riodiques%20:%20&rft.jtitle=RAIRO%20-%20Operations%20Research&rft.date=2006&rft.volume=40&rft.spage=169-194&rft.epage=169-194&rft.eissn=0399-0559&rft.issn=0399-0559&rft.au=MOURGAYA,%20M.&VANDERBECK,%20Fran%C3%A7ois&rft.genre=article


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée