An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays

This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle serves the pickup location, the request is fulfilled by an alternative service (e.g., a taxi) whose cost is added to the total cost of the tour. In this case, the vehicle skips the corresponding delivery location, which yields a reduction in the total tour cost. The aim of the problem is to determine an a priori Hamiltonian tour minimizing the expected cost of the solution. This problem is solved by means of an integer L-shaped algorithm. Computational experiments show that the algorithm yields optimal solutions for small and medium size instances within reasonable CPU times. It is also shown that the actual cost of an optimal solution obtained with this algorithm can be significantly smaller than that of an optimal solution obtained with a deterministic formulation. Key words: dial-a-ride problem, stochasti...

• Type: Journal
• Year: 2011
• Where: DAM
• Authors: Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte
• Keywords: DAM 2011, Dial-a-ride Problem, Integer L-shaped Algorithm, Optimal Solution, Theoretical Computer Science