2008
DOI: 10.1016/s1000-9361(08)60172-7
|View full text |Cite
|
Sign up to set email alerts
|

Improved NSGA-II Multi-objective Genetic Algorithm Based on Hybridization-encouraged Mechanism

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(10 citation statements)
references
References 11 publications
0
10
0
Order By: Relevance
“…MGA is a variant of a non-dominated sorting genetic algorithm II (NSGA-II) proposed by (Deb, 2001). NSGA-II favors individuals with an elitist strategy and individuals that can help increase the diversity of the population (Yijie and Gongzhang, 2008). The output of the MGA is a set of solutions that is also known as Pareto front optimized solutions, among which we can select the most preferable solution.…”
Section: Cell Neighborhood Calibrationmentioning
confidence: 99%
“…MGA is a variant of a non-dominated sorting genetic algorithm II (NSGA-II) proposed by (Deb, 2001). NSGA-II favors individuals with an elitist strategy and individuals that can help increase the diversity of the population (Yijie and Gongzhang, 2008). The output of the MGA is a set of solutions that is also known as Pareto front optimized solutions, among which we can select the most preferable solution.…”
Section: Cell Neighborhood Calibrationmentioning
confidence: 99%
“…In our second approach, we develop a novel Genetic algorithm based on non-dominated sort called N-Genetic algorithm or NGA. Non-dominated sort Genetic algorithms [16] are a class of Genetic algorithms that are capable of tackling problems of a multi-objective nature. They are also able to perform non-dominated sort operation in addition to standard operations such as crossover and mutation.…”
Section: Network-aware Genetic Algorithmmentioning
confidence: 99%
“…Cheng et al [7] combined the non-revisiting mechanism based on binary space partitioning with NSGA-II to realize non-repetitive search and save computing resources. In reference [8], the ''Neighboring-Max'' mode, which not only takes advantage of hybridization but also improves the distribution of the population near the Pareto optimal front, was chosen and used in NSGA-II on the basis of a hybridization-encouraged mechanism. Deb and Himanshu [14], [15] proposed the non dominated sorting genetic algorithm III (NSGA-III) based on reference-point.…”
Section: Introductionmentioning
confidence: 99%