An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Introduction to algorithms
Equal-average hyperplane partitioning method for vector quantization of image data
Pattern Recognition Letters
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Solving rotated multi-objective optimization problems using differential evolution
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms
IEEE Transactions on Evolutionary Computation
Approximating the Knee of an MOP with Stochastic Search Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Comparison of MCDM and EMO Approaches in Wastewater Treatment Plan Design
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Metaheuristic approaches for optimal broadcasting design in metropolitan MANETs
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
High performance computing for dynamic multi-objective optimisation
International Journal of High Performance Systems Architecture
Artificial immune multi-objective SAR image segmentation with fused complementary features
Information Sciences: an International Journal
Attempt to reduce the computational complexity in multi-objective differential evolution algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Environmental Modelling & Software
| Hi-index | 0.00 |
Diversity maintenance of solutions is an essential part in multi-objective optimization. Existing techniques are suboptimal either in the sense of obtained distribution or execution time. This paper proposes an effective and relatively fast method for pruning a set of non-dominated solutions. The proposed method is based on a crowding estimation technique using nearest neighbors of solutions in Euclidean sense, and a technique for finding these nearest neighbors quickly. The method is experimentally evaluated, and results indicate a good trade-off between the obtained distribution and execution time. Distribution is good also in many-objective problems, when number of objectives is more than two.