期刊文献+

基于存档和权值扩展的大规模多目标优化算法 被引量:7

Large-Scale Multi-Objective Optimization Algorithm Based on Archive and Weight Extension
下载PDF
导出
摘要 由于不同目标之间相互冲突且搜索空间巨大,现有大规模多目标优化算法的综合性能尚存在较大改进空间.为合理均衡算法的搜索效率与搜索质量,提升算法的综合性能,本文提出一种基于存档和权值扩展的大规模多目标优化算法(LSMOEA-AWE).该算法总体采用进化计算框架,基于大规模决策变量与小规模权值变量之间的问题转换进行求解.其核心是在进化过程中选取高质量代表性解及其对立点构建存档高效引导种群的进化方向,并引入权值扩展策略逐步扩大算法的搜索空间,在确保算法搜索效率的同时,提升搜索质量.为验证LSMOEA-AWE的有效性,将其与6个先进的大规模多目标优化算法在最新的大规模多目标基准测试问题集LSMOP上进行对比,实验结果表明LSMOEA-AWE对于大规模多目标优化问题的求解具有明显的竞争优势. Due to the conflict between different objectives and the huge search space,the comprehensive performance of existing large-scale multi-objective optimization algorithms still has large room for improvement.In order to balance the search efficiency and search quality reasonably,and improve the comprehensive performance of the algorithm,this paper proposes a large-scale multi-objective optimization algorithm based on archive and weight extension(LSMOEA-AWE).LSMOEA-AWE adopts the framework of evolutionary computation,and the problem transformation scheme between the large-scale decision variables and the small-scale weight variables.LSMOEA-AWE consists of two essential components.One is the archive strategy based on the high-quality representative solutions and their opposite points in each iteration,which can effectively guide the rational evolutionary direction of the population.The other is the weight extension strategy,which can gradually expand the search space of the algorithm.In order to verify its effectiveness,LSMOEA-AWE is compared with six state-of-the-art algorithms in large-scale multi-objective optimization on the latest test suite LSMOP.The experimental results show that LSMOEA-AWE has obvious competitive advantages in solving large-scale multi-objective optimization problems.
作者 梁正平 刘程 王志强 明仲 朱泽轩 LIANG Zheng-Ping;LIU Cheng;WANG Zhi-Qiang;MING Zhong;ZHU Ze-Xuan(School of Computer Science and Software Engineering,Shenzhen University,Shenzhen,Guangdong 518060)
出处 《计算机学报》 EI CAS CSCD 北大核心 2022年第5期951-972,共22页 Chinese Journal of Computers
基金 国家重点研发计划(2021YFB2900800) 国家自然科学基金(61871272) 广东省自然科学基金(2020A1515010479,2021A1515011911) 深圳市科技计划(GGFW2018020518310863,20200811181752003)资助。
关键词 大规模多目标优化 进化计算 问题转换 存档 权值扩展 large-scale multi-objective optimization evolutionary computation problem transformation archive weight extension
  • 相关文献

参考文献5

二级参考文献97

  • 1薛丰,顾根华.电熔镁砂生产的节能途径[J].节能,1996,15(6):44-46. 被引量:6
  • 2Zhang L J, Zhang J, Cai H. Services Computing. Beijing: Springer and Tsinghua University Press, 2007.
  • 3Li Y, Lin C. QoS-aware service composition for workflow- based data-intensive applieations//Proceedings of the 2011 IEEE International Conference on Web Services (ICWS 2011). Washington, USA, 2011:452-459.
  • 4Boyd S, Vandenberghe L. Convex Optimization. Cambridge, UK: Cambridge University Press, 2004.
  • 5Cormen T H, Leiserson C E, Rivest R L, Stein C. Introduction to Algorithms. MIT, USA: MIT Press, 2005.
  • 6Wada H, Champrasert P, Suzuki J, Oha K. Multiobjectrve optimization of SLA-aware service composition//Proceedings of the IEEE Congress on Services. Honolulu, USA, 2008: 368-375.
  • 7Zhou Z, Liu F, Jin H, et al. On arbitrating the power- performance tradeoff in SaaS clouds//Proceedings of the IEEE INFOCOM 2013. Turin, Italy, 2013:872-880.
  • 8Leitner P, Hummer W, Satzger B, et al. Cost-efficient and application SLA-aware client side request scheduling in an infrastructure-as-a-service cloud//Proceedings of the 2012 IEEE 5th International Conference on Cloud Computing (CLOUD 2012). Honolulu, USA, 2012:213-220.
  • 9Kong X, Lin C, Jiang Y, et al. Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction. Journal of Network and Computer Applications, 2011, 34(4) : 1068-1077.
  • 10Bessai K, Youcef S, Oulamara A, et al. Bi-criteria workflow tasks allocation and scheduling in cloud computing environ- ments//Proceedings of the 2012 IEEE 5th International Conference on Cloud Computing (CLOUD 2012). Honolulu, USA, 2012:638-645.

共引文献89

同被引文献35

引证文献7

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部