Machine Learning and Automated Algorithm Design for Optimisation
Designing a good optimisation algorithm usually takes experts years of trial and error, and the result rarely transfers to new problems. My research uses machine learning to automate this: learning which search operator to apply, where to search, how to start, and ultimately generating whole algorithms automatically.
Introduction
Learning inside the optimiser
Every metaheuristic is built from components — how to initialise, which operator to apply, which neighbourhood to search, when to accept a move. Each is a decision that machine learning can make better than a fixed hand-designed choice, by learning from experience on many problem instances.
Two complementary learners
Deep and reinforcement learning learn flexible policies from data, while genetic programming learns compact, interpretable components. We study both and how they combine.
My Contributions
With my students and collaborators, I have made the following contributions. The papers shown are selected automatically: award-winning papers, papers with 100+ citations, and papers in top venues. Click a title to read the paper, or list entry to see it in my publication list.
1 Adaptive operator selection
Which operator works best changes during the search and across instances. We learn operator selectors from both offline and online experience, and surveyed the field.
- Learning from Offline and Online Experiences: A Hybrid Adaptive Operator Selection FrameworkACM Genetic and Evolutionary Computation Conference (GECCO), 2024 · list entry L4EC Track Best Paper Nomination, GECCO 2024
- Adaptive Operator Selection for Meta-Heuristics: A SurveyIEEE Transactions on Artificial Intelligence, 2025 · list entry Survey
- Learning Adaptive Neighborhood Search with Dual Operator Selection for Capacitated Vehicle Routing ProblemACM Genetic and Evolutionary Computation Conference (GECCO), 2025 · list entry
- Local Optima Correlation Assisted Adaptive Operator SelectionACM Genetic and Evolutionary Computation Conference (GECCO), 2023 · list entry
2 Learning-guided and neural search for routing
We combine neural networks with neighbourhood search and design neural solvers that generalise better across problem sizes and variants.
- MODE: Manifold Operator Decoding Embeddings for Neural Neighborhood Search for Vehicle Routing ProblemsACM Genetic and Evolutionary Computation Conference (GECCO), 2026 · list entry
- A Neural Solver with Traversal-based Feature Representation and Adjacent Attention for Capacitated Arc Routing ProblemIEEE Transactions on Intelligent Transportation Systems, 2025 · list entry
- Distance-aware Attention Reshaping for Enhancing Generalization of Neural SolversIEEE Transactions on Neural Networks and Learning Systems, 2025 · list entry
- Learning-aided Neighborhood Search for Vehicle Routing ProblemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2025 · list entry
- Emergency Scheduling of Aerial Vehicles via Graph Neural Neighborhood SearchIEEE Transactions on Artificial Intelligence, 2025 · list entry
- Learning Adaptive Neighborhood Search with Dual Operator Selection for Capacitated Vehicle Routing ProblemACM Genetic and Evolutionary Computation Conference (GECCO), 2025 · list entry
3 Automated design of algorithm components
GP and learning can design the components of other algorithms: initialisation heuristics, guided local search penalties, and ant colony state transition rules.
- Adaptive Curriculum Learning in Genetic Programming–Guided Local Search for Large-Scale Vehicle Routing ProblemsInternational Conference on the Applications of Evolutionary Computation (EvoApps), 2026 · list entry Best Student Paper Award, EvoApps 2026
- LiBOG: Lifelong Learning for Black-Box Optimizer GenerationInternational Joint Conference on Artificial Intelligence (IJCAI), 2025 · list entry
- GPGLS: Genetic Programming Guided Local Search for Large-Scale Vehicle Routing ProblemsInternational Conference on Parallel Problem Solving from Nature (PPSN), 2024 · list entry
- Learning to Select Initialisation Heuristic for Vehicle Routing ProblemsACM Genetic and Evolutionary Computation Conference (GECCO), 2023 · list entry
- Guided Local Search with an Adaptive Neighbourhood Size Heuristic for Large Scale Vehicle Routing ProblemsACM Genetic and Evolutionary Computation Conference (GECCO), 2022 · list entry
- A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching RulesEvolutionary Computation, 2019 · list entry
4 Combining evolutionary computation and reinforcement learning
We compare and hybridise GP and deep reinforcement learning for sequential decisions, and embed reinforcement learning inside evolutionary search.
- Genetic Programming and Reinforcement Learning on Learning Heuristics for Dynamic Scheduling: A Preliminary ComparisonIEEE Computational Intelligence Magazine, 2024 · list entry CIM Outstanding Paper Award CIS Newsletter Research Frontier, IEEE CIM 2024
- Q-Learning Enhanced Multi-objective Evolutionary Algorithm with Diverse Search for Airport Ground Movement OptimizationIEEE Transactions on Evolutionary Computation, 2026 · list entry
- Niching Genetic Programming to Learn Actions for Deep Reinforcement Learning in Dynamic Flexible SchedulingIEEE Transactions on Evolutionary Computation, 2026 · list entry
- Learn to Optimise for Job Shop Scheduling: A Survey with Comparison between Genetic Programming and Reinforcement LearningArtificial Intelligence Review, 2025 · list entry Survey
