.png){kind=icon}
.png){kind=icon}
Return
Learning-driven computational resource scheduling for many-objective evolutionary optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2026.134046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many-objective evolutionary optimization can be viewed as a population-based learning process, yet learning effective search behaviors becomes increasingly difficult as the number of objectives grows due to weakened selection pressure, severe crowding, and limited computational resources. To address this challenge, this paper proposes a learning-driven coevolutionary framework with adaptive computational resource allocation for many-objective optimization. A high-dimensional projection-based coordinate mapping mechanism is introduced to obtain compact learning representations of the Pareto front distribution. Based on this representation, a crowding entropy indicator is developed to capture both local density and global distribution characteristics, enabling population-level structural learning. Leveraging the learned information, a parameter-free computational resource scheduling strategy is designed to adaptively allocate search effort to more informative regions in the objective space, achieving an effective balance between exploration and exploitation. Experimental results on benchmark many-objective problems demonstrate that the proposed approach consistently improves convergence and diversity under limited computational budgets compared with several state-of-the-art algorithms.
Keywords:
many-objective evolutionary optimization
learning-driven coevolutionary framework
adaptive computational resource allocation
crowding entropy indicator
Pareto front distribution
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W