A new consistent vehicle routing problem for the transportation of people with disabilities - Archive ouverte HAL
Journal Articles Networks Year : 2014

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

Abstract

In this paper 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 multi-day 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 vehicle routing problem 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.
Fichier principal
Vignette du fichier
feillet_newconsistent_networks_14.pdf (337.92 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01904440 , version 1 (24-10-2018)

Identifiers

Cite

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, 2014, 63 (3), pp.211-224. ⟨10.1002/net.21538⟩. ⟨hal-01904440⟩
355 View
315 Download

Altmetric

Share

More