Adjust weight vectors in MOEA/D for bi-objective optimization problems with discontinuous Pareto fronts.
Chunjiang ZhangKay Chen TanLoo Hay LeeLiang GaoPublished in: Soft Comput. (2018)
Keyphrases
- bi objective
- pareto fronts
- weight vector
- optimization problems
- nsga ii
- objective function
- multi objective
- evolutionary algorithm
- test problems
- multiobjective optimization
- pareto optimal
- multi objective optimization
- learning rate
- multi objective problems
- pareto dominance
- multi objective evolutionary algorithms
- knapsack problem
- linear combination
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- multiple objectives
- benchmark problems
- hyperplane
- optimization algorithm
- feature values
- cost function
- genetic algorithm
- combinatorial optimization
- particle swarm optimization
- differential evolution
- principal components
- greedy algorithm
- lower bound
- loss function
- linear programming
- dynamic programming
- convergence speed
- fitness function
- shortest path problem
- search algorithm
- genetic programming