Neural large neighborhood search for routing problems
From MaRDI portal
Publication:2093389
DOI10.1016/j.artint.2022.103786OpenAlexW4296520336MaRDI QIDQ2093389
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.09539
combinatorial optimizationreinforcement learningheuristic searchrouting problemslearning to optimize
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- An iterated local search heuristic for the split delivery vehicle routing problem
- ``Neural computation of decisions in optimization problems
- Learning heuristics for the TSP by policy gradient
- New benchmark instances for the capacitated vehicle routing problem
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Record breaking optimization results using the ruin and recreate principle
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Deep policy dynamic programming for vehicle routing problems
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- A unified solution framework for multi-attribute vehicle routing problems
- The Truck Dispatching Problem
- The capacitated team orienteering and profitable tour problems
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Algorithm Selection for Combinatorial Search Problems: A Survey
This page was built for publication: Neural large neighborhood search for routing problems
