Comparison study of genetic algorithm and evolutionary programming
Comparison study of genetic algorithm and evolutionary programming
复制标题
DOI：
10.1109/icmlc.2004.1380654
复制
发表时间：
2004-08
期刊：
影响因子：
--
通讯作者：
Wei Gao
中科院分区：
文献类型：
--
作者：
Wei Gao
遗传算法和进化规划是两种常用的进化算法。由于它们的起源不同，在生物学基础、算法操作等操作细节上也存在着很大的差异。因此，这两种算法的性能是不同的。从理论上对这些差异进行了全面的分析，并通过仿真实验揭示了这些差异.结果表明，进化规划算法的性能优于遗传算法，更适合于实际应用。
Genetic algorithm and evolutionary programming are two generally used evolutionary algorithms. Due to the difference of their origin, there are a lot of differences between their biologic bases, algorithm operation and some other operational details. So, the performances of the two algorithms are different. These differences are analyzed comprehensively by theory and revealed by simulation experiments. The results show that the performance of evolutionary programming is better than that of genetic algorithm and the evolutionary programming is more suitable for practical applications.