共查询到17条相似文献,搜索用时 234 毫秒
1.
2.
3.
4.
5.
6.
改进粒子群优化算法在水电站群优化调度中的应用研究 总被引:8,自引:4,他引:4
为克服常规粒子群优化算法易早熟、后期收敛慢且易陷入局部最优解的缺点,本文提出一种新的惯性权重系数更新策略——自适应指数惯性权重系数(SEIWC)代替线性递减惯性权重系数(LDIWC),同时,将遗传算法中的染色体交叉、变异思想引入粒子的更新策略,提高粒子的多样性,增强算法的全局搜索能力。使用Rosenbrock函数和Schaffer函数验证了改进粒子群优化算法的有效性。以福建电网闽江流域水电站群优化调度为例,建立基于改进粒子群优化算法的库群长期优化调度模型。计算结果表明,该模型的调度结果显著优于常规粒子群优化算法,与逐步优化算法结果水平相当。 相似文献
7.
改进微粒群优化算法在水库防洪调度中的应用 总被引:1,自引:1,他引:0
微粒群算法(PSO)是一种新颖的智能计算优化方法,具有全局寻优、收敛速度快等优点。针对标准PSO搜索精度不高和易陷入局部最优的缺点,提出了一种在速度进化方程中引进收敛因子的方法,改进了标准微粒群算法的收敛性。将改进的微粒群优化算法用于水库优化调度计算,结果表明,改进的PSO计算结果合理、有效,可作为水库防洪优化调度的一种新方法。 相似文献
8.
混合智能算法及其在供水水库群优化调度中的应用 总被引:5,自引:1,他引:4
将遗传算法中的进化思想和蚁群算法中的群体智能技术有效地耦合,提出了一种基于两者的混合智能算法,应用于供水水库群系统的优化调度研究中。算法利用蚁群算法的并行性、正反馈性以及良好的全局寻优能力,避免搜索陷入局部最优,同时借鉴遗传算法的进化思想,利用杂交、变异算子来进行局部寻优,使其能快速搜索到全局最优点。在种群随机搜索过程中嵌入确定性的模式搜索,使得算法同时具有随机性和确定性。结合模拟退火思想,构造了罚因子处理约束条件,使该算法对水库优化调度问题以及其他优化问题具有一定的通用性。通过实例验证,并与大系统聚合分解经典算法进行比较,结果表明该算法是可行的和有效的。 相似文献
9.
基于改进粒子群算法的水库优化调度研究 总被引:1,自引:0,他引:1
在分析以往水库优化调度模型优缺点的基础上,提出了基于动态调节惯性权重的粒子群优化方法的水库优化调度模型,对基本粒子群算法进行了改进。改进的算法通过时变权重的设置来实现,从而克服了PSO搜索精度不高,易陷入局部最优的缺点,并通过引入罚函数解决强约束问题。以某综合利用水库优化调度为实例进行研究,并与动态规划模型计算结果进行对比分析,实例计算表明:改进PSO算法原理简单,易于编程实现,而且占用计算机内存小,收敛速度快,搜索效率高,能以较快的速度收敛到全局最优解,是一种有效的搜索算法。 相似文献
10.
11.
改进遗传算法及其在水库群优化调度中的应用 总被引:8,自引:2,他引:6
根据梯级水电站优化调度特点,建立遗传算法(GA)求解多阶段最优化问题的数学模型.针对标准遗传算法(sGA)局部寻优能力较差、易早熟等不足之处,从编码方法、遗传算子和混合算法方面对其进行改进,提出了采用超立方体浮点数编码自适应遗传算法(AGA)和超立方体浮点数编码遗传模拟退火算法(SA-GA).通过16种不同策略的GA在雅砻江梯级优化调度中的应用,其结果表明了改进策略在解决水库群优化问题方面的有效性和优越性.最后将GA与动态规划(DP)算法的性能进行比较分析,充分体现了GA的优点. 相似文献
12.
Chun-Tian Cheng Wen-Chuan Wang Dong-Mei Xu K. W. Chau 《Water Resources Management》2008,22(7):895-909
Genetic algorithms (GA) have been widely applied to solve water resources system optimization. With the increase of the complexity
and the larger problem scale of water resources system, GAs are most frequently faced with the problems of premature convergence,
slow iterations to reach the global optimal solution and getting stuck at a local optimum. A novel chaos genetic algorithm
(CGA) based on the chaos optimization algorithm (COA) and genetic algorithm (GA), which makes use of the ergodicity and internal
randomness of chaos iterations, is presented to overcome premature local optimum and increase the convergence speed of genetic
algorithm. CGA integrates powerful global searching capability of the GA with that of powerful local searching capability
of the COA. Two measures are adopted in order to improve the performance of the GA. The first one is the adoption of chaos
optimization of the initialization to improve species quality and to maintain the population diversity. The second is the
utilization of annealing chaotic mutation operation to replace standard mutation operator in order to avoid the search being
trapped in local optimum. The Rosenbrock function and Schaffer function, which are complex and global optimum functions and
often used as benchmarks for contemporary optimization algorithms for GAs and Evolutionary computation, are first employed
to examine the performance of the GA and CGA. The test results indicate that CGA can improve convergence speed and solution
accuracy. Furthermore, the developed model is applied for the monthly operation of a hydropower reservoir with a series of
monthly inflow of 38 years. The results show that the long term average annual energy based CGA is the best and its convergent
speed not only is faster than dynamic programming largely, but also overpasses the standard GA. Thus, the proposed approach
is feasible and effective in optimal operations of complex reservoir systems. 相似文献
13.
To deal with stochastic characteristics of inflow in reservoir operation, a noisy genetic algorithm (NGA), based on simple
genetic algorithms (GAs), is proposed. Using operation of a single reservoir as an example, the results of NGA and Monte Carlo
method which is another way to optimize stochastic reservoir operation were compared. It was found that the noisy GA was a
better alternative than Monte Carlo method for stochastic reservoir operation. 相似文献
14.
15.
Hojat Karami Sayed Farhad Mousavi Saeed Farzin Mohammad Ehteram Vijay P. Singh Ozgur Kisi 《Water Resources Management》2018,32(10):3353-3372
Much of the world is facing water scarcity during one or the other part of the year. Hence, water resources management and optimal operation of water resources system take on added importance these days. This study introduces an improved version of krill algorithm for reservoir operation. The algorithm is based on adding an onlooker search mechanism to avoid being trapped in local optima and then updating its position. The new krill algorithm is tested using a case study for irrigation management. The computation time is 33 s for the new algorithm but is 54, 59, and 60 s for krill algorithm, particle swarm optimization and genetic algorithm, respectively. Also, the improved krill algorithm can meet 97% of irrigation demands and has the lowest value of vulnerability index among genetic algorithm, particle swarm optimization, and simple krill algorithm. Also, the average solution of improved krill algorithm is close to the global solution. Results indicate that the improved krill algorithm has high potential for application in water resource management. 相似文献
16.
根据我国北方地区径流特征及供水水库调度的实际需求,构建了供水水库多目标生态调度模型。模型将下游生态需水过程分为最小生态需水及适宜生态需水两个等级,要求枯水期水库放水过程能够满足河流最小生态需水要求,确保下游生态不退化;丰水期放水过程贴近适宜生态需水过程,为下游提供良好生境。基于该模型,采用自适应遗传算法,对承德双峰寺水库生态调度问题进行了优化求解,结果表明该模型能够对北方供水水库生态调度决策提供支持。 相似文献
17.
应用单亲遗传算法进行树状管网优化布置 总被引:33,自引:5,他引:28
树状管网布置优化属于典型的组合优化问题。本文针对树状管网布置的特点,以图论和遗传算法为理论基础,应用改进遗传算法 单亲遗传算法进行树状管网优化布置,并设计了相应的适应度函数、单亲换位算子和逆转算子。与Dijkstra算法和Kruskal算法相比,单亲遗传算法直接以管网投资最小为优化目标,能够获得一批管网投资最小的布置方案,且算法的寻优效率较高,收敛性和稳定性较好。 相似文献