MOEA/D with Uniform Design for the Multiobjective 0/1 Knapsack Problem.
Yan-Yan TanYong-Chang JiaoXin-Kuan WangPublished in: CIS (2011)
Keyphrases
- uniform design
- knapsack problem
- nsga ii
- multi objective
- test problems
- optimization problems
- evolutionary algorithm
- multiobjective evolutionary algorithm
- combinatorial optimization problems
- optimal solution
- multiobjective optimization
- pareto optimal
- genetic algorithm
- multi objective optimization
- exact algorithms
- optimization algorithm
- mutation operator
- multi objective problems
- objective function
- dynamic programming
- particle swarm optimization
- np hard
- multiple objectives
- bi objective
- crossover operator
- pareto set
- multi objective evolutionary algorithms
- pareto dominance
- greedy algorithm
- maximum profit
- convex programming
- decision variables
- pareto optimal solutions
- differential evolution
- genetic programming