Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
From MaRDI portal
Publication:6069215
DOI10.1016/j.ejor.2023.06.016OpenAlexW4380742085MaRDI QIDQ6069215
Publication date: 14 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.06.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Analyzing bandit-based adaptive operator selection mechanisms
- A general heuristic for vehicle routing problems
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Solving urban transit route design problem using selection hyper-heuristics
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Recent advances in selection hyper-heuristics
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A graph-based hyper-heuristic for educational timetabling problems
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- The Truck Dispatching Problem
- A Parallel Algorithm for the Vehicle Routing Problem
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Multi‐Armed Bandit Allocation Indices
- Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Bandit Algorithms
- Introduction to Multi-Armed Bandits
- Learning to Optimize via Posterior Sampling
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Handbook of metaheuristics
This page was built for publication: Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
