Learning to guide local search optimisation for routing problems
From MaRDI portal
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- A fast swap-based local search procedure for location problems
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
- A method for solving traveling-salesman problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Distributionally robust equilibrious hybrid vehicle routing problem under twofold uncertainty
- First vs. best improvement: an empirical study
- Guided local search and its application to the traveling salesman problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- New benchmark instances for the capacitated vehicle routing problem
- QMOEA: a Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows
- Reinforcement learning. An introduction
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Solving the production transportation problem via a deterministic annealing neural network method
- TSPLIB—A Traveling Salesman Problem Library
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
This page was built for publication: Learning to guide local search optimisation for routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988630)