Improving the non-dominate sorting genetic algorithm for multi-objective optimization
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Standard Standard
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007). 2007. p. 89-92.
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
HarvardHarvard
APA
CBE
MLA
VancouverVancouver
Author
RIS
TY - GEN
T1 - Improving the non-dominate sorting genetic algorithm for multi-objective optimization
AU - Seydi, Vahid
AU - Khanehsar, M Ahmadieh
AU - Teshnehlab, M
PY - 2007
Y1 - 2007
N2 - The non-dominate sorting genetic algorithmic-II (NSGA-II) is a relatively recent technique for finding or approximating the Pareto-optimal set for multi-objective optimization problems. In different studies NSGA-II has shown good performance in comparison to other multi-objective evolutionary algorithms (Deb et al., 2002). In this paper an improved version which is named Niching-NSGA-II (n-NSGA-II) is proposed. This algorithm uses new method after non-dominate sorting procedure for keeping diversity. The comparison of n-NSGA-II with NSGA-II and other methods on ZDT test problems yields promising results.
AB - The non-dominate sorting genetic algorithmic-II (NSGA-II) is a relatively recent technique for finding or approximating the Pareto-optimal set for multi-objective optimization problems. In different studies NSGA-II has shown good performance in comparison to other multi-objective evolutionary algorithms (Deb et al., 2002). In this paper an improved version which is named Niching-NSGA-II (n-NSGA-II) is proposed. This algorithm uses new method after non-dominate sorting procedure for keeping diversity. The comparison of n-NSGA-II with NSGA-II and other methods on ZDT test problems yields promising results.
M3 - Conference contribution
SP - 89
EP - 92
BT - 2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)
ER -