摘要
以几个典型的函数优化问题为例,比较、分析几种不同策略下遗传算法的全局收敛性及收敛速度,发现了以往理论分析与实际问题之间的不一致,提出以寻找最优解或最优解组的角度衡量算法收敛性能的观点及标准,定义了一个更为直观地反映算法收敛过程的测度函数及部分在线特性。
The convergence of genetic algorithms is analyzed and demonstrated by several function optimization problems comparing with the differences of the performance of several different strategies, a discordance between practical problem and theory analysis is found, and then a new viewpoint is presented for weighing the performance of genetic algorithms. A convergence performance measure and a partial on-line performance are also defined.
出处
《控制与决策》
EI
CSCD
北大核心
1999年第3期257-260,264,共5页
Control and Decision
基金
国防预研基金
关键词
遗传算法
函数优化
收敛性
性能分析
genetic algorithms,function optimization, genetic algorithms, convergence