A note on the performance of genetic algorithms on zero-one knapsack problems.
V. Scott GordonA. P. Wim BöhmL. Darrell WhitleyPublished in: SAC (1994)
Keyphrases
- knapsack problem
- genetic algorithm
- optimization problems
- combinatorial optimization problems
- optimal solution
- evolutionary algorithm
- metaheuristic
- test problems
- neural network
- dynamic programming
- simulated annealing
- linear programming relaxation
- exact algorithms
- multi objective
- np hard problems
- greedy algorithm
- cutting plane
- continuous relaxation
- fitness function
- np hard
- production planning
- population size
- genetic algorithm ga
- genetic programming
- bicriteria
- fuzzy logic
- implicit enumeration
- tabu search
- particle swarm optimization
- binary variables
- differential evolution
- evolutionary computation