Please use this identifier to cite or link to this item:
Title: Metaheuristic approach for the heterogeneous dial-a-ride problem with multiple depots
Authors: BRAEKERS, Kris 
Issue Date: 2013
Source: EURO - 26th European Conference on Operational Research, Rome, Italy, 1-4/07/2013
Abstract: In this paper a metaheuristic approach for the dial-a-ride problem with heterogeneous users and vehicles (HDARP) is proposed. Several local search operators are embedded in an adaptive threshold accepting framework. Results on several sets of benchmark instances show that our algorithm is competitive with or outperforms current state-of-the-art methods. Finally, a multiple depot version of the HDARP is introduced. This extension allows to investigate possible advantages of creating depots nearby clusters of users or advantages of cooperation among several dial-a-ride service providers.
Keywords: Transportation; Metaheuristics; Dial-a-ride problems; Vehicle routing
Document URI:
Category: C2
Type: Conference Material
Appears in Collections:Research publications

Show full item record

Page view(s)

checked on May 20, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.