Plateaus can be harder in multi-objective optimization.
Tobias FriedrichNils HebbinghausFrank NeumannPublished in: IEEE Congress on Evolutionary Computation (2007)
Keyphrases
- multi objective optimization
- multi objective
- evolutionary algorithm
- hill climbing
- genetic algorithm
- nsga ii
- multiple objectives
- np complete
- multi objective optimization problems
- pareto optimal
- differential evolution
- optimization problems
- np hard
- hybrid evolutionary algorithm
- multiobjective optimization
- multi objective genetic algorithm
- pareto optimal set
- solving multi objective optimization problems
- multi objective genetic algorithms
- pareto dominance
- crossover and mutation
- search algorithm