| 一种新的基于网格的函数优化算法 |
| |
| 引用本文： | 于干,李长河,康立山.一种新的基于网格的函数优化算法[J].计算机应用,2007,27(7):1760-1759. |
| |
| 作者姓名： | 于干 李长河 康立山 |
| |
| 作者单位： | 中国地质大学计算机学院 武汉430074 |
| |
| 摘 要： | 提出了一种新的确定性的函数优化算法——网格算法（GPA），并介绍了基于节点的网格生成策略。尤其对于高维问题，介绍了一个快速随机生成算法，解决了种群规模的爆炸增长问题。阐述了网格算法快速收敛的特点，并通过实验与快速演化规划算法和遗传算法进行比较，证明了算法的有效性。
|
| 关 键 词： | 网格算法 有效性 函数优化 |
| 文章编号： | 1001-9081（2007）07-1757-03 |
| 收稿时间： | 2007-01-08 |
| 修稿时间： | 2007-01-062007-04-10 |
New function optimization algorithm based on gridding |
| |
| YU Gan,LI Chang-he,KANG Li-shan.New function optimization algorithm based on gridding[J].journal of Computer Applications,2007,27(7):1760-1759. |
| |
| Authors: | YU Gan LI Chang-he KANG Li-shan |
| |
| Affiliation: | 1. School of Computer, China University of Geosciences, Wuhan Hubei 430074, China; 2. State Key Laboratory of Software Engineering, Wuhan University, Wuhan Hubei 430072, China |
| |
| Abstract: | A new determinate optimization algorithm based on gridding for function optimization,gridding optimization algorithm(GOA),was proposed.The strategy of generating gridding was based on nodes.Especially for high dimension problems,a new random gridding generating method was introduced,which well solved the problem that population size would increase exponentially with the increase of dimension.The characteristics of GOA were introduced.The effectiveness of this method is proved through experiments compared with fast evolutionary programming(FEP) and genetic algorithm(GA). |
| |
| Keywords: | gridding algorithm effectiveness function optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
