混沌遗传模拟退火混合算法

X. Bai, H.M. Yang, L.T. Li, H.Y. Shu
{"title":"混沌遗传模拟退火混合算法","authors":"X. Bai, H.M. Yang, L.T. Li, H.Y. Shu","doi":"10.1109/GSIS.2009.5408146","DOIUrl":null,"url":null,"abstract":"On the basis of analyzing the major advantages and disadvantages of the chaos, genetic and simulated annealing algorithms, the chaos genetic simulated annealing hybrid algorithm is presented according to the complementary advantages strategy. The basic thought is initializing the initial population of genetic algorithm with chaos variables, and then calculating by genetic simulated annealing method, at last adding a disturbance to the chromosomes whose fitness are smaller with the chaos method. The result indicates that the algorithm has strong global searching capability and quick speed on converging to the optimal solution.","PeriodicalId":294363,"journal":{"name":"2009 IEEE International Conference on Grey Systems and Intelligent Services (GSIS 2009)","volume":"2 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A chaos genetic simulated annealing hybrid algorithm\",\"authors\":\"X. Bai, H.M. Yang, L.T. Li, H.Y. Shu\",\"doi\":\"10.1109/GSIS.2009.5408146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"On the basis of analyzing the major advantages and disadvantages of the chaos, genetic and simulated annealing algorithms, the chaos genetic simulated annealing hybrid algorithm is presented according to the complementary advantages strategy. The basic thought is initializing the initial population of genetic algorithm with chaos variables, and then calculating by genetic simulated annealing method, at last adding a disturbance to the chromosomes whose fitness are smaller with the chaos method. The result indicates that the algorithm has strong global searching capability and quick speed on converging to the optimal solution.\",\"PeriodicalId\":294363,\"journal\":{\"name\":\"2009 IEEE International Conference on Grey Systems and Intelligent Services (GSIS 2009)\",\"volume\":\"2 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Grey Systems and Intelligent Services (GSIS 2009)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GSIS.2009.5408146\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Grey Systems and Intelligent Services (GSIS 2009)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GSIS.2009.5408146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在分析混沌、遗传和模拟退火算法主要优缺点的基础上,根据优势互补策略提出了混沌遗传模拟退火混合算法。其基本思想是用混沌变量初始化遗传算法的初始种群,然后用遗传模拟退火法进行计算,最后用混沌法对适应度较小的染色体进行扰动。结果表明,该算法具有较强的全局搜索能力,收敛到最优解的速度较快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A chaos genetic simulated annealing hybrid algorithm
On the basis of analyzing the major advantages and disadvantages of the chaos, genetic and simulated annealing algorithms, the chaos genetic simulated annealing hybrid algorithm is presented according to the complementary advantages strategy. The basic thought is initializing the initial population of genetic algorithm with chaos variables, and then calculating by genetic simulated annealing method, at last adding a disturbance to the chromosomes whose fitness are smaller with the chaos method. The result indicates that the algorithm has strong global searching capability and quick speed on converging to the optimal solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信