Determination of robust solutions for the DARP with variations in transportation time | Zendy

Maxime Chassaing | Zendy; Gérard Fleury | Zendy; Christophe Duhamel | Zendy; Philippe Lacomme | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Determination of robust solutions for the DARP with variations in transportation time

Author(s) -

Maxime Chassaing,

Gérard Fleury,

Christophe Duhamel,

Philippe Lacomme

Publication year - 2016

Publication title -

ifac-papersonline

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.308

H-Index - 72

eISSN - 2405-8971

pISSN - 2405-8963

DOI - 10.1016/j.ifacol.2016.07.897

Subject(s) - robustness (evolution) , mathematical optimization , computer science , gaussian , transportation theory , local search (optimization) , evolutionary algorithm , mathematics , biochemistry , chemistry , physics , quantum mechanics , gene

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research