MGCHMO:利用考奇和高斯突变的动态微分人类记忆优化法解决工程问题

IF 4 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Advances in Engineering Software Pub Date : 2024-10-22 DOI:10.1016/j.advengsoft.2024.103793
Jialing Yan , Gang Hu , Bin Shu
{"title":"MGCHMO:利用考奇和高斯突变的动态微分人类记忆优化法解决工程问题","authors":"Jialing Yan ,&nbsp;Gang Hu ,&nbsp;Bin Shu","doi":"10.1016/j.advengsoft.2024.103793","DOIUrl":null,"url":null,"abstract":"<div><div>The Human Memory Optimization (HMO) algorithm is a newly released metaheuristic algorithm based on humans in 2023, which can effectively solve most optimization problems. However, when dealing with complex optimization problems, HMO has limitations such as insufficient convergence accuracy and susceptibility to local optimal solutions. To this end, we integrated chaotic mapping, Cauchy mutation, Gaussian mutation, differential mutation, and parameter dynamic adjustment strategies into the original algorithm and developed an enhanced MGCHMO algorithm. Firstly, in the initialization phase of the MGCHMO, the Tent mapping chaotic mapping mechanism is introduced to enhance the diversity and search ability of the initial population through the traversal and randomness characteristics of chaos. Secondly, in the memory generation phase, we added the Cauchy mutation strategy, which effectively expanded the search range of the algorithm, helped the algorithm escape from local optima, and explored a broader solution space. Then, during the recall phase, Gaussian mutation and differential mutation are added. Among them, Gaussian mutation enables the algorithm to perform more refined searches within a local range. Differential mutation, on the other hand, guides the algorithm to explore towards a more optimal solution through the information of individual differences. Finally, the parameters of the algorithm are dynamically adjusted to enhance its optimization performance, ensuring that the algorithm maintains optimal search performance at different phases, thereby accelerating the convergence process and improving the quality of the solution.</div><div>To verify the optimization performance of MGCHMO, we conducted a series of detailed performance experiments on three different test sets: CEC2017, CEC2020, and CEC2022. The results showed that MGCHMO has higher convergence and stability. In addition, we tested the applicability of MGCHMO on 30 engineering examples, topology optimization design, aerospace orbit optimization, and curve shape optimization, and the results further demonstrated the significant application capability and feasibility of MGCHMO.</div></div>","PeriodicalId":50866,"journal":{"name":"Advances in Engineering Software","volume":"198 ","pages":"Article 103793"},"PeriodicalIF":4.0000,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MGCHMO: A dynamic differential human memory optimization with Cauchy and Gauss mutation for solving engineering problems\",\"authors\":\"Jialing Yan ,&nbsp;Gang Hu ,&nbsp;Bin Shu\",\"doi\":\"10.1016/j.advengsoft.2024.103793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The Human Memory Optimization (HMO) algorithm is a newly released metaheuristic algorithm based on humans in 2023, which can effectively solve most optimization problems. However, when dealing with complex optimization problems, HMO has limitations such as insufficient convergence accuracy and susceptibility to local optimal solutions. To this end, we integrated chaotic mapping, Cauchy mutation, Gaussian mutation, differential mutation, and parameter dynamic adjustment strategies into the original algorithm and developed an enhanced MGCHMO algorithm. Firstly, in the initialization phase of the MGCHMO, the Tent mapping chaotic mapping mechanism is introduced to enhance the diversity and search ability of the initial population through the traversal and randomness characteristics of chaos. Secondly, in the memory generation phase, we added the Cauchy mutation strategy, which effectively expanded the search range of the algorithm, helped the algorithm escape from local optima, and explored a broader solution space. Then, during the recall phase, Gaussian mutation and differential mutation are added. Among them, Gaussian mutation enables the algorithm to perform more refined searches within a local range. Differential mutation, on the other hand, guides the algorithm to explore towards a more optimal solution through the information of individual differences. Finally, the parameters of the algorithm are dynamically adjusted to enhance its optimization performance, ensuring that the algorithm maintains optimal search performance at different phases, thereby accelerating the convergence process and improving the quality of the solution.</div><div>To verify the optimization performance of MGCHMO, we conducted a series of detailed performance experiments on three different test sets: CEC2017, CEC2020, and CEC2022. The results showed that MGCHMO has higher convergence and stability. In addition, we tested the applicability of MGCHMO on 30 engineering examples, topology optimization design, aerospace orbit optimization, and curve shape optimization, and the results further demonstrated the significant application capability and feasibility of MGCHMO.</div></div>\",\"PeriodicalId\":50866,\"journal\":{\"name\":\"Advances in Engineering Software\",\"volume\":\"198 \",\"pages\":\"Article 103793\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Engineering Software\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S096599782400200X\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Engineering Software","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S096599782400200X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

人类记忆优化算法(HMO)是 2023 年新发布的一种基于人类的元启发式算法,可以有效解决大多数优化问题。然而,在处理复杂的优化问题时,HMO存在收敛精度不够、易出现局部最优解等局限性。为此,我们将混沌映射、考奇突变、高斯突变、微分突变、参数动态调整等策略集成到原算法中,开发了增强型MGCHMO算法。首先,在MGCHMO的初始化阶段,引入了Tent映射混沌映射机制,通过混沌的遍历性和随机性增强初始种群的多样性和搜索能力。其次,在记忆生成阶段,我们加入了 Cauchy 突变策略,有效地扩大了算法的搜索范围,帮助算法摆脱局部最优,探索更广阔的解空间。然后,在召回阶段,增加了高斯突变和微分突变。其中,高斯突变能让算法在局部范围内进行更精细的搜索。而差分突变则通过个体差异信息引导算法探索更优化的解决方案。最后,对算法参数进行动态调整,以提高其优化性能,确保算法在不同阶段保持最佳搜索性能,从而加快收敛过程,提高解的质量。为了验证 MGCHMO 的优化性能,我们在三个不同的测试集上进行了一系列详细的性能实验:为了验证 MGCHMO 的优化性能,我们在三个不同的测试集上进行了一系列详细的性能实验:CEC2017、CEC2020 和 CEC2022。结果表明,MGCHMO 具有更高的收敛性和稳定性。此外,我们还在 30 个工程实例、拓扑优化设计、航空航天轨道优化和曲线形状优化中测试了 MGCHMO 的适用性,结果进一步证明了 MGCHMO 的显著应用能力和可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MGCHMO: A dynamic differential human memory optimization with Cauchy and Gauss mutation for solving engineering problems
The Human Memory Optimization (HMO) algorithm is a newly released metaheuristic algorithm based on humans in 2023, which can effectively solve most optimization problems. However, when dealing with complex optimization problems, HMO has limitations such as insufficient convergence accuracy and susceptibility to local optimal solutions. To this end, we integrated chaotic mapping, Cauchy mutation, Gaussian mutation, differential mutation, and parameter dynamic adjustment strategies into the original algorithm and developed an enhanced MGCHMO algorithm. Firstly, in the initialization phase of the MGCHMO, the Tent mapping chaotic mapping mechanism is introduced to enhance the diversity and search ability of the initial population through the traversal and randomness characteristics of chaos. Secondly, in the memory generation phase, we added the Cauchy mutation strategy, which effectively expanded the search range of the algorithm, helped the algorithm escape from local optima, and explored a broader solution space. Then, during the recall phase, Gaussian mutation and differential mutation are added. Among them, Gaussian mutation enables the algorithm to perform more refined searches within a local range. Differential mutation, on the other hand, guides the algorithm to explore towards a more optimal solution through the information of individual differences. Finally, the parameters of the algorithm are dynamically adjusted to enhance its optimization performance, ensuring that the algorithm maintains optimal search performance at different phases, thereby accelerating the convergence process and improving the quality of the solution.
To verify the optimization performance of MGCHMO, we conducted a series of detailed performance experiments on three different test sets: CEC2017, CEC2020, and CEC2022. The results showed that MGCHMO has higher convergence and stability. In addition, we tested the applicability of MGCHMO on 30 engineering examples, topology optimization design, aerospace orbit optimization, and curve shape optimization, and the results further demonstrated the significant application capability and feasibility of MGCHMO.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Advances in Engineering Software
Advances in Engineering Software 工程技术-计算机:跨学科应用
CiteScore
7.70
自引率
4.20%
发文量
169
审稿时长
37 days
期刊介绍: The objective of this journal is to communicate recent and projected advances in computer-based engineering techniques. The fields covered include mechanical, aerospace, civil and environmental engineering, with an emphasis on research and development leading to practical problem-solving. The scope of the journal includes: • Innovative computational strategies and numerical algorithms for large-scale engineering problems • Analysis and simulation techniques and systems • Model and mesh generation • Control of the accuracy, stability and efficiency of computational process • Exploitation of new computing environments (eg distributed hetergeneous and collaborative computing) • Advanced visualization techniques, virtual environments and prototyping • Applications of AI, knowledge-based systems, computational intelligence, including fuzzy logic, neural networks and evolutionary computations • Application of object-oriented technology to engineering problems • Intelligent human computer interfaces • Design automation, multidisciplinary design and optimization • CAD, CAE and integrated process and product development systems • Quality and reliability.
期刊最新文献
Refined finite element analysis of helical wire ropes under multi-axial dynamic loading An engineering-oriented Shallow-water Hydro-Sediment-Morphodynamic model using the GPU-acceleration and the hybrid LTS/GMaTS method Dimensionality reduction of solution reconstruction methods for a four-point stencil Stress-constrained topology optimization of geometrically nonlinear continuum structures by using parallel computing strategy .A multi-objective search-based approach for position and orientation deviations in assemblies with multiple non-ideal surfaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1