www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/22528

Title: Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem
Authors: Masmoudi, Mohamed Amine
Hosny, Manar
Braekers, Kris
Dammak, Abdelaziz
Issue Date: 2016
Citation: TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 96, p. 60-80
Abstract: The Heterogeneous Dial-a-Ride Problem (HDARP) is an important problem in reduced mobility transportation. Recently, several extensions have been proposed towards more realistic applications of the problem. In this paper, a new variant called the Multi-Depot Multi-Trip Heterogeneous Dial-a-Ride Problem (MD-MT-HDARP) is considered. A mathematical programming formulation and three metaheuristics are proposed: an improved Adaptive Large Neighborhood Search (ALNS), Hybrid Bees Algorithm with Simulated Annealing (BA-SA), and Hybrid Bees Algorithm with Deterministic Annealing (BA-DA). Extensive experiments show the effectiveness of the proposed algorithms for solving the underlying problem. In addition, they are competitive to the current state-of-the-art algorithm on the MD-HDARP.
Notes: Masmoudi, MA (reprint author), Univ Sfax, Lab Modeling & Optimizat Decis Ind & Logist Syst, Fac Econ & Management Sci, Sfax, Tunisia. masmoudi_aminero@hotmail.fr; mifawzi@ksu.edu.sa; kris.braekers@uhasselt.be; abdelaziz.dammak@fsegs.rnu.tn
URI: http://hdl.handle.net/1942/22528
DOI: 10.1016/j.tre.2016.10.002
ISI #: 000389091900004
ISSN: 1366-5545
Category: A1
Type: Journal Contribution
Validation: ecoom, 2017
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Peer-reviewed author version - Main article (post-print)724.29 kBAdobe PDF
Published version922.37 kBAdobe PDF

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