Efficiency of adaptive genetic algorithm with mutation matrix in the solution of the knapsack problem of increasing complexity.
Qing Jie LiKwok Yip SzetoPublished in: CEC (2015)
Keyphrases
- knapsack problem
- optimal solution
- greedy heuristic
- combinatorial optimization problems
- cutting plane
- computational complexity
- implicit enumeration
- linear programming relaxation
- dynamic programming
- optimization problems
- exact algorithms
- np hard
- decision variables
- heuristic solution
- continuous relaxation
- greedy algorithm
- test problems
- evolutionary algorithm
- multidimensional knapsack problem
- genetic algorithm
- machine learning
- lp relaxation
- fitness function
- worst case
- neural network
- exact solution
- nsga ii
- dna sequences
- branch and bound
- upper bound
- linear relaxation
- integer variables
- lower bound