A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem.
Fernando Gómez-HerreraRodolfo A. Ramirez-ValenzuelaJosé Carlos Ortiz-BaylissIván AmayaHugo Terashima-MarínPublished in: MICAI (1) (2017)
Keyphrases
- knapsack problem
- hyper heuristics
- search heuristics
- examination timetabling
- timetabling problem
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- optimization problems
- optimal solution
- exact algorithms
- graph coloring
- dynamic programming
- test problems
- evolutionary algorithm
- genetic programming
- np hard
- greedy algorithm
- metaheuristic
- multidimensional knapsack problem
- combinatorial optimization
- linear programming relaxation
- constraint satisfaction problems
- maximum profit
- neural network
- difficult problems
- memetic algorithm
- multi objective
- exact solution
- integer variables
- continuous relaxation
- multi objective optimization
- branch and bound
- genetic algorithm