Insertion techniques and constraint propagation for the DARP

This paper deals with the Dial and Ride Problem (DARP), while using randomized greedy insertion techniques together with constraint propagation techniques. Though it focuses here on the static version of Dial and Ride, it takes into account the fact that practical DARP has to be handled according to a dynamical point of view, and even, in some case, in real time contexts. So, the kind of algorithmic solution which is proposed here, aim at making easier to bridge both points of view. The model is a classical one, and considers a performance criterion which is a mix between Quality of Service (QoS) and economical cost. We first propose the general framework of the model and discuss the link with dynamical DARP, next describe the algorithm and end with numerical experiments.