A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems.
Shanu VermaMillie PantVáclav SnáselPublished in: IEEE Access (2021)
Keyphrases
- combinatorial optimization problems
- nsga ii
- multi objective
- optimization problems
- knapsack problem
- evolutionary algorithm
- pareto optimal
- metaheuristic
- multiobjective optimization
- multi objective optimization
- test problems
- multiobjective evolutionary algorithm
- combinatorial optimization
- multi objective optimization problems
- objective function
- optimization algorithm
- multi objective differential evolution
- ant colony optimization
- particle swarm optimization
- multi objective evolutionary algorithms
- genetic algorithm
- bi objective
- evolutionary multiobjective optimization
- uniform design
- shortest path problem
- multi objective optimisation
- benchmark problems
- multiple objectives
- multi objective problems
- evolutionary multiobjective
- constrained multi objective optimization problems
- job shop scheduling problem
- optimal solution
- pareto set
- vehicle routing problem
- pareto dominance
- pareto optimal solutions
- traveling salesman problem
- evolutionary computation
- pareto fronts
- genetic operators
- dynamic programming
- multi criteria
- strength pareto evolutionary algorithm
- cost function
- crossover operator
- pareto optimal set
- fitness function
- greedy algorithm
- pareto frontier
- lower bound
- np hard