Anticipation in the Dial-a-Ride Problem: an introduction to the robustness

Samuel Deleplanque (1) , Jean-Pierre Derutin (2) , Alain Quilliot (1)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
2 LASMEA - Laboratoire des sciences et matériaux pour l'électronique et d'automatique

The Dial-a-Ride Problem (DARP) models an operation research problem related to the on demand transport. This paper introduces one of the fundamental features of this type of transport: the robustness. This paper solves the Dial-a-Ride Problem by integrating a measure of insertion capacity called Insertability. The technique used is a greedy insertion algorithm based on time constraint propagation (time windows, maximum ride time and maximum route time). In the present work, we integrate a new way to measure the impact of each insertion on the other not inserted demands. We propose its calculation, study its behavior, discuss the transition to dynamic context and present a way to make the system more robust.

Mots clés: Dial-a-Ride; Dynamic Context; Robustness; greedy algorithms; transportation; time windows; Insertability

Domaines: Algorithme et structure de données [cs.DS]; Recherche opérationnelle [math.OC]

Samuel Deleplanque, Jean-Pierre Derutin, Alain Quilliot. Anticipation in the Dial-a-Ride Problem: an introduction to the robustness. FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS - WCO, Sep 2013, Kraków, Poland. pp.299 - 305. ⟨hal-00918302⟩