Skip to content

A Two-Stage Many-Objective Evolutionary Algorithm with Survival-Ratio-Based Switching

Sep 2026 · International journal of software engineering and knowledge engineering · pp. 1-40 · 0 citations

TL;DR

TSEA-SR is proposed, a two-stage MaOEA with survival-ratio-based switching, in which the stage transition is determined by offspring survival after environmental selection, and the results demonstrate the competitive performance of TSEA-SR across the evaluated problems.

Abstract

Many-objective optimization problems (MaOPs) suffer from weakened selection pressure as the number of objectives increases, making it difficult to balance convergence and diversity. Existing two-stage and multi-stage many-objective evolutionary algorithms (MaOEAs) often determine stage transitions using preset schedules or indirect population criteria that may not reflect changes in search productivity. This paper proposes TSEA-SR, a two-stage MaOEA with survival-ratio-based switching, in which the stage transition is determined by offspring survival after environmental selection. Candidate solutions are first pre-screened according to the hyper-dominance degree. The first stage uses the Euclidean norm to promote centripetal convergence, whereas the second uses the harmonic mean to expand coverage of boundary and extreme regions. Pre-screening and competition organized by reference vectors are retained throughout the search, and the transition is triggered only when low offspring survival persists across generations. Experiments on 80 benchmark instances and 12 real-world combinatorial optimization instances compare TSEA-SR with six state-of-the-art MaOEAs. The results demonstrate the competitive performance of TSEA-SR across the evaluated problems, while ablation studies further support the complementary roles of the two stages and the effectiveness of determining the transition from offspring survival.

View source

Similar papers

Open access Sep 2026

A two-stage pareto selection strategy with compromise programming for the DIRECT algorithm

A novel DIRECT-type algorithm employing a parameterized Pareto approach is proposed for box-constrained optimization problems. The method features a two-stage Pareto selection process. The first stage focuses on global exploration, using a parameter to identify the smallest significant hyperrectangle, which helps avoid...

Mira Mustika, Salmah Salmah, Indarsih Indarsih · 0 citations
Open access Aug 2026

A general hybrid framework for many-objective optimization: integrating local search into reference-vector-based evolutionary algorithms

Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...

Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al. · 0 citations
Conference Open access Jul 2026

An Unbounded Archive-Based Transfer Strategy for Dynamic Multi-Objective Optimization with a Changing Number of Objectives

Dynamic multi-objective optimization with a variable number of objectives is difficult because objectivedimensional variations may significantly change the Pareto front and degrade algorithm adaptability. This paper proposes an unbounded archive-based transfer strategy (UATS), which maintains an unbounded archive of of...

Zhi-Yun Xiao, Ke Shang, Ya-Jun Liu et al. · 0 citations
Open access Oct 2026

An Algorithm for Large-Scale Multi-Objective Optimization Problems Digital Twin-Multi-Layer Cooperative Evolutionary Algorithm

Large-scale multi-objective optimization problems involve high-dimensional decision variables, vast search spaces, and conflicting objectives, which often lead to slow convergence, premature convergence, and poorly distributed solutions when conventional evolutionary algorithms operate under limited evaluation budgets....

De-Lu Li, Feng-Ying Gou, Can Cui et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.