Memory-Enhanced Neural Solvers for Routing Problems
Felix Chalumeau, Refiloe Shabe, Noah De Nicola, Arnu Pretorius, Thomas D. Barrett, Nathan Grinsztajn

TL;DR
This paper introduces MEMENTO, a memory-augmented neural solver that dynamically adapts routing problem heuristics during inference, significantly improving performance and scalability over existing methods.
Contribution
The paper presents MEMENTO, a novel memory-based approach that enhances neural solvers for routing problems by leveraging online data to adapt actions during inference.
Findings
Outperforms tree-search and policy-gradient fine-tuning methods.
Achieves state-of-the-art results on 11 out of 12 tasks.
Demonstrates scalability and data-efficiency in large instances.
Abstract
Routing Problems are central to many real-world applications, yet remain challenging due to their (NP-)hard nature. Amongst existing approaches, heuristics often offer the best trade-off between quality and scalability, making them suitable for industrial use. While Reinforcement Learning (RL) offers a flexible framework for designing heuristics, its adoption over handcrafted heuristics remains incomplete. Existing learned methods still lack the ability to adapt to specific instances and fully leverage the available computational budget. Current best methods either rely on a collection of pre-trained policies, or on RL fine-tuning; hence failing to fully utilize newly available information within the constraints of the budget. In response, we present MEMENTO, an approach that leverages memory to improve the search of neural solvers at inference. MEMENTO leverages online data collected…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research
