An Exploratory Study on Machine-Learning-Based Hyper-heuristics for the Knapsack Problem.
José Eduardo Zárate-ArandaJosé Carlos Ortiz-BaylissPublished in: MCPR (2024)
Keyphrases
- knapsack problem
- machine learning
- hyper heuristics
- search heuristics
- optimization problems
- evolutionary algorithm
- combinatorial optimization problems
- optimal solution
- multiple objectives
- cutting stock problems
- metaheuristic
- genetic programming
- test problems
- exact algorithms
- examination timetabling
- greedy algorithm
- timetabling problem
- np hard
- dynamic programming
- multidimensional knapsack problem
- condition action rules
- constraint satisfaction problems
- linear programming relaxation
- graph coloring
- randomly generated test instances
- difficult problems
- implicit enumeration
- search procedure
- maximum profit
- heuristic search
- greedy heuristic
- nsga ii
- combinatorial optimization
- lower bound