Aug 2026· Journal of King Saud University: Computer and Information Sciences· Vol 38· 0 citations· 45 references
TL;DR
An objective-wise variable analysis method that first evaluates the sensitivity of each objective to all decision variables, and then comprehensively aggregates the sensitivity information across multiple objectives to estimate the overall importance of decision variables is proposed.
Abstract
Sparse large-scale multiobjective optimization problems are widely encountered in scientific research and engineering applications. However, the enormous search space and the intrinsic sparsity of the Pareto-optimal solutions substantially increase the difficulty of the optimization process. Different from existing approaches that directly rely on all objective values, this paper proposes an objective-wise variable analysis method. Specifically, the analysis method first evaluates the sensitivity of each objective to all decision variables, and then comprehensively aggregates the sensitivity information across multiple objectives to estimate the overall importance of decision variables. As a result, critical variables can be accurately identified to generate initial population, enabling the population to focus on the critical decision subspace efficiently. Furthermore, a non-coordinated mask-real evolution strategy is proposed to fully exploit the potential of mask vector and reduce the interference of real vectors. In this strategy, mask vector and real component evolve at separate update frequencies. This non-coordinate updating mechanism enables the mask structure to better match the corresponding real number vector. Experimental results demonstrate that the proposed algorithm significantly outperforms several state-of-the-art algorithms on the SMOP benchmark suite and exhibits promising potential in four practical real-world applications.
A new initialization method capable of generating scores that accurately reflect the importance of variables, and an initial mask vector template that can locate nonzero variables are proposed, leading to the generation of a high-quality initial population.
Jia-Lin Mai, Min-Rong Chen, Guoqiang Zeng et al.· arXiv.org· 0 citations
This study introduces a novel constrained multi-objective evolutionary algorithm, termed DPCME, which employs two interacting populations that exchange information, enabling effective global exploration and reducing the risk of convergence to local optima.
A heterogeneous population co-evolutionary algorithm (HPCEA) tailored for sparse LSMOPs is proposed, and extensive experiments against six state-of-the-art algorithms across eight benchmark suites and three real-world scenarios demonstrate HPCEA’s superiority.
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.· Journal of Heuristics· 0 citations
By employing a difficulty-aware weighting scheme, the approach biases aggregation toward higher-dimensional instances, enabling a more discriminative assessment of scalability, robustness, and performance.
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Annual Conference on Genetic...· 0 citations
This work presents an enhanced multi-objective dung beetle optimization algorithm that is implemented to tackle the multi-objective path planning optimization problem for mobile robot, and numerical simulation results verify that the method achieves sound performance in resolving practical engineering issues.