基于网格法的遗传算法及其应用

基金项目:

国家自然科学基金资助课题(No.59705010)

详细信息

Genetic Algorithms Based on Grid and Its Application

1. Civil and Environment Engineering School, UST Beijing, Beijing 100083, China;
2. Shandong Institute of Technology, Zibo 255012, China

摘要: 在基本的遗传算法(SGA)中,初始群体是随机产生的.为了增加个体的遍历性和多样性提出一种用网格法来产生遗传算法的初始群体,并对网格法的遗传算法的优化效率进行了定量的评价.同时与基本的遗传算法一起应用在DeJong的测试函数F1上便于进行对比.评价结果和实验结果表明网格法在提高遗传算法的优化效率上是可行的.
- 遗传算法 /
- 网格法 /
- 优化算法
Abstract: In Simple Genetic Algorithms(SGA), chromosomes are produced at random. In order to increase the popularity and diversity of individuals, a new genetic algorithms which produces chromosomes with grid is proposed, and its optimization efficiency is evaluated quantitatively. For comparision with SGA, the DeJong Function Flis used an example.Both results show that the new genetic algorithms with grid is valid for improving the optimal efficiency of genetic algorithms.
- genetic algorithms /
- grid /
- optimization algorithm