基于遗传算法的自适应计划系统进化策略

Hieu Pham, Sousuke Tooyama, H. Hasegawa
{"title":"基于遗传算法的自适应计划系统进化策略","authors":"Hieu Pham, Sousuke Tooyama, H. Hasegawa","doi":"10.1299/JCST.6.129","DOIUrl":null,"url":null,"abstract":"A new method of Adaptive Plan system with Genetic Algorithm called APGA is proposed to reduce a large amount of calculation cost and to improve a stability in convergence to an optimal solution for multi-peak optimization problems with multidimensions. This is an approach that combines the global search ability of Genetic Algorithm (GA) and the local search ability of Adaptive Plan (AP). The APGA differs from GAs in handling design variable vectors (DVs). GAs generally encode DVs into genes and handle them through GA operators. However, the APGA encodes control variable vectors (CVs) of AP, which searches for local optimum, into its genes. CVs determine the global behavior of AP, and DVs are handled by AP in the optimization process of APGA. In this paper, we introduce some strategies using APGA to solve a huge scale of optimization problem and to improve the convergence towards the optimal solution. These methodologies are applied to several benchmark functions with multi-dimensions to evaluate its performance. We confirmed satisfactory performance through various benchmark tests.","PeriodicalId":196913,"journal":{"name":"Journal of Computational Science and Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Evolutionary Strategies of Adaptive Plan System with Genetic Algorithm\",\"authors\":\"Hieu Pham, Sousuke Tooyama, H. Hasegawa\",\"doi\":\"10.1299/JCST.6.129\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new method of Adaptive Plan system with Genetic Algorithm called APGA is proposed to reduce a large amount of calculation cost and to improve a stability in convergence to an optimal solution for multi-peak optimization problems with multidimensions. This is an approach that combines the global search ability of Genetic Algorithm (GA) and the local search ability of Adaptive Plan (AP). The APGA differs from GAs in handling design variable vectors (DVs). GAs generally encode DVs into genes and handle them through GA operators. However, the APGA encodes control variable vectors (CVs) of AP, which searches for local optimum, into its genes. CVs determine the global behavior of AP, and DVs are handled by AP in the optimization process of APGA. In this paper, we introduce some strategies using APGA to solve a huge scale of optimization problem and to improve the convergence towards the optimal solution. These methodologies are applied to several benchmark functions with multi-dimensions to evaluate its performance. We confirmed satisfactory performance through various benchmark tests.\",\"PeriodicalId\":196913,\"journal\":{\"name\":\"Journal of Computational Science and Technology\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1299/JCST.6.129\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1299/JCST.6.129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

针对具有多维度的多峰优化问题,提出了一种基于遗传算法的自适应规划系统(APGA)的新方法,减少了大量的计算量,提高了收敛到最优解的稳定性。该方法结合了遗传算法的全局搜索能力和自适应计划的局部搜索能力。APGA在处理设计变量向量(DVs)方面与GAs不同。遗传算法通常将dv编码到基因中,并通过遗传算子对其进行处理。然而,APGA将搜索局部最优的AP的控制变量向量(cv)编码到其基因中。cv决定AP的全局行为,在APGA优化过程中,dv由AP处理。在本文中,我们介绍了一些使用APGA来解决大规模优化问题的策略,并提高了向最优解的收敛性。将这些方法应用于几个多维基准函数,以评估其性能。我们通过各种基准测试确认了令人满意的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evolutionary Strategies of Adaptive Plan System with Genetic Algorithm
A new method of Adaptive Plan system with Genetic Algorithm called APGA is proposed to reduce a large amount of calculation cost and to improve a stability in convergence to an optimal solution for multi-peak optimization problems with multidimensions. This is an approach that combines the global search ability of Genetic Algorithm (GA) and the local search ability of Adaptive Plan (AP). The APGA differs from GAs in handling design variable vectors (DVs). GAs generally encode DVs into genes and handle them through GA operators. However, the APGA encodes control variable vectors (CVs) of AP, which searches for local optimum, into its genes. CVs determine the global behavior of AP, and DVs are handled by AP in the optimization process of APGA. In this paper, we introduce some strategies using APGA to solve a huge scale of optimization problem and to improve the convergence towards the optimal solution. These methodologies are applied to several benchmark functions with multi-dimensions to evaluate its performance. We confirmed satisfactory performance through various benchmark tests.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信