Comparison Analysis of Recent Metaheuristics Applied for Solving CVRP in Supply Chain Optimization

Abstract

The Capacitated Vehicle Routing Problem plays an important role in supply chain management and logistics, and its optimization helps optimize the logistics of all companies and increase their profits. Since it is difficult to solve, researchers have used several methods to achieve or approach the optimal solution, including exact methods, heuristics, and metaheuristics. The purpose of this article is to investigate the most used techniques, which are metaheuristics, compared to others, and to compare recently implemented algorithms for CVRP. This comparison is based on the collection of algorithm results and the calculation of the Gap for each instance, which can indicate how the solving methods are to the optimal solution. Knowing the most performant metaheuristic in CVRP will empower us to use it in solving other combinatorial problems and to get an idea of how it is designed in comparison with others for performing other powerful metaheuristics.