2021
DOI: 10.1109/access.2021.3070634
|View full text |Cite
|
Sign up to set email alerts
|

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

Abstract: This paper provides an extensive review of the popular multi-objective optimization algorithm NSGA-II for selected combinatorial optimization problems viz. assignment problem, allocation problem, travelling salesman problem, vehicle routing problem, scheduling problem, and knapsack problem. It is identified that based on the manner in which NSGA-II has been implemented for solving the aforementioned group of problems, there can be three categories: Conventional NSGA-II, where the authors have implemented the b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
70
0
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 397 publications
(105 citation statements)
references
References 220 publications
0
70
0
1
Order By: Relevance
“…In this model, ELI and accessibility were introduced into modified GDP, while NDVI was used in modified ESV; the modification not only give economic and ecological objective a quantitative meaning, but also the ability of spatial location preference for enabling agglomeration, whereas the above objectives had only a quantitative function in the previous study [13,20]. Additionally, original NSGA-II used a neighbor-change method to reduce the fragmentation [40,42]. In our model, spatial allocation with implicit economic relationships was enhanced through a two-step mutation operator to limit fragmentation.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this model, ELI and accessibility were introduced into modified GDP, while NDVI was used in modified ESV; the modification not only give economic and ecological objective a quantitative meaning, but also the ability of spatial location preference for enabling agglomeration, whereas the above objectives had only a quantitative function in the previous study [13,20]. Additionally, original NSGA-II used a neighbor-change method to reduce the fragmentation [40,42]. In our model, spatial allocation with implicit economic relationships was enhanced through a two-step mutation operator to limit fragmentation.…”
Section: Discussionmentioning
confidence: 99%
“…The Pareto frontier obtains a set of preferred solution sets by non-dominated sorting and selects the results according to the planner's needs [39]. The non-dominated sorting genetic algorithm II (NSGA-II) is a classic metaheuristic algorithm based on GA, and it can obtain Pareto set by non-dominated sorting; it has been widely used for optimizations, due to its good robustness and global search capability [40][41][42]. For example, it has been successfully applied to land use planning and integrated optimization using system dynamics models [43][44][45].…”
Section: Introductionmentioning
confidence: 99%
“…The traditional particle swarm and ant colony algorithms easily become local when dealing with multiobjective problems, and the Pareto solution’s convergence effect is poor [ 32 , 33 ]. Therefore, this study selects three algorithms with good performance when dealing with constrained multiobjective optimization problems to solve the model [ 34 , 35 , 36 ]: the nondominated sorting genetic algorithm-II (NSGA-II), nondominated sorting genetic algorithm-III (NSGA-III), and a multiobjective evolutionary algorithm based on decomposition (MOEA/D).…”
Section: Methodsmentioning
confidence: 99%
“…The crowding method was used instead of the fitness sharing strategy, which was necessary to ensure the diversity of individuals. The algorithm frameworks of NSGA-III and NSGA-II are roughly the same, but the selection mechanism is different [ 35 ]. NSGA-II uses crowding to select individuals with the same non-dominated level, while NSGA-III selects individuals based on reference points.…”
Section: Methodsmentioning
confidence: 99%
“…The confidence interval (CI) width represents the certainty of probability prediction, which is also an important objective to consider. As one of the most popular multiobjective optimization algorithms, the non-dominated sorting genetic algorithm (NSGA-II) reduces the complexity of genetic algorithms with fast calculation and good convergence [27][28][29].…”
Section: Introductionmentioning
confidence: 99%