摘要
提出了一种新的确定性的函数优化算法——网格算法(GPA),并介绍了基于节点的网格生成策略。尤其对于高维问题,介绍了一个快速随机生成算法,解决了种群规模的爆炸增长问题。阐述了网格算法快速收敛的特点,并通过实验与快速演化规划算法和遗传算法进行比较,证明了算法的有效性。
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）.
出处
《计算机应用》
CSCD
北大核心
2007年第7期1757-1759,1801,共4页
journal of Computer Applications
关键词
网格算法
有效性
函数优化
gridding algorithm
effectiveness
function optimization
