Approaches to Parallelize Pareto Ranking in NSGA-II Algorithm.
Algirdas LancinskasJulius ZilinskasPublished in: PPAM (2) (2011)
Keyphrases
- optimization algorithm
- multi objective
- optimal solution
- particle swarm optimization
- dynamic programming
- test problems
- multiobjective optimization
- np hard
- multi objective optimization
- cost function
- multiobjective evolutionary algorithm
- search space
- objective function
- uniform design
- nsga ii
- genetic algorithm
- particle swarm optimization algorithm
- differential evolution
- evolutionary algorithm
- branch and bound
- branch and bound algorithm
- knapsack problem
- benchmark problems
- convex hull
- combinatorial optimization
- computational efficiency
- worst case
- multi objective evolutionary algorithms
- computational complexity