Consistent-DARP
1 : Décision et Information pour les Systèmes de Production
(DISP)
-
Website
Institut National des Sciences Appliquées de Lyon
Campus LyonTech La Doua,INSA Lyon Bât Léonard de Vinci, 21 avenue Jean Capelle, 69621 Villeurbanne Cedex -
France
2 : Institut de Recherche en Communications et en Cybernétique de Nantes
(LS2N)
-
Website
* : Corresponding author
École Nationale Supérieure des Mines - Nantes, IMT anlantique
1, rue de la Noë BP92101 44321 Nantes Cedex 03 -
France
We investigate a multi-period Dial-A-Ride Problem in the context of passengers with disabilities. The problem integrates an objective related to cost as well as an objective on the consistency of passengers schedules. This consistency is defined as the number of significantly different pickup times in a one week long planning. The problem is modeled as a route based mathematical model. This set partitioning formulation is combined with a large neighborhood search in an epsilon constraint algorithm. The method is evaluated on a benchmark of the literature and some managerial insights are derived on real instances.