Hot off the Press: 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: GECCO Companion (2024)
Keyphrases
- nsga ii
- combinatorial optimization
- optimization problems
- test problems
- multi objective
- evolutionary algorithm
- metaheuristic
- branch and bound algorithm
- multiobjective optimization
- multi objective optimization
- pareto optimal
- simulated annealing
- combinatorial optimization problems
- multiobjective evolutionary algorithm
- multi objective differential evolution
- traveling salesman problem
- optimal solution
- branch and bound
- scatter search
- knapsack problem
- multiobjective optimization problems
- multi objective optimisation
- combinatorial problems
- genetic algorithm
- evolutionary multiobjective
- objective function
- evolutionary multiobjective optimization
- crossover operator
- optimization algorithm
- uniform design
- fitness function
- hard combinatorial optimization problems
- constrained multi objective optimization problems
- bi objective
- strength pareto evolutionary algorithm
- benchmark problems
- quadratic assignment problem
- multi objective optimization problems
- evolutionary computation
- pareto optimal solutions
- particle swarm optimization
- vehicle routing problem
- differential evolution
- multi objective evolutionary algorithms
- tabu search
- memetic algorithm
- cost function
- special case
- multiple objectives
- genetic programming
- feasible solution
- neural network