摘要
近年来,越来越多的演化计算研究者对动态优化问题产生了很大的兴趣,并产生了很多解决动态优化问题的方法。提出一种新的动态演化算法,与传统的演化算法有所不同,它是建立在划分网格基础上的,故而称它为网格优化算法。通过测试典型的动态优化问题,并与经典的SOS算法进行比较,证明了算法的有效性。
Dynamic Optimization Problems (DOP) has attracted more and more attention recently, and a number of methods have been introduced to solve them. This paper proposed a completely new approach, named Grid Evolutionary Algorithm (GEA), which was based on the concept of Girdding and quite different from those traditional Evolutionary Algorithms (EAs). It was designed to solve optimization problems in dynamic environment. Compared with the well-known SOS algorithms, the resuhs show that this algorithm is far more effective to solve DOP than SOS algorithm.
出处
《计算机应用》
CSCD
北大核心
2008年第2期319-321,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(60473081)
湖北省自然科学基金资助项目(2005ABA234)
关键词
演化算法
动态优化
网格算法
有效性
evolutionary algorithms
dynamic optimization
grid algorithm
effectiveness