计算机科学
强化学习
线性子空间
数学优化
资源配置
子空间拓扑
帕累托原理
人工智能
数学
几何学
计算机网络
作者
Qianlong Dang,Wei Xu,Yangfei Yuan
标识
DOI:10.1007/s11633-022-1314-7
摘要
Many isolation approaches, such as zoning search, have been proposed to preserve the diversity in the decision space of multimodal multi-objective optimization (MMO). However, these approaches allocate the same computing resources for subspaces with different difficulties and evolution states. In order to solve this issue, this paper proposes a dynamic resource allocation strategy (DRAS) with reinforcement learning for multimodal multi-objective optimization problems (MMOPs). In DRAS, relative contribution and improvement are utilized to define the aptitude of subspaces, which can capture the potentials of subspaces accurately. Moreover, the reinforcement learning method is used to dynamically allocate computing resources for each subspace. In addition, the proposed DRAS is applied to zoning searches. Experimental results demonstrate that DRAS can effectively assist zoning search in finding more and better distributed equivalent Pareto optimal solutions in the decision space.
科研通智能强力驱动
Strongly Powered by AbleSci AI