This study systematically investigates multiple elitism mechanisms for NT within tree-based MO Genetic Programming (MOGP), including NSGA-II population replacement, crowding distance, first-objective, and a novel ideal-point strategy, comparing them against non-elitist NT and standard NSGA-II.
Abstract
Nested Tournament (NT) is a Multi-Objective (MO) selection method that enables fine-grained control of selection pressure through sequential single-objective tournaments. Although previously proposed, the impact of elitism strategies within NT remains largely unexplored. This study systematically investigates multiple elitism mechanisms for NT within tree-based MO Genetic Programming (MOGP), including NSGA-II population replacement, crowding distance, first-objective, and a novel ideal-point strategy, comparing them against non-elitist NT and standard NSGA-II. Experiments are conducted with up to five objectives for the accuracy-complexity trade-off and show that elitism design critically influences stability, efficiency, and semantic diversity. Notably, simpler NT-specific elitism strategies achieve comparable performance to NSGA-II at lower computational cost while better preserving semantic diversity. Overall, the findings highlight NT as an efficient MOGP alternative to selection methods based on Pareto Fronts.
This work investigates the hybridization of a Genetic Algorithm with Pareto Local Search to improve the exploration of non-dominated rulesets and provides a documented baseline for hybrid metaheuristics in rule mining.
Evgueni Blanquart, L. Jourdan, Nadarajen Veerapen· GECCO Companion· 0 citations
Large Language Models (LLMs) are opening new directions for automated heuristic design (AHD), allowing evolutionary methods to create and enhance heuristics for constrained optimization problems (COPs). However, most existing approaches face the challenge of the exploration-exploitation balance, where the evolution nee...
Nam Do Khanh, Nhat Nguyen Tran Minh, Dat Pham Vu Tuan et al.· Proceedings of the Genetic a...· 1 citation
This paper introduces the bi-objective problem class CLIMB and analyzes the runtime of GSEMO and the widely used NSGA-II on this problem, and proves that GSEMO and NSGA-II-DYN, a version of NSGA-II with dynamic population sizes, can find the Pareto front of CLIMB in expected fitness evaluations.
It is empirically demonstrate that per-variable stochastic deactivation, termed Individual Dropout (IDrop), significantly outperforms a standard GA on single-objective problems with exploitable global structure and improves convergence toward the theoretical Pareto front in multi-objective settings.
Daniele Ganci, L. Correia· Annual Conference on Genetic...· 0 citations
These findings confirm TS as a robust default choice for diverse optimization landscapes and provide new empirical evidence regarding the limited practical advantage of current adaptive strategies within GAs.
Husam S. Mashaqbeh, Putra Sumari, H. Mashagba et al.· International Journal of Adv...· 0 citations
Applied to five engineering optimization problems, modified momentum–leader–differential grey wolf optimizer consistently achieves the lowest objective values, while analytically proving its ability to navigate heavily penalized boundaries and satisfy all constraints.
Xin Su, Yichen Liu· Cluster Computing· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.