Answers are grounded in this paper and cite their sources.
Combinatorial optimization problems are prevalent in various domains, such as logistics, planning, and resource allocation. This study is essential to fields such as applied mathematics and computer science. A prominent example is the Capacitated Vehicle Routing Problem (CVRP), which aims to minimize the route costs for a fleet of vehicles with capacity constraints. Traditionally, this problem has been tackled using exact methods and metaheuristics, but advancements in hybrid algorithms, modern metaheuristics, and machine learning have significantly improved both the solution quality and computational efficiency. This review followed Kitchenham's methodological guidelines, selecting and analyzing articles published between 2019 and 2024 from the Scopus and Web of Science databases. Specific inclusion and quality assessment criteria were applied, synthesizing the information quantitatively and qualitatively and categorizing studies based on their approaches and techniques. The studies were grouped by their focus, addressing research questions on advancements in machine-learning techniques for enhancing metaheuristics, datasets used, and comparison metrics. The findings emphasize the potential of hybrid approaches that combine metaheuristics with machine learning techniques to effectively solve the CVRP. These approaches have demonstrated their ability to improve efficiency and solution quality, which is particularly relevant for large-scale, complex problems. Significant improvements in solution accuracy and considerable reductions in computation times were observed.
No takes yet. Share an insight, caveat, or question.
Maca-Chagüendo et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: