A new consistent vehicle routing problem for the transportation of people with disabilities

Abstract : n this article, we address a problem of the transportation of people with disabilities where customers are served on an almost daily basis and expect some consistency in the service. We introduce an original model for the time-consistency of the service, based on so-called time-classes. We then define a new multiday vehicle routing problem (VRP) that we call the Time-Consistent VRP. We address the solution of this new problem with a large neighborhood search heuristic. Each iteration of the heuristic requires solving a complex VRP with multiple time windows and no waiting time which we tackle with a heuristic branch-and-price method. Computational tests are conducted on benchmark sets and modified real-life instances. Results demonstrate the efficiency of the method and highlight the impact of time-consistency on travel costs. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(3), 211-224 2014
Type de document :
Article dans une revue
Networks, Wiley, 2014, 63 (3), pp.211-224. 〈10.1002/net.21538〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01016278
Contributeur : Dominique Quadri <>
Soumis le : dimanche 29 juin 2014 - 18:00:40
Dernière modification le : lundi 16 juillet 2018 - 10:09:41

Lien texte intégral

Identifiants

Citation

Dominique Feillet, Thierry Garaix, Fabien Lehuédé, Olivier Péton, Dominique Quadri. A new consistent vehicle routing problem for the transportation of people with disabilities. Networks, Wiley, 2014, 63 (3), pp.211-224. 〈10.1002/net.21538〉. 〈hal-01016278〉

Partager

Métriques

Consultations de la notice

497