当前位置: X-MOL 学术Expert Syst. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dynamic group optimization algorithm with a mean–variance search framework
Expert Systems with Applications ( IF 8.5 ) Pub Date : 2021-06-15 , DOI: 10.1016/j.eswa.2021.115434
Rui Tang , Jie Yang , Simon Fong , Raymond Wong , Athanasios V. Vasilakos , Yu Chen

Dynamic group optimization has recently appeared as a novel algorithm developed to mimic animal and human socialising behaviours. Although the algorithm strongly lends itself to exploration and exploitation, it has two main drawbacks. The first is that the greedy strategy, used in the dynamic group optimization algorithm, guarantees to evolve a generation of solutions without deteriorating than the previous generation but decreases population diversity and limit searching ability. The second is that most information for updating populations is obtained from companions within each group, which leads to premature convergence and deteriorated mutation operators. The dynamic group optimization with a mean–variance search framework is proposed to overcome these two drawbacks, an improved algorithm with a proportioned mean solution generator and a mean–variance Gaussian mutation. The new proportioned mean solution generator solutions do not only consider their group but also are affected by the current solution and global situation. The mean–variance Gaussian mutation takes advantage of information from all group heads, not solely concentrating on information from the best solution or one group. The experimental results on public benchmark test suites show that the proposed algorithm is effective and efficient. In addition, comparative results of engineering problems in welded beam design show the promise of our algorithms for real-world applications.



中文翻译:

具有均值方差搜索框架的动态组优化算法

动态群组优化最近作为一种新算法出现,旨在模仿动物和人类的社交行为。尽管该算法非常适合探索和利用,但它有两个主要缺点。首先是动态群优化算法中使用的贪心策略,保证进化出一代解而不比上一代变差,但降低了种群多样性并限制了搜索能力。第二个是更新种群的大部分信息是从每个组内的同伴那里获得的,这导致过早收敛和恶化的变异算子。提出了具有均值方差搜索框架的动态组优化来克服这两个缺点,一种具有比例平均解生成器和平均方差高斯突变的改进算法。新的比例均值解生成器解不仅考虑了它们的组,还受当前解和全局情况的影响。均值-方差高斯变异利用来自所有组长的信息,而不仅仅集中于来自最佳解决方案或一组的信息。在公共基准测试套件上的实验结果表明,该算法是有效且高效的。此外,焊接梁设计中工程问题的比较结果显示了我们的算法在实际应用中的前景。新的比例均值解生成器解不仅考虑了它们的组,还受当前解和全局情况的影响。均值-方差高斯变异利用来自所有组长的信息,而不仅仅集中于来自最佳解决方案或一组的信息。在公共基准测试套件上的实验结果表明,该算法是有效且高效的。此外,焊接梁设计中工程问题的比较结果显示了我们的算法在实际应用中的前景。新的比例均值解生成器解不仅考虑了它们的组,还受当前解和全局情况的影响。均值-方差高斯变异利用来自所有组长的信息,而不仅仅集中于来自最佳解决方案或一组的信息。在公共基准测试套件上的实验结果表明,该算法是有效且高效的。此外,焊接梁设计中工程问题的比较结果显示了我们的算法在实际应用中的前景。在公共基准测试套件上的实验结果表明,该算法是有效且高效的。此外,焊接梁设计中工程问题的比较结果显示了我们的算法在实际应用中的前景。在公共基准测试套件上的实验结果表明,该算法是有效且高效的。此外,焊接梁设计中工程问题的比较结果显示了我们的算法在实际应用中的前景。

更新日期:2021-06-20
down
wechat
bug