A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on restrictive capacity knapsack problem.
Jun HeYuren ZhouPublished in: GECCO (2007)
Keyphrases
- infeasible solutions
- knapsack problem
- multidimensional knapsack problem
- test problems
- optimal solution
- nsga ii
- genetic algorithm
- optimization problems
- dynamic programming
- linear programming relaxation
- benchmark problems
- tabu search
- greedy algorithm
- production planning
- np hard
- feasible solution
- objective function
- binary variables
- multiple objectives
- multiple choice
- neural network
- cutting plane
- design space
- crossover operator
- multi objective
- linear programming