Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem.
Marco LaumannsLothar ThieleEckart ZitzlerPublished in: Nat. Comput. (2004)
Keyphrases
- simulated annealing
- evolutionary algorithm
- multi objective
- optimization problems
- knapsack problem
- metaheuristic
- multi objective optimization
- genetic algorithm
- nsga ii
- combinatorial optimization problems
- optimization algorithm
- genetic programming
- multiple objectives
- genetic algorithm ga
- bi objective
- exact algorithms
- differential evolution
- test problems
- particle swarm optimization
- multiobjective evolutionary algorithms
- differential evolution algorithm
- machine learning
- combinatorial problems
- cost function
- computational complexity
- greedy heuristic