首页 | 本学科首页   官方微博 | 高级检索  
     

基于网格的一种新的动态演化算法
引用本文:于干,康立山.基于网格的一种新的动态演化算法[J].计算机应用,2008,28(2):319-321.
作者姓名:于干  康立山
作者单位:中国地质大学,计算机学院,武汉,430074;武汉大学,计算机学院,武汉,430074
基金项目:国家自然科学基金 , 湖北省自然科学基金
摘    要:近年来,越来越多的演化计算研究者对动态优化问题产生了很大的兴趣,并产生了很多解决动态优化问题的方法。提出一种新的动态演化算法,与传统的演化算法有所不同,它是建立在划分网格基础上的,故而称它为网格优化算法。通过测试典型的动态优化问题,并与经典的SOS算法进行比较,证明了算法的有效性。

关 键 词:演化算法  动态优化  网格算法  有效性
文章编号:1001-9081(2008)02-0319-03
收稿时间:2007-09-06
修稿时间:2007-11-06

New evolutionary algorithm based on girdding for dynamic optimization problems
YU Gan,KANG Li-shan.New evolutionary algorithm based on girdding for dynamic optimization problems[J].journal of Computer Applications,2008,28(2):319-321.
Authors:YU Gan  KANG Li-shan
Affiliation:YU Gan1,2,KANG Li-shan1,2(1.College of Computer Science,China University of Geosciences,Wuhan Hubei 430074,China,2.College of Computer Science,Wuhan University,China)
Abstract: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 results show that this algorithm is far more effective to solve DOP than SOS algorithm.
Keywords:evolutionary algorithms  dynamic optimization  grid algorithm  effectiveness
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号