Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/22528
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Masmoudi, Mohamed Amine | - |
dc.contributor.author | Hosny, Manar | - |
dc.contributor.author | BRAEKERS, Kris | - |
dc.contributor.author | Dammak, Abdelaziz | - |
dc.date.accessioned | 2016-10-28T12:37:53Z | - |
dc.date.available | 2016-10-28T12:37:53Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 96, p. 60-80 | - |
dc.identifier.issn | 1366-5545 | - |
dc.identifier.uri | http://hdl.handle.net/1942/22528 | - |
dc.description.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. | - |
dc.description.sponsorship | This work is partly supported by the University of Sfax and by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office (research project COMEX, Combinatorial Optimization: Metaheuristics & Exact Methods). The authors would like to thank Professor Jiuh-Biing Sheu and the three anonymous referees for their valuable comments. | - |
dc.language.iso | en | - |
dc.rights | © 2016 Elsevier Ltd. All rights reserved. | - |
dc.subject.other | Vehicle Routing Problem (VRP); Dial-a-Ride Problem (DARP); metaheuristic; optimization; Bees Algorithm (BA) | - |
dc.title | Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 80 | - |
dc.identifier.spage | 60 | - |
dc.identifier.volume | 96 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.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 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1016/j.tre.2016.10.002 | - |
dc.identifier.isi | 000389091900004 | - |
item.fullcitation | Masmoudi, Mohamed Amine; Hosny, Manar; BRAEKERS, Kris & Dammak, Abdelaziz (2016) Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem. In: TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 96, p. 60-80. | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2017 | - |
item.contributor | Masmoudi, Mohamed Amine | - |
item.contributor | Hosny, Manar | - |
item.contributor | BRAEKERS, Kris | - |
item.contributor | Dammak, Abdelaziz | - |
item.accessRights | Open Access | - |
crisitem.journal.issn | 1366-5545 | - |
crisitem.journal.eissn | 1878-5794 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MD-MT-HDARP 09-10.pdf | Peer-reviewed author version | 724.29 kB | Adobe PDF | View/Open |
1-s2.0-S1366554516304070-main.pdf Restricted Access | Published version | 922.37 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
17
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
60
checked on Sep 21, 2024
Page view(s)
72
checked on Sep 7, 2022
Download(s)
322
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.