Using gradient-free local search within MOEAs for the treatment of constrained MOPs.
Lourdes UribeAdriana LaraKalyanmoy DebOliver SchützePublished in: GECCO Companion (2020)
Keyphrases
- multi objective evolutionary algorithms
- nsga ii
- constrained multi objective optimization problems
- hard constraints
- multi objective
- multi objective optimization
- multi objective optimization problems
- test problems
- evolutionary algorithm
- multiobjective optimization
- multiobjective evolutionary algorithms
- genetic algorithm
- optimization problems
- tabu search
- differential evolution
- fitness function
- optimal solution
- search space
- optimization algorithm
- multiobjective evolutionary algorithm
- memetic algorithm
- bi objective
- stochastic local search
- global search
- evolutionary computation
- simulated annealing
- edge detection
- evolutionary search
- knapsack problem
- solution quality
- pareto optimal solutions
- search algorithm
- gradient direction
- combinatorial optimization