首页 | 官方网站   微博 | 高级检索  
     

一种改进的混沌优化算法
引用本文:费春国,韩正之.一种改进的混沌优化算法[J].控制理论与应用,2006,23(3):471-474.
作者姓名:费春国  韩正之
作者单位:上海交通大学,自动化系,上海,200030
摘    要:为了克服遗传算法的早熟现象以及混沌优化的搜索时间过长的缺点,将遗传算法、混沌优化和变尺度方法相结合,提出了一种改进的混沌优化算法.该算法利用混沌的随机性、遍历性和规律性来避免陷入局部极小值,从而也克服了遗传算法中的早熟现象,同时引入了变尺度方法提高该算法的搜索速度.本文还给出了算法的收敛性分析.对典型测试函数的仿真结果表明此算法优于变尺度混沌优化和遗传算法.

关 键 词:混沌优化  遗传算法  优化方法  变尺度
文章编号:1000-8152(2006)03-0471-04
收稿时间:3/5/2004 12:00:00 AM
修稿时间:2004-03-052005-11-28

An improved chaotic optimization algorithm
FEI Chun-guo,HAN Zheng-zhi.An improved chaotic optimization algorithm[J].Control Theory & Applications,2006,23(3):471-474.
Authors:FEI Chun-guo  HAN Zheng-zhi
Affiliation:Department of Automation,Shanghai Jiaotong University,Shanghai 200030,China
Abstract:To overcome premature convergence of genetic algorithm(GA) and long search time of chaotic optimization,an improved chaotic optimization algorithm(ICOA) is proposed by combining GA,chaotic optimization and mutative scale method.This algorithm uses chaotic characteristics-randomness,ergodicity and regularity to avoid trapping around local optima.It can overcome premature convergence of GA.At the same time,mutative scale method is introduced into the algorithm to improve search speed.The convergence analysis of algorithm is also given.Finally,the proposed algorithm is applied to solve some complex benchmark functions,and the simulations show the proposed algorithm can provide better performance than mutative scale chaotic algorithm and GA.
Keywords:chaotic optimization  genetic algorithms  optimization method  mutative scale method
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《控制理论与应用》浏览原始摘要信息
点击此处可从《控制理论与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号