蚁群算法在水库优化调度中的应用
Application of ant colony algorithm to reservoir optimal operation
-
摘要: 提出了一种新的随机启发式搜索算法——蚁群算法。算法利用蚂蚁群体相互协作机制寻找水库优化问题的最优解。算法中引入状态转移规则、信息素更新规则和领域搜索以获取最优解,所有蚂蚁个体完成单次寻优后,按照信息素更新规则更新信息素。该过程不断迭代,直到满足迭代终止条件。文中实例计算表明,相对于动态规划,该算法计算速度快、收敛性好,提高了计算效率,较好的解决了传统的动态规划方法求解水库(群)优化调度问题存在"维数灾"问题。Abstract: This paper presents a new stochastic and heuristic searching algorithm,ant colony algorithm(ACA),and its applicanon to reserwir optimal operation.The main purpose of this paper is to investigate the applicability of ACA in solving "dimension difficulty" in the reserwir optimal operation problem.In the ACA,a set of co-operation ants work together to find a good solution to the reserwir optimal operation problem.The state transition rule,the global pherormne-updating rule and the neighbor search are also introduced to ensure the optimal solution.Once all the ants have completed their tours,a global pheromone-updating rule is then applied and the process is iterated until the stop condition is satisfied.A case study for solving "dimension difficulty" is presented in this paper.In contrast wrath the dynamic programming,the new algorithm shows its advantages on computing speed and convergence.