A RNN-based hyper-heuristic for combinatorial problems

DOI10.1007/978-3-031-04148-8_2MaRDI QIDQ2163777zbMATH OpenOpenAlexFDO

Authors Emmanuel Kieffer, Gabriel Duflo, Grégoire Danoy, Sébastien Varrette, Pascal Bouvry

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-04148-8_2

zbMATH Keywords

hyper-heuristicsmulti-dimensional knapsackdeep symbolic regression

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Recommendations

• A hybrid neural approach to combinatorial optimization
• A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
• A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
• Artificial Neural Networks for Combinatorial Optimization
• scientific article; zbMATH DE number 7641069
• Neural Computing for Optimization and Combinatorics
• Neural network methods in combinatorial optimization
• scientific article; zbMATH DE number 764457

Cites work

• scientific article; zbMATH DE number 1728538 (Why is no real title available?)
• A genetic algorithm for the multidimensional knapsack problem
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A simulated annealing hyper-heuristic methodology for flexible decision support
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• Exploring hyper-heuristic methodologies with genetic programming
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Greedy algorithm for the general multidimensional knapsack problem
• Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation
• Hyper-heuristic approaches for the response time variability problem
• Natural computing algorithms
• Scheduling English football fixtures over holiday periods
• Simulated annealing for the 0/1 multidimensional knapsack problem
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
• The multidimensional 0-1 knapsack problem: an overview.
• The noising method: A new method for combinatorial optimization
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

Cited in

(2)

• A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
• Reinforcement learning for the knapsack problem

Describes a project that uses

Uses Software

• OR-Library
• Hyperheuristics

This page was built for publication: A RNN-based hyper-heuristic for combinatorial problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163777)