Preference-based NSGA-II for many-objective knapsack problems.
Yuki TanigakiKaname NarukawaYusuke NojimaHisao IshibuchiPublished in: SCIS&ISIS (2014)
Keyphrases
- nsga ii
- knapsack problem
- test problems
- multi objective
- multi objective evolutionary algorithms
- pareto frontier
- pareto optimal solutions
- multiple objectives
- pareto fronts
- multi objective optimization
- multiobjective optimization
- optimization problems
- pareto optimal
- evolutionary algorithm
- optimal solution
- multiobjective evolutionary algorithm
- multi objective differential evolution
- combinatorial optimization problems
- multi objective optimisation
- evolutionary multiobjective optimization
- optimization algorithm
- multi objective optimization problems
- bi objective
- dynamic programming
- genetic algorithm
- differential evolution
- uniform design
- pareto dominance
- evolutionary multiobjective
- crossover operator
- multi objective problems
- objective function
- benchmark problems
- multidimensional knapsack problem
- linear programming relaxation
- upper bound
- fitness function
- neural network
- strength pareto evolutionary algorithm
- machine learning
- np hard
- metaheuristic
- greedy algorithm