Neural large neighborhood search for routing problems
From MaRDI portal
Publication:2093389
Cites work
- ``Neural computation of decisions in optimization problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A unified solution framework for multi-attribute vehicle routing problems
- Algorithm selection for combinatorial search problems: a survey
- An iterated local search heuristic for the split delivery vehicle routing problem
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Deep policy dynamic programming for vehicle routing problems
- scientific article; zbMATH DE number 3526435 (Why is no real title available?)
- Learning heuristics for the TSP by policy gradient
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- New benchmark instances for the capacitated vehicle routing problem
- Optimization by simulated annealing
- Record breaking optimization results using the ruin and recreate principle
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- The capacitated team orienteering and profitable tour problems
- The truck dispatching problem
Cited in
(6)- Neural computation network for global routing
- Explanation-based large neighborhood search
- Knowledge-guided hybrid deep reinforcement learning for the dynamic multi-depot electric vehicle routing problem
- A graph reinforcement learning framework for neural adaptive large neighbourhood search
- Reinforcement learning guided neural deconstruction search for flexible job scheduling
- Large neighborhood search meets iterative neural constraint heuristics
This page was built for publication: Neural large neighborhood search for routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093389)
