Performance Comparison of Jumping Gene Adaptations of the Elitist Non‐dominated Sorting Genetic Algorithm
Shivom Sharma, Seyed Reza Nabavi, Gade Pandu Rangaiah
Abstract
Shivom Sharma, Seyed Reza Nabavi, Gade Pandu Rangaiah
Abstract
Industrial problems are complex in nature, and often have multiple performance criteria. The elitist nondominated sorting genetic algorithm (NSGA-II) has been used to optimize many process design and operation problems for two or more objectives. In order to improve the performance of this algorithm, the jumping-gene concept from natural genetics has been incorporated in NSGA-II. Several jumping-gene adaptations have been proposed and used to solve mathematical and application problems in different studies. In this chapter, four jumping-gene adaptations are selected and comprehensively evaluated on a number of two-objective unconstrained and constrained test functions. Three quality metrics, namely, generational distance, spread and inverse generational distance are employed to evaluate the distribution and convergence of the obtained Pareto-optimal solutions at the final generation and also at selected intermediate generations. Additionally, a search termination criterion based on the improvement in the Pareto-optimal front, has been described and used to check convergence of NGSA-II with the selected jumping gene adaptations.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Industrial problems are complex in nature, and often have multiple performance criteria. The elitist nondominated sorting genetic algorithm (NSGA-II) has been used to optimize many process design and operation problems for two or more objectives. In order to improve the performance of this algorithm, the jumping-gene concept from natural genetics has been incorporated in NSGA-II. Several jumping-gene adaptations have been proposed and used to solve mathematical and application problems in different studies. In this chapter, four jumping-gene adaptations are selected and comprehensively evaluated on a number of two-objective unconstrained and constrained test functions. Three quality metrics, namely, generational distance, spread and inverse generational distance are employed to evaluate the distribution and convergence of the obtained Pareto-optimal solutions at the final generation and also at selected intermediate generations. Additionally, a search termination criterion based on the improvement in the Pareto-optimal front, has been described and used to check convergence of NGSA-II with the selected jumping gene adaptations.
Key concepts: Jumping, Sorting, Convergence (economics), Genetic algorithm, Mathematical optimization, Pareto principle, Computer science, Algorithm