具有可变步长和双重预测策略的动态多目标进化算法

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
{"title":"具有可变步长和双重预测策略的动态多目标进化算法","authors":"","doi":"10.1016/j.future.2024.07.028","DOIUrl":null,"url":null,"abstract":"<div><p>The prediction strategy is a key method for solving dynamic multi-objective optimization problems (DMOPs), particularly the commonly used linear prediction strategy, which has an advantage in solving problems with regular changes. However, using the linear prediction strategy may have limited advantages in addressing problems with complex changes, as it may result in the loss of population diversity. To tackle this issue, this paper proposes a dynamic multi-objective optimization algorithm with variable stepsize and dual prediction strategies (VSDPS), which aims to maintain population diversity while making predictions. When an environmental change is detected, the variable stepsize is first calculated. The stepsize of the nondominated solutions is expressed by the centroid of the population, while the stepsize of the dominated solutions is determined by the centroids of the clustered subpopulations. Then, the dual prediction strategies combine an improved linear prediction strategy with a dynamic particle swarm prediction strategy to track the new Pareto-optimal front (PF) or Pareto-optimal set (PS). The improved linear prediction strategy aims to enhance the convergence of the population, while the dynamic particle swarm prediction strategy focuses on preserving the diversity of the population. There have also been some improvements made in the static optimization phase, which are advantageous for both population convergence and diversity. VSDPS is compared with six state-of-the-art dynamic multi-objective evolutionary algorithms (DMOEAs) on 28 test instances. The experimental results demonstrate that VSDPS outperforms the compared algorithms in most instances.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic multi-objective evolutionary algorithm with variable stepsize and dual prediction strategies\",\"authors\":\"\",\"doi\":\"10.1016/j.future.2024.07.028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The prediction strategy is a key method for solving dynamic multi-objective optimization problems (DMOPs), particularly the commonly used linear prediction strategy, which has an advantage in solving problems with regular changes. However, using the linear prediction strategy may have limited advantages in addressing problems with complex changes, as it may result in the loss of population diversity. To tackle this issue, this paper proposes a dynamic multi-objective optimization algorithm with variable stepsize and dual prediction strategies (VSDPS), which aims to maintain population diversity while making predictions. When an environmental change is detected, the variable stepsize is first calculated. The stepsize of the nondominated solutions is expressed by the centroid of the population, while the stepsize of the dominated solutions is determined by the centroids of the clustered subpopulations. Then, the dual prediction strategies combine an improved linear prediction strategy with a dynamic particle swarm prediction strategy to track the new Pareto-optimal front (PF) or Pareto-optimal set (PS). The improved linear prediction strategy aims to enhance the convergence of the population, while the dynamic particle swarm prediction strategy focuses on preserving the diversity of the population. There have also been some improvements made in the static optimization phase, which are advantageous for both population convergence and diversity. VSDPS is compared with six state-of-the-art dynamic multi-objective evolutionary algorithms (DMOEAs) on 28 test instances. The experimental results demonstrate that VSDPS outperforms the compared algorithms in most instances.</p></div>\",\"PeriodicalId\":55132,\"journal\":{\"name\":\"Future Generation Computer Systems-The International Journal of Escience\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.2000,\"publicationDate\":\"2024-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Computer Systems-The International Journal of Escience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167739X24003819\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X24003819","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

预测策略是解决动态多目标优化问题(DMOPs)的关键方法,尤其是常用的线性预测策略,在解决有规律变化的问题时具有优势。然而,在解决复杂变化的问题时,使用线性预测策略的优势可能有限,因为它可能导致种群多样性的丧失。为解决这一问题,本文提出了一种具有可变步长和双重预测策略(VSDPS)的动态多目标优化算法,其目的是在进行预测的同时保持种群多样性。当检测到环境变化时,首先计算可变步长。非优势解的步长由种群的中心点表示,而优势解的步长由聚类子群的中心点决定。然后,双重预测策略将改进的线性预测策略与动态粒子群预测策略相结合,以跟踪新的帕累托最优前沿(PF)或帕累托最优集(PS)。改进的线性预测策略旨在提高种群的收敛性,而动态粒子群预测策略则侧重于保持种群的多样性。静态优化阶段也做了一些改进,这对群体收敛性和多样性都有好处。VSDPS 与六种最先进的动态多目标进化算法(DMOEAs)在 28 个测试实例上进行了比较。实验结果表明,VSDPS 在大多数情况下都优于所比较的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A dynamic multi-objective evolutionary algorithm with variable stepsize and dual prediction strategies

The prediction strategy is a key method for solving dynamic multi-objective optimization problems (DMOPs), particularly the commonly used linear prediction strategy, which has an advantage in solving problems with regular changes. However, using the linear prediction strategy may have limited advantages in addressing problems with complex changes, as it may result in the loss of population diversity. To tackle this issue, this paper proposes a dynamic multi-objective optimization algorithm with variable stepsize and dual prediction strategies (VSDPS), which aims to maintain population diversity while making predictions. When an environmental change is detected, the variable stepsize is first calculated. The stepsize of the nondominated solutions is expressed by the centroid of the population, while the stepsize of the dominated solutions is determined by the centroids of the clustered subpopulations. Then, the dual prediction strategies combine an improved linear prediction strategy with a dynamic particle swarm prediction strategy to track the new Pareto-optimal front (PF) or Pareto-optimal set (PS). The improved linear prediction strategy aims to enhance the convergence of the population, while the dynamic particle swarm prediction strategy focuses on preserving the diversity of the population. There have also been some improvements made in the static optimization phase, which are advantageous for both population convergence and diversity. VSDPS is compared with six state-of-the-art dynamic multi-objective evolutionary algorithms (DMOEAs) on 28 test instances. The experimental results demonstrate that VSDPS outperforms the compared algorithms in most instances.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信