A Preliminary Study on Feature-independent Hyper-heuristics for the 0/1 Knapsack Problem.
Xavier SánchezJosé Carlos Ortiz-BaylissIván AmayaJorge M. Cruz-DuarteSantiago Enrique Conant-PablosHugo Terashima-MarínPublished in: CEC (2020)
Keyphrases
- knapsack problem
- hyper heuristics
- optimization problems
- search heuristics
- combinatorial optimization problems
- test problems
- optimal solution
- metaheuristic
- evolutionary algorithm
- dynamic programming
- genetic programming
- exact algorithms
- np hard
- multidimensional knapsack problem
- linear programming relaxation
- multiple objectives
- cutting stock problems
- examination timetabling
- bicriteria
- timetabling problem
- greedy algorithm
- continuous relaxation
- greedy heuristic
- condition action rules
- graph coloring
- heuristic methods
- maximum profit
- neural network
- decision variables
- difficult problems
- search procedure
- optimization algorithm