Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
An Improved Nondominated Sorting Algorithm
View through CrossRef
This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with objective functions, using solutions in the population, the original nondominated sorting algorithm, used by NSGA-II, has always a computational cost of in a naïve implementation. The complexity of the new algorithm can vary from in the best case and in the worst case. A experiment was executed in order to compare the new algorithm with the original and another improved version of the Deb’s algorithm. Results reveal that the new strategy is much better than other versions when there are many levels in Pareto front. It is also concluded that is interesting to alternate the new algorithm and the improved Deb’s version during the evolution of the evolutionary algorithm.
Title: An Improved Nondominated Sorting Algorithm
Description:
This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm.
The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front.
In a problem with objective functions, using solutions in the population, the original nondominated sorting algorithm, used by NSGA-II, has always a computational cost of in a naïve implementation.
The complexity of the new algorithm can vary from in the best case and in the worst case.
A experiment was executed in order to compare the new algorithm with the original and another improved version of the Deb’s algorithm.
Results reveal that the new strategy is much better than other versions when there are many levels in Pareto front.
It is also concluded that is interesting to alternate the new algorithm and the improved Deb’s version during the evolution of the evolutionary algorithm.
Related Results
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired opera...
Multi-Objective Optimal Power Flow Solutions Using Improved Multi-Objective Mayfly Algorithm (IMOMA)
Multi-Objective Optimal Power Flow Solutions Using Improved Multi-Objective Mayfly Algorithm (IMOMA)
This paper realizes the implementation of Improved Multi-objective Mayfly Algorithm (IMOMA) for getting optimal solutions related to optimal power flow problem with smooth and nons...
Visualization of sorting algorithms in the virtual reality environment
Visualization of sorting algorithms in the virtual reality environment
This study examines the use of virtual reality (VR) in programming, specifically in visualization of sorting methods. Addressing students’ needs to better understand and implement ...
Optimization of the TLR7/8 Activation-Based Sorting System for Goat Sperm
Optimization of the TLR7/8 Activation-Based Sorting System for Goat Sperm
Background:Current research indicates that the immunological separation method based on differentially expressed proteins in X- and Y-chromosome-bearing sperm represents a novel ap...
MARS-seq2.0: an experimental and analytical pipeline for indexed sorting combined with single-cell RNA sequencing v1
MARS-seq2.0: an experimental and analytical pipeline for indexed sorting combined with single-cell RNA sequencing v1
Human tissues comprise trillions of cells that populate a complex space of molecular phenotypes and functions and that vary in abundance by 4–9 orders of magnitude. Relying solely ...
Neural Networks for Quality Sorting of Agricultural Produce
Neural Networks for Quality Sorting of Agricultural Produce
The objectives of this project were to develop procedures and models, based on neural networks, for quality sorting of agricultural produce. Two research teams, one in Purdue Unive...
Preprocessing: A method For Reducing Time Complexity
Preprocessing: A method For Reducing Time Complexity
Data can be processed quickly if it is in some order, whereas unsequenced data can take more time to obtain results. Sorting is used for data arrangement. It is also one of the ess...
Technique for Mitigating Time Complexity
Technique for Mitigating Time Complexity
Ordered data may be handled rapidly, however unstructured data may require additional time to get results. Sorting is employed for data organization. This is a fundamental requirem...