基于hK1三角剖分的改进遗传算法

Jingjun Zhang, Yanmin Shang, Ruizhen Gao, Yuzhen Dong
{"title":"基于hK1三角剖分的改进遗传算法","authors":"Jingjun Zhang, Yanmin Shang, Ruizhen Gao, Yuzhen Dong","doi":"10.1109/FITME.2008.158","DOIUrl":null,"url":null,"abstract":"An improved genetic algorithm based on the hK1 triangulation is proposed for optimization of dual multimodal function. With this algorithm, the optimal problems converse to solution of fixed point problems. The minimum points can be distinguished by using the Hessian Matrix. The test results of many typical functions indicated that the algorithm is valid and highly effective.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Genetic Algorithm Based on hK1 Triangulation\",\"authors\":\"Jingjun Zhang, Yanmin Shang, Ruizhen Gao, Yuzhen Dong\",\"doi\":\"10.1109/FITME.2008.158\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An improved genetic algorithm based on the hK1 triangulation is proposed for optimization of dual multimodal function. With this algorithm, the optimal problems converse to solution of fixed point problems. The minimum points can be distinguished by using the Hessian Matrix. The test results of many typical functions indicated that the algorithm is valid and highly effective.\",\"PeriodicalId\":218182,\"journal\":{\"name\":\"2008 International Seminar on Future Information Technology and Management Engineering\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Seminar on Future Information Technology and Management Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FITME.2008.158\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Seminar on Future Information Technology and Management Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FITME.2008.158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于hK1三角剖分的改进遗传算法,用于双多模态函数的优化。该算法将最优问题转化为不动点问题的求解。最小点可以用Hessian矩阵来区分。多个典型函数的测试结果表明,该算法是有效的、高效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Genetic Algorithm Based on hK1 Triangulation
An improved genetic algorithm based on the hK1 triangulation is proposed for optimization of dual multimodal function. With this algorithm, the optimal problems converse to solution of fixed point problems. The minimum points can be distinguished by using the Hessian Matrix. The test results of many typical functions indicated that the algorithm is valid and highly effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信