A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem.
Jun HeYuren ZhouXin YaoPublished in: Theory of Evolutionary Algorithms (2008)
Keyphrases
- infeasible solutions
- knapsack problem
- multidimensional knapsack problem
- test problems
- optimization problems
- nsga ii
- optimal solution
- dynamic programming
- benchmark problems
- greedy algorithm
- genetic algorithm
- feasible solution
- linear programming relaxation
- np hard
- production planning
- tabu search
- multiple objectives
- neural network
- solution quality
- evolutionary algorithm
- design space
- decision variables
- evolutionary strategy
- objective function