mlsanityData to 14 Oct 2026

Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem

arXiv 2407.20777 ↗First posted 30 Jul 2024cs.AI cs.DMcited by 1

Not on the map. Why?

Abstract (arXiv)

We propose a feature-based guidance mechanism to enhance metaheuristic algorithms for solving the Capacitated Vehicle Routing Problem (CVRP). This mechanism leverages an Explainable AI (XAI) model to identify features that correlate with high-quality solutions. These insights are used to guide the search process by promoting solution diversity and avoiding premature convergence. The guidance mechanism is first integrated into a custom metaheuristic algorithm, which combines neighborhood search with a novel hybrid of the split algorithm and path relinking. Experiments on benchmark instances with up to 30,000 customer nodes demonstrate that the guidance significantly improves the performance of this baseline algorithm. Furthermore, we validate the generalizability of the guidance approach by integrating it into a state-of-the-art metaheuristic, where it again yields statistically significant performance gains. These results confirm that the proposed mechanism is both scalable and transferable across algorithmic frameworks.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 62 references that are in the map. First posted on arXiv 30 Jul 2024.

Builds on

16 of 62 references.

References · 16

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  3. 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,552
  4. 2018A Survey Of Methods For Explaining Black Box Modelscited by 973
  5. 2015Pointer Networkscited by 895
  6. 2018Attention, Learn to Solve Routing Problems!cited by 656
  7. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  8. 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 269
  9. 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
  10. 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 125
  11. 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
  12. 2021Efficient Active Search for Combinatorial Optimization Problemscited by 100
4 more
  1. 2021Deep Policy Dynamic Programming for Vehicle Routing Problemscited by 94
  2. 2023Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Optcited by 81
  3. 2021Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problemscited by 16
  4. 2019PILS: Exploring high-order neighborhoods by pattern mining and injectioncited by 6

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.