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

基于连续蚁群算法的供水水库优化调度
引用本文:王德智,董增川,丁胜祥. 基于连续蚁群算法的供水水库优化调度[J]. 水电能源科学, 2006, 24(2): 77-79
作者姓名:王德智  董增川  丁胜祥
作者单位:河海大学,水资源与水利工程科学国家重点实验室,江苏,南京,210098
摘    要:针对供水水库优化调度问题,介绍了一种改进的连续蚁群算法。该算法借鉴蚁群算法的进化思想,主要包括局部搜索、全局搜索和信息素强度更新规则。在随机搜索过程中嵌入确定性搜索,以改善寻优性能,增加经验指导,从而加速收敛。将该算法与离散蚁群算法相比较,结果表明,该算法更优越,具有并行化和较强的全局寻优能力。

关 键 词:供水水库  连续蚁群算法  优化调度
文章编号:1000-7709(2006)02-0077-03
收稿时间:2006-03-13
修稿时间:2006-03-13

Optimal Scheduling of Feeding Reservoir Based on Continuous Ant Colony Algorithm
WANG Dezhi,DONG Zengchuan,DING Shengxiang. Optimal Scheduling of Feeding Reservoir Based on Continuous Ant Colony Algorithm[J]. International Journal Hydroelectric Energy, 2006, 24(2): 77-79
Authors:WANG Dezhi  DONG Zengchuan  DING Shengxiang
Abstract:This article provides a new CACA algorithm,which is appliedin optimal scheduling of feeding reservoir.This algorithm comprises of local searching,global searching and phenomenon updating rule deriving from ACA.It is improved in two respects.One is a deterministicsearching algorithm embedded to improve its optimization performance,the other is the searching strategy based on best experience to accelerate its convergence.The algorithmis proved by a real case,compared with discreteant colony algorithm(DACA).The results show that the algorithmpossesses high searching capability and provides a new approach to solve the problem of optimal scheduling of feeding reservoir.
Keywords:feeding reservoir  continuous ant colony algorithm  optimal scheduling  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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