The Dial-A-Ride Problem with School Bell time Adjustment

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

1 DISP - Décision et Information pour les Systèmes de Production
2 INSA Lyon - Institut National des Sciences Appliquées de Lyon
3 IMT Atlantique - DAPI - Département Automatique, Productique et Informatique
4 LS2N - équipe SLP - Systèmes Logistiques et de Production

In this paper, we study a paratransit application in which children are transported every day from their homes to their schools or medical-social establishments. To optimize this transportation system, the establishments collaborate to propose a joint transportation plan. We propose a new algorithm to jointly build vehicle routes that visit several establishments and simultaneously set the establishments' opening hours. This algorithm combines a large neighborhood search, the resolution of a route-based model and the progressive shrinkage of the planning window. It is applied to a real case from the area of Lyon in France, including 34 schools and 575 heterogeneous users served by a heterogeneous fleet of reconfigurable vehicles. On average, we show that in addition to the 10% of saving that can be expected by sharing vehicle routes between schools, 7% of additional savings can be achieved by school bell adjustment. This cost saving also decreases user ride times and the number of vehicles required, creating longer routes which are more attractive for driver services.

Mots clés: vehicle routing; dial-a-ride problem; healthcare logistics; school bell time adjustment; large neighborhood search

Domaines: Recherche opérationnelle [math.OC]

Samuel Vercraene Vercraene, Fabien Lehuédé, Thibaud Monteiro, Olivier Péton. The Dial-A-Ride Problem with School Bell time Adjustment. 2021. ⟨hal-03327511⟩