MOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems.
Yan-Yan TanYong-Chang JiaoPublished in: J. Comput. (2013)
Keyphrases
- uniform design
- nsga ii
- knapsack problem
- multi objective
- test problems
- convex programming
- multiobjective optimization
- optimization problems
- multi objective optimization
- multiobjective evolutionary algorithm
- pareto optimal
- evolutionary algorithm
- implicit enumeration
- optimization algorithm
- optimal solution
- genetic algorithm
- multi objective evolutionary algorithms
- mutation operator
- crossover operator
- bi objective
- multiple objectives
- combinatorial optimization problems
- pareto optimal solutions
- pareto fronts
- multi objective problems
- objective function
- linear programming relaxation
- metaheuristic
- pareto dominance
- dynamic programming
- np hard
- combinatorial optimization
- fitness function
- pareto set
- greedy algorithm
- swarm intelligence
- special case