论文信息 - Non-dominated Sorting Genetic Algorithm

Non-dominated Sorting Genetic Algorithm

Evolutionary Algorithms mimic natural evolutionary process in nature. One of the most well-regarded evolutionary algorithms is Genetic Algorithm (GA) [1]. This algorithm has been inspired from the Drawin’s theory of evolutionary. This theory states that natural organisms develop using the natural selection. Natural selection refers to the process of selecting and propagating the best genes from one generation to the next that helps the new generation to better survive, compete, and reproduce.

Jin Song Dong | Seyedali Mirjalili | J. Dong | S. Mirjalili

[1] Frank Kursawe,et al. A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

[2] Kalyanmoy Deb,et al. Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence , 2001, EMO.

[3] Lothar Thiele,et al. The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration , 2007, EMO.

[4] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[5] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6] Kalyanmoy Deb,et al. Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems , 2006, 2006 IEEE International Conference on Evolutionary Computation.