A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II
暂无分享,去创建一个
NSGA ( [5]) is a popular non-domination based genetic algorithm for multiobjective optimization. It is a very effective algorithm but has been generally criticized for its computational complexity, lack of elitism and for choosing the optimal parameter value for sharing parameter σshare. A modified version, NSGAII ( [3]) was developed, which has a better sorting algorithm , incorporates elitism and no sharing parameter needs to be chosen a priori. NSGA-II is discussed in detail in this.
[1] Kalyanmoy Deb,et al. Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..
[2] Kalyanmoy Deb,et al. On self-adaptive features in real-parameter evolutionary algorithms , 2001, IEEE Trans. Evol. Comput..
[3] Kalyanmoy Deb,et al. Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.