Improving the Performance of Evolutionary Algorithms for the Multiobjective 0/1 Knapsack Problem Using e-Dominance.
Crina GrosanMihai OlteanPublished in: International Conference on Computational Science (2004)
Keyphrases
- knapsack problem
- evolutionary algorithm
- multi objective
- optimization problems
- combinatorial optimization problems
- multi objective optimization
- pareto dominance
- nsga ii
- evolutionary computation
- multiobjective optimization problems
- multiobjective optimization
- optimization algorithm
- differential evolution
- multiple objectives
- test problems
- fitness function
- multiobjective evolutionary algorithms
- particle swarm optimization
- exact algorithms
- metaheuristic
- genetic programming
- linear programming relaxation
- optimal solution
- dynamic programming
- simulated annealing
- genetic algorithm
- mutation operator
- bi objective
- benchmark problems
- multi objective evolutionary algorithms
- combinatorial optimization
- pareto optimal
- np hard
- multi objective optimization problems
- differential evolution algorithm
- evolutionary strategy
- bicriteria
- multidimensional knapsack problem
- multiobjective evolutionary algorithm
- randomly generated test instances
- greedy heuristic
- greedy algorithm
- crossover operator
- worst case