A Simple Improvement Heuristic for Attributed Grammatical Evolution with Lookahead to Solve the Multiple Knapsack Problem.
Muhammad Rezaul KarimConor RyanPublished in: ICHIT (1) (2011)
Keyphrases
- knapsack problem
- randomly generated test instances
- exact algorithms
- optimal solution
- multidimensional knapsack problem
- heuristic solution
- dynamic programming
- combinatorial optimization problems
- linear programming relaxation
- grammatical evolution
- greedy heuristic
- optimization problems
- continuous relaxation
- greedy algorithm
- maximum profit
- np hard
- branch and bound
- special case
- exact solution
- combinatorial optimization
- metaheuristic
- genetic programming
- automatic programming
- linear programming
- multi objective
- lower bound
- search algorithm