2017
DOI: 10.1016/j.ins.2016.12.003
|View full text |Cite
|
Sign up to set email alerts
|

The elitist non-dominated sorting genetic algorithm with inheritance (i-NSGA-II) and its jumping gene adaptations for multi-objective optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(13 citation statements)
references
References 27 publications
0
13
0
Order By: Relevance
“…The individuals closer to the Pareto-optimal front and with higher VCDs are selected into P new . In addition, an elite preservation strategy [23] is applied to include in P new the individuals with the highest Step 9. Return X = decode (Pop) and the lowest NDR ranks, and the individuals with the highest and the lowest VCD ranks.…”
Section: A Double-strand Dna Genetic Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The individuals closer to the Pareto-optimal front and with higher VCDs are selected into P new . In addition, an elite preservation strategy [23] is applied to include in P new the individuals with the highest Step 9. Return X = decode (Pop) and the lowest NDR ranks, and the individuals with the highest and the lowest VCD ranks.…”
Section: A Double-strand Dna Genetic Algorithmmentioning
confidence: 99%
“…(2) Two new ranking criteria, the variant crowding distance (VCD) and the non-dominated rank with density (NRD), are introduced to help maintain diversity in the solution population. These ranking criteria improve the CD [23] and the non-dominated ranking [3] criteria and can be used to effectively identify well diversified solutions in the current Pareto-optimal front as well as in lateral fronts. (3) Extensive experiments are performed to compare the new algorithm with several state-of-the-art MOEAs, including NSGA-II [3], PAES [24], MOPSO [25] and NNIA [26], on a set of well-known benchmark bi-objective and tri-objective optimization test problems.…”
Section: Introductionmentioning
confidence: 99%
“…A preliminary assortment of a superior pool of randomly selected parent population is likely to generate a finer pool of daughter chromosome. Consequently, selecting the most appropriate group of the chromosome in the preliminary selection of random parent population assists to improve the speed of convergence to the true optimal global Pareto front [16]. For the assortment of a superior pool of initial random parent chromosomes, the solutions with the best fitness functions are selected and copied to the parent pool.…”
Section: Theory Of Parental Inheritancementioning
confidence: 99%
“…However, this approach has the difficulty of subjectivity, as it requires information about the preferred choice of objectives and it usually finds a single optimal solution. If the entire economic, technical, and ecological objectives are being considered for the allocation of the device, it turns into a problem of conflicting objectives, so, an efficient multi-objective algorithm ought to be employed [13][14][15][16][17][18]. To solve problems with contradictory objectives many multi-objective methodologies such as the strength-Pareto evolutionary algorithm (SPEA) [15], the multi-objective genetic algorithm (MOGA) [18], are developed in recent years.…”
Section: Introductionmentioning
confidence: 99%
“…An improved variant of the NSGA-II combined with a jumping gene named NSGA-II-JG [10] along with its different variants has been used to solve a different multi-objective problem, which resulted in better convergence with reduction of the central processing unit (CPU) time [11]. In [12,13], it was found that the NSGA-II with its adapted jumping gene operator (NSGA-II-aJG) outperforms other variants of NSGA-II on different evaluating matrices.…”
Section: Introductionmentioning
confidence: 99%