The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem.
Sacha CerfBenjamin DoerrBenjamin HebrasYakob KahaneSimon WiethegerPublished in: CoRR (2023)
Keyphrases
- pareto frontier
- nsga ii
- combinatorial optimization
- optimization problems
- multi objective
- evolutionary algorithm
- test problems
- metaheuristic
- multi objective optimization
- multiobjective optimization
- branch and bound algorithm
- pareto optimal
- combinatorial optimization problems
- simulated annealing
- multiobjective evolutionary algorithm
- multiobjective optimization problems
- optimal solution
- optimization algorithm
- traveling salesman problem
- bi objective
- multi objective differential evolution
- scatter search
- evolutionary multiobjective optimization
- branch and bound
- objective function
- uniform design
- genetic algorithm
- multi objective optimization problems
- combinatorial problems
- knapsack problem
- benchmark problems
- crossover operator
- multi objective evolutionary algorithms
- evolutionary multiobjective
- constrained multi objective optimization problems
- quadratic assignment problem
- cost function
- differential evolution
- solution quality
- fitness function
- evolutionary computation
- vehicle routing problem
- hard combinatorial optimization problems
- pareto optimal solutions
- memetic algorithm
- multi objective optimisation
- computational intelligence
- search space
- multiple objectives
- particle swarm optimization
- ant colony optimization
- genetic algorithm ga