Dial-a-ride problem for disabled people using vehicles with reconfigurable capacity

Oscar Tellez (1) , Samuel Vercraene Vercraene (1) , Fabien Lehuédé (2, 3) , Olivier Péton (2, 3) , Thibaud Monteiro (1)

1 DISP - Décision et Information pour les Systèmes de Production
2 IMT Atlantique - DAPI - Département Automatique, Productique et Informatique
3 LS2N - équipe SLP - Systèmes Logistiques et de Production

The aim of this paper is to address the dial-a-ride problem with heterogeneous users in which the vehicle capacity can be modified en-route by reconfiguring its internal layout. The work is motivated by the daily transport of children with disabilities performed by a private company based in Lyon Métropole, France. Every day, a fleet of configurable vehicles is available to transport children to medico-social establishments. The objective of this work is then to help route planners with the fleet dimensioning and take reconfiguration opportunities into consideration in the design of routes. Due to the number of passengers and vehicles, real-size instances are intractable for mix-integer programing solvers and exact solution methods. Thus, a large neighborhood search meta-heuristic combined with a set covering component is proposed. The resulting framework is evaluated on real life instances from the transport company.

Mots clés: dial-a-ride problem; large neighborhood search meta heuristic; set covering problem; Transportation logistics; optimization

Domaines: Recherche opérationnelle [math.OC]

Oscar Tellez, Samuel Vercraene Vercraene, Fabien Lehuédé, Olivier Péton, Thibaud Monteiro. Dial-a-ride problem for disabled people using vehicles with reconfigurable capacity. 20th IFAC World Congress of the International Federation of Automatic Control (IFAC 2017), Jul 2017, Toulouse, France. ⟨hal-01760353⟩