کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5110522 | 1482994 | 2016 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem
ترجمه فارسی عنوان
سه مأموریت موثر برای حل مسئله شماره گیری چند منظوره چند منظوره چند راهه
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
علوم انسانی و اجتماعی
مدیریت، کسب و کار و حسابداری
کسب و کار و مدیریت بین المللی
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 96, December 2016, Pages 60-80
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 96, December 2016, Pages 60-80
نویسندگان
Mohamed Amine Masmoudi, Manar Hosny, Kris Braekers, Abdelaziz Dammak,