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: IJCAI (2023)
Keyphrases
- nsga ii
- combinatorial optimization
- optimization problems
- test problems
- multi objective
- evolutionary algorithm
- branch and bound algorithm
- simulated annealing
- metaheuristic
- multi objective optimization
- pareto optimal
- multiobjective optimization
- multiobjective evolutionary algorithm
- combinatorial optimization problems
- traveling salesman problem
- multi objective differential evolution
- multiobjective optimization problems
- benchmark problems
- multi objective optimization problems
- scatter search
- evolutionary multiobjective optimization
- knapsack problem
- objective function
- branch and bound
- combinatorial problems
- optimization algorithm
- genetic algorithm
- optimal solution
- multi objective evolutionary algorithms
- pareto optimal solutions
- evolutionary multiobjective
- tabu search
- uniform design
- cost function
- crossover operator
- multi objective optimisation
- fitness function
- strength pareto evolutionary algorithm
- constrained multi objective optimization problems
- particle swarm optimization
- quadratic assignment problem
- evolutionary computation
- cooperative coevolution
- hard combinatorial optimization problems
- bi objective
- multiple objectives
- linear programming
- genetic programming
- job shop scheduling problem
- min max
- lower bound
- memetic algorithm
- special case
- vehicle routing problem
- solution quality
- greedy algorithm
- differential evolution
- genetic algorithm ga