{"title":"MGCHMO:利用考奇和高斯突变的动态微分人类记忆优化法解决工程问题","authors":"Jialing Yan , Gang Hu , 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 , Gang Hu , 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}
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.
期刊介绍:
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.