Determination of robust solutions for the DARP with variations in transportation time. Issue 12 (2016)

• Record Type: Journal Article
• Authors: Chassaing, M.; Fleury, G.; Duhamel, C.; Lacomme, P.
• Is Part Of: IFAC-PapersOnLine. Volume 49:Issue 12(2016)
• Page Start: 943
• Page End: 948
• Publication Date: 2016
• Subjects: dial-a-ride -- transport -- stochastic travel time -- metaheuristic; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2016.07.897
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: The aim of this paper is to address the Dial-A-Ride Problem with stochastic transportation time between nodes. These transportation times are modeled by a Gaussian distribution. We propose a framework based on an Evolutionary Local Search to find robust solutions which can withstand variations due to the stochasticity. Our method uses a law approach to solve this problem and a simulation part to support the results. The robustness of the best known solutions published for the Deterministic Dial-a-Ride Problem on instances proposed by (Cordeau and Laporte, 2003) is first analyzed. Computational results from the Evolutionary Local Search on the Stochastic Dial-a-Ride Problem are then presented.