A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II

By Aravind Seshadri. 2000

720 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/bcd29e88011498519269da020fb91b759f00d701

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Annibale Panichella
2. Fitsum Meshesha Kifetew
3. I. Ray
4. Paolo Tonella
5. Rinku Dewri
6. Nayot Poolsappasit
7. Gordon Fraser
8. Andrea Arcuri

Citations in the corpus

• Dynamic Security Risk Management Using Bayesian Attack Graphs (2012, background): “A crowding distance metric [22] is used if the number of solutions required to fill the mating pool is lower than the available solutions in the rank being considered.”
• Automated Test Case Generation as a Many-Objective Optimisation Problem with Dynamic Selection of the Targets (2018, methodology): “Multi-objective algorithms, such as the Non-dominated Sorting Genetic Algorithm II (NSGA-II) [13] and the improved Strength Pareto Evolutionary Algorithm (SPEA2) [63], have been successfully applied within the software engineering community to solve problems with two or three objectives, including s”