An Ameliorative Hybrid Algorithm for Solving the Capacitated Vehicle Routing Problem

Ali Asghar Rahmani Hosseinabadi; Adam Slowik; Mehdi Sadeghilalimi; Mohammad Farokhzad; Morteza Babazadeh shareh; Arun Kumar Sangaiah

doi:10.1109/ACCESS.2019.2957722

IEEE Access (Jan 2019)

An Ameliorative Hybrid Algorithm for Solving the Capacitated Vehicle Routing Problem

Ali Asghar Rahmani Hosseinabadi,
Adam Slowik,
Mehdi Sadeghilalimi,
Mohammad Farokhzad,
Morteza Babazadeh shareh,
Arun Kumar Sangaiah

Affiliations

Ali Asghar Rahmani Hosseinabadi: ORCiD; Young Researchers and Elite Club, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran
Adam Slowik: ORCiD; Department of Electronics and Computer Science, Koszalin University of Technology, Koszalin, Poland
Mehdi Sadeghilalimi: ORCiD; Department of IT and Computer Engineering, Qazvin Branch, Qazvin Islamic Azad University, Qazvin, Iran
Mohammad Farokhzad: ORCiD; Department of Electronics, Iran University of Science and Technology, Tehran, Iran
Morteza Babazadeh shareh: ORCiD; Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran
Arun Kumar Sangaiah: ORCiD; School of Computing Science and Engineering, Vellore Institute of Technology (VIT), Vellore, India

DOI: https://doi.org/10.1109/ACCESS.2019.2957722
Journal volume & issue: Vol. 7
pp. 175454 – 175465

Abstract

Read online

One of the most applicable versions of the Vehicle Routing Problem (VRP) which has been widely studied in logistic services is Capacitated Vehicle Routing Problem (CVRP). There are many algorithms to solve the CVRP to minimize total travelled distance. Some of the most recent and efficient metaheuristic algorithms are capable of generating solutions within 0.5% to 1% gap from the optimum for instance problems adopted from the literature considering hundreds or thousands of demand points. In this contribution, a novel hybrid algorithm is proposed based on Gravitational Emulation Local Search (GELS) and Genetic Algorithm (GA). This algorithm alleviates the weaknesses of the GELS algorithm. The performance of the proposed algorithm, which is called GELSGA, is compared with other meta-heuristics. The obtained results show that the proposed algorithm can compete vigorously with them. In addition, the proposed algorithm could obtain solutions close to the Best Known Solutions (BKS) for many instance problems.

Published in IEEE Access

ISSN: 2169-3536 (Online)
Publisher: IEEE
Country of publisher: United States
LCC subjects: Technology: Electrical engineering. Electronics. Nuclear engineering
Website: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639

About the journal

Abstract

Keywords