Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
Effects of removing overlapping solutions on the performance of the NSGA-II algorithm
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Guest editorial: special issue on evolutionary multiobjective optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The existence of overlapping individuals in the evolution population means that the MOEAs do a redundant work of searching the overlapping region in the searching space, which weakens the ability of the MOEAs to exploit new feasible regions. Hence the running efficiency of the algorithm turns to be lower. This paper focused on the overlapping individuals in MOEAs. We probed into the causation why overlapping individuals come into being and then gave a probability analysis of the quantity with the statistical results supported. We also managed to find the influence that the overlapping individuals have on the assessment of the algorithm. The experiments illustrated that MOEAs with overlapping individuals removed gained solution sets with better diversity than that obtained by the original ones. The famous NSGA-IJ was taken as the example MOEA and the conclusion can be extended to other MOEAs.