Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems.
Hiroyuki SatoHernán E. AguirreKiyoshi TanakaPublished in: Ann. Math. Artif. Intell. (2013)
Keyphrases
- multi objective evolutionary algorithms
- knapsack problem
- crossover and mutation
- multi objective optimization
- nsga ii
- test problems
- mutation operator
- multi objective
- pareto optimal solutions
- evolutionary algorithm
- premature convergence
- fitness function
- genetic operators
- multiple objectives
- optimization problems
- implicit enumeration
- genetic algorithm
- combinatorial optimization problems
- dynamic programming
- optimal solution
- greedy algorithm
- optimization algorithm
- solution space
- genetic search
- crossover operator
- combinatorial optimization
- differential evolution
- np hard
- search space
- benchmark problems
- solution quality
- branch and bound algorithm
- genetic programming