An improved MOEA/D algorithm for bi-objective optimization problems with complex Pareto fronts and its application to structural optimization.
Vinh Ho-HuuS. HartjesHendrikus G. VisserRichard CurranPublished in: Expert Syst. Appl. (2018)
Keyphrases
- multi objective
- bi objective
- optimization problems
- cost function
- test problems
- optimization algorithm
- shortest path problem
- worst case
- mathematical model
- np hard
- knapsack problem
- objective function
- search space
- multi objective evolutionary algorithms
- pareto fronts
- benchmark problems
- particle swarm optimization
- dynamic programming
- evolutionary algorithm
- optimal solution
- convergence rate
- differential evolution
- linear programming
- upper bound
- multiple objectives
- computational complexity
- pareto optimal solutions