Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ϵ -dominance.
Crina GrosanPublished in: IEEE Congress on Evolutionary Computation (2004)
Keyphrases
- knapsack problem
- evolutionary algorithm
- multi objective
- optimization problems
- nsga ii
- multi objective optimization
- combinatorial optimization problems
- evolutionary computation
- pareto dominance
- optimization algorithm
- test problems
- multiple objectives
- multiobjective optimization problems
- particle swarm optimization
- multiobjective evolutionary algorithms
- genetic algorithm
- differential evolution
- multiobjective optimization
- exact algorithms
- multidimensional knapsack problem
- bi objective
- fitness function
- simulated annealing
- optimal solution
- metaheuristic
- genetic programming
- dynamic programming
- pareto optimal
- linear programming relaxation
- greedy algorithm
- benchmark problems
- multiobjective evolutionary algorithm
- differential evolution algorithm
- decision variables
- greedy heuristic
- multi objective optimization problems
- np hard
- bicriteria
- continuous relaxation
- neural network
- combinatorial optimization
- traveling salesman problem
- objective function
- implicit enumeration
- mutation operator
- crossover operator