Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
From MaRDI portal
Cites work
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- A general heuristic for vehicle routing problems
- A graph-based hyper-heuristic for educational timetabling problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- A parallel algorithm for the vehicle routing problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Analyzing bandit-based adaptive operator selection mechanisms
- Bandit algorithms
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Handbook of metaheuristics
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- scientific article; zbMATH DE number 1728538 (Why is no real title available?)
- scientific article; zbMATH DE number 1306865 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Introduction to multi-armed bandits
- Learning to optimize via posterior sampling
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Machine learning. A probabilistic perspective
- Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Nonparametric statistical methods
- Recent advances in selection hyper-heuristics
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Solving urban transit route design problem using selection hyper-heuristics
- The on-line shortest path problem under partial monitoring
- The truck dispatching problem
- Thompson sampling: an asymptotically optimal finite-time analysis
- Vehicle Routing
Cited in
(5)- Learning-guided iterated local search for the minmax multiple traveling salesman problem
- A selection hyper-heuristic approach to the single airport slot allocation problem
- A graph reinforcement learning framework for neural adaptive large neighbourhood search
- The multi-armed bandit problem under the mean-variance setting
- Simple fixes that accommodate switching costs in multi-armed bandits
This page was built for publication: Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069215)
