Aller au contenu principal
Accès ouvert déclaré 2026 article

Improving NSGA-II using a Dynamic Average Distance Selection Strategy

0Citations signalées, ce qui n’est pas une note de qualité
0Institutions déclarées
0Pays d’affiliation déclarés

Le résumé fourni par la source

The traditional Non-dominated Sorting Genetic Algorithm II (NSGA-II) struggles to maintain a uniformly distributed solution set across the entire Pareto front when dealing with non-uniform, non-convex, or discontinuous Pareto fronts. This limitation arises because its crowding distance metric relies solely on local linear spacing, making it prone to issues such as the loss of boundary solutions or local redundant clustering. To address this problem, this paper proposes an improved NSGA-II algorithm, whose core mechanism is the introduction of a dynamic average distance selection strategy into the original framework. Instead of using the traditional local crowding distance metric, the proposed algorithm constructs an "influence rectangle" for each individual using a dynamic scaling factor. This transforms the occupancy relationship of individuals in the objective space into the degree of geometric overlap between these rectangles, enabling the identification and elimination of redundant individuals. Experiments are conducted using ZDT series test functions, and the Spacing (SP) indicator is employed to evaluate the distribution uniformity of the obtained solution sets. Simulation results demonstrate that, while maintaining good convergence, the SP indicator values of the improved algorithm on the ZDT1, ZDT2, and ZDT3 test functions are significantly reduced, with a decrease ranging from 56.10% to 59.10%. This fully verifies the effectiveness of the dynamic average distance strategy in enhancing the distribution uniformity of the solution set. When addressing problems with discontinuous and concave fronts, the algorithm exhibits excellent robustness and uniform distribution capability. By incorporating an adaptive geometric evaluation criterion, the improved NSGA-II algorithm provides more reliable and stable decision support for complex multi-objective optimization problems.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.

Le contrôle bibliographique ouvert

DOI retrouvé dans Crossref DOI retrouvé ; titre concordant.

Titre Crossref
Improving NSGA-II using a Dynamic Average Distance Selection Strategy
Date Crossref
01/01/2026
Éditeur
AI Publications
Type
journal-article

Ce recoupement confirme des métadonnées liées au DOI. Il ne confirme ni la méthode ni les conclusions de l’étude, et il ne compte pas comme une seconde source scientifique indépendante.

Les sujets associés

Advanced Multi-Objective Optimization AlgorithmsMetaheuristic Optimization Algorithms ResearchEvolutionary Algorithms and Applications

BNTIC News n’est pas le producteur de ces données. Les publications sont interrogées à la demande dans Crossref, OpenAIRE, DOAJ, Europe PMC, HAL, DataCite, AfricArXiv, ROR et la Banque mondiale, sans clé d’accès. OpenAlex reste optionnel. Aucun service payant n’est nécessaire et aucune donnée externe n’est enregistrée en base. Consulter les sources et leurs limites.