Graph Reinforcement Learning for Operator Selection in the ALNS Metaheuristic
Not on the map. Why?
Abstract (arXiv)
ALNS is a popular metaheuristic with renowned efficiency in solving combinatorial optimisation problems. However, despite 16 years of intensive research into ALNS, whether the embedded adaptive layer can efficiently select operators to improve the incumbent remains an open question. In this work, we formulate the choice of operators as a Markov Decision Process, and propose a practical approach based on Deep Reinforcement Learning and Graph Neural Networks. The results show that our proposed method achieves better performance than the classic ALNS adaptive layer due to the choice of operator being conditioned on the current solution. We also discuss important considerations such as the size of the operator portfolio and the impact of the choice of operator scales. Notably, our approach can also save significant time and labour costs for handcrafting problem-specific operator portfolios.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 8 of its 27 references that are in the map. First posted on arXiv 28 Feb 2023.
Builds on
8 of 27 references.
References · 8
- 2017Graph Attention Networkscited by 8,854
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
- 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
- 2021Analytics and Machine Learning in Vehicle Routing Researchcited by 22
- 2022Large Neighborhood Search based on Neural Construction Heuristicscited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.