Document Server@UHasselt >
Research publications >
Please use this identifier to cite or link to this item:
|Title: ||A hybrid genetic algorithm for the heterogeneous dial-a-ride problem|
|Authors: ||Masmoudi, Mohamed Amine|
|Issue Date: ||2017|
|Citation: ||Computers & operations research, 81, p. 1-13|
|Abstract: ||This paper investigates the Heterogeneous Dial-A-Ride Problem (H-DARP) that consists of determining a vehicle route planning for heterogeneous users’ transportation with a heterogeneous fleet of vehicles. A hybrid Genetic Algorithm (GA) is proposed to solve the problem. Efficient construction heuristics, crossover operators and local search techniques, specifically tailored to the characteristics of the H-DARP, are provided. The proposed algorithm is tested on 92 benchmarks instances and 40 newly introduced larger instances. Computational experiments show the effectiveness of our approach compared to the current state-of-the-art algorithms for the DARP and H-DARP. When tested on the existing instances, we achieved average gaps of only 0.47% to the bestknown solutions for the DARP, and 0.05% to the optimal solutions for the H-DARP, compared to 0.85% and 0.10%, respectively, obtained by the current state-of-the-art algorithms. For the 40 newly generated instances, average gaps of the hybrid GA are 0.35% smaller compared to the current stateof-the-art method. Besides, our method provides best results for 31 of these instances and ties with the existing method on 8 other instances.|
|Notes: ||Masmoudi, MA (reprint author), Univ Sfax, Fac Econ & Management Sci, Lab Modeling & Optimizat Decis Ind & Logist Syst, Airport St,Km 4,POB 1088, Sfax 3018, Tunisia.
|ISI #: ||000394079400001|
|Type: ||Journal Contribution|
|Appears in Collections: ||Research publications|
Files in This Item:
|Published version||896.24 kB||Adobe PDF|
|Peer-reviewed author version - Main article (postprint)||1.29 MB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.