TS-PSO算法在电力系统无功优化中的应用

为了解决粒子群算法(PSO)局部搜索能力较弱和存在早熟收敛的问题,提出了将禁忌搜索(TS)思想融入到粒子群算法中的混合算法,并将该算法应用到电力系统无功优化中。改进后的算法综合了粒子群算法快速性、随机性和全局收敛的优点,还具有禁忌搜索局部寻优的能力。通过对IEEE-30节点测试系统、铜陵电网实际进行仿真计算,并与其它算法进行比较,结果表明该算法能取得更好的全局最优解,既加快了收敛速度,又提高了收敛精度。     

遗传和禁忌搜索混合算法在机组负荷分配中的应用

提出一种遗传和禁忌搜索相结合的混合算法,利用该算法解决电力系统经济负荷分配问题。遗传算法的全局搜索能力强,但容易出现"早熟"现象,而禁忌搜索的爬山能力强,能有效避免"早熟"现象。首先利用遗传算法进行全局搜索,当算法陷入"早熟"时停止搜索,以遗传算法的结果作为初始解进行禁忌搜索,提高了初始解的质量,使禁忌搜索达到很好的效果。将该方法分别应用于某5台机组组成的发电系统和3台机组组成的发电系统进行负荷优化计算,结果与遗传算法进行比较,分析表明该算法收敛速度更快,优化成功率更高,优化结果更靠近全局最优。     

电力系统机组组合问题的闭环粒子群算法

针对标准粒子群优化（PSO）算法易陷入局部最优解的缺点,提出了闭环PSO（CLPSO）算法。算法引入经典控制理论中的反馈机制和闭环控制概念,将每个粒子视为被控对象,根据每一步得到的适应值通过PID控制器动态调整惯性权重,以满足搜索过程中粒子时时变化的需求。该策略极大地保证了粒子多样性,提高了算法的全局搜索能力。将CLPSO算法应用到机组组合问题中,同时结合新的策略以降低问题维数和保证寻优过程中粒子的可行性。仿真结果验证了所提出的算法在解决机组组合问题上的有效性。     

育种粒子群算法在梯级水电站优化调度中的应用

为了提高粒子群优化(Particle Swarm Optimization,PSO)算法的计算精度和计算效率,避免"早熟",提出了育种粒子群优化算法(Breeding-based Particle Swarm Optimization,BBPSO).该算法模型将育种算法和PSO算法有机结合,构建双群体搜索机制,既利用PSO算法的快速演化能力,又利用育种算法模型中的繁殖操作增加群体多样性.将该算法模型应用于梯级水电站发电最优调度中,仿真结果表明,和标准PSO算法相比,BBPSO具有更好的全局寻优能力和较快的收敛速度,能有效应用于梯级电站发电联合优化调度中.     

禁忌搜索–粒子群算法在无功优化中的应用

禁忌搜索粒子群算法是针对粒子群算法局部搜索能力较弱和存在早熟收敛的问题,将禁忌搜索思想融入到粒子群算法中的混合算法,并将该算法应用到电力系统无功优化中。该方法在粒子群算法寻优过程的后期加入了禁忌表,扩大搜索空间,避免陷入局部最优。通过对IEEE 30节点测试系统和鸡西电网进行仿真计算,并与其他算法进行比较,结果表明该算法能取得更好的全局最优解,既加快了收敛速度,又提高了收敛精度。     

基于混合粒子群优化算法的电力系统无功优化

应用粒子群优化算法(PSO)求解电力系统无功优化问题,提出基于混沌搜索的混合粒子群优化算法,以克服PSO容易早熟而陷入局部最优解的缺点。该算法引入了基于群体适应度方差的早熟判断机制,当算法陷入早熟时,利用混沌运动的遍历性、随机性和规律性等特性,先对当前粒子群体中的最优粒子进行混沌寻优,然后把混沌寻优的结果随机替换群体中的一个粒子,从而提高了PSO的寻优特性。通过对IEEE 14、IEEE 30、IEEE 118等标准测试系统进行无功优化,并与遗传算法、标准PSO进行比较,表明该算法具有更高的搜索效率和更好的全局优化能力。     

改进粒子群优化算法的电力系统最优潮流计算

标准的粒子群优化(PSO)算法一般不能兼顾收敛速度、全局探索能力和局部精细搜索能力,因此,提出了改进粒子群算法以解决电力系统的最优潮流计算问题,同时指出今后粒子群算法的研究方向.     

基于PSO-GA算法的电力系统机组组合研究

机组组合优化问题是一个大规模、多约束、非线性的混合整数规划问题,因此求解非常困难。粒子群优化(PSO)算法是一类随机全局优化技术,它通过粒子间的相互作用发现复杂搜索空间中的最优区域。PSO算法的优势在于操作简单,可调参数少易于实现而又功能强大。该文采用二进制粒子群优化方法解决机组状态组合问题,用遗传算法结合启发式技术解决经济分配问题,并对最小开停机时间及启停费用进行了处理,使得运算速度大大加快。方法的可行性在10台机组系统中检验。模拟结果表明文章所提出的算法具有收敛速度快及解的质量高等优点。     

基于禁忌搜索粒子群优化算法的无功优化

针对粒子群算法局部搜索能力较弱和存在早熟收敛的问题,提出将粒子群优化算法结合禁忌搜索的混合算法,并应用它来求解电力系统无功优化问题。该混合算法是以粒子群优化算法为主框架,以禁忌搜索算法作为个体群继续在邻域中寻优,寻优结果对粒子群算法的输出做了更新。混合算法保留了粒子群优化算法的并行处理性,同时利用了禁忌搜索算法的较强的"爬山"能力,加快了混合优化算法的收敛时间和提高了收敛解的有效性。     

基于PSO-GA算法的电力系统机组组合研究

机组组合优化问题是一个大规模、多约束、非线性的混合整数规划问题,因此求解非常困难.粒子群优化(PSO)算法是一类随机全局优化技术,它通过粒子间的相互作用发现复杂搜索空间中的最优区域.PSO算法的优势在于操作简单,可调参数少易于实现而又功能强大.该文采用二进制粒子群优化方法解决机组状态组合问题,用遗传算法结合启发式技术解决经济分配问题,并对最小开停机时间及启停费用进行了处理,使得运算速度大大加快.方法的可行性在10台机组系统中检验.模拟结果表明文章所提出的算法具有收敛速度快及解的质量高等优点.     

一种新算法在经济负荷分配中的应用

为求解复杂的不连续、非凸、非线性电力系统的经济负荷分配问题,提出了一种单纯形法(NM)和粒子群算法(PSO)相结合的NM-PSO算法.该算法将单纯形算子嵌入到PSO算法中,把适应值最好的一部分粒子用单纯形法来更新,其余粒子用PSO算法寻优,从而提高PSO算法后期的寻优能力.NM-PSO充分利用PSO算法强大的全局搜索能力和NM快速确定性的局部搜索能力,提高了NM-PSO算法的寻优能力和收敛速度,该算法应用于经济负荷分配问题得到的优化结果好于其他方法.     

A hybrid multi-agent based particle swarm optimization algorithm for economic power dispatch

This paper presents a new multi-agent based hybrid particle swarm optimization technique (HMAPSO) applied to the economic power dispatch. The earlier PSO suffers from tuning of variables, randomness and uniqueness of solution. The algorithm integrates the deterministic search, the Multi-agent system (MAS), the particle swarm optimization (PSO) algorithm and the bee decision-making process. Thus making use of deterministic search, multi-agent and bee PSO, the HMAPSO realizes the purpose of optimization. The economic power dispatch problem is a non-linear constrained optimization problem. Classical optimization techniques like direct search and gradient methods fails to give the global optimum solution. Other Evolutionary algorithms provide only a good enough solution. To show the capability, the proposed algorithm is applied to two cases 13 and 40 generators, respectively. The results show that this algorithm is more accurate and robust in finding the global optimum than its counterparts.     

A New Particle Swarm Optimization Solution to Nonconvex Economic Dispatch Problems

This paper proposes a new version of the classical particle swarm optimization (PSO), namely, new PSO (NPSO), to solve nonconvex economic dispatch problems. In the classical PSO, the movement of a particle is governed by three behaviors, namely, inertial, cognitive, and social. The cognitive behavior helps the particle to remember its previously visited best position. This paper proposes a split-up in the cognitive behavior. That is, the particle is made to remember its worst position also. This modification helps to explore the search space very effectively. In order to well exploit the promising solution region, a simple local random search (LRS) procedure is integrated with NPSO. The resultant NPSO-LRS algorithm is very effective in solving the nonconvex economic dispatch problems. To validate the proposed NPSO-LRS method, it is applied to three test systems having nonconvex solution spaces, and better results are obtained when compared with previous approaches     

Economic dispatch using particle swarm optimization with bacterial foraging effect

This paper presents a novel modified particle swarm optimization (MPSO), which includes advantages of bacterial foraging (BF) and PSO for constrained dynamic economic dispatch (ED) problem. The proposed modified PSO consists of problem dependent four promising values in velocity vector to incorporate repellent advantage of bacterial foraging in PSO for the complex dynamic ED problem. It reliably and accurately tracks a continuously changing solution of the complex cost functions. As there is no differentiation operation in this method, all cost functions can easily be handled. The modified PSO has better balance between local and global search abilities and it can avoid local minima quickly. Finally, a benchmark data set and existing methods are used to show the effectiveness of the proposed method.     

Anti-predatory particle swarm optimization: Solution to nonconvex economic dispatch problems

This paper proposes a new particle swarm optimization (PSO) strategy namely, anti-predatory particle swarm optimization (APSO) to solve nonconvex economic dispatch problems. In the classical PSO, the movement of a particle (bird) is governed by three behaviors: inertial, cognitive and social. The cognitive and social behaviors are the components of the foraging activity, which help the swarm of birds to locate food. Another activity that is observed in birds is the anti-predatory nature, which helps the swarm to escape from the predators. In this work, the anti-predatory activity is modeled and embedded in the classical PSO to form APSO. This inclusion enhances the exploration capability of the swarm. To validate the proposed APSO model, it is applied to two test systems having nonconvex solution spaces. Satisfactory results are obtained when compared with previous approaches.     

Modulated particle swarm optimization for economic emission dispatch

The economic emission dispatch (EED) problem of thermal generating units is a highly complex combinatorial multi-constraint, non-convex optimization problem with conflicting objectives. This paper presents a Modulated Particle Swarm Optimization (MPSO) method to solve the EED problem of thermal units. The conventional PSO is modified by modulating velocity of particles for better exploration and exploitation of the search space. The modulation of particles’ velocity is controlled by introducing a truncated sinusoidal constriction function in the control equation of PSO. The conflicting objectives of the EED problem are combined in fuzzy framework by suggesting adjusted fuzzy membership functions which is then optimized using proposed PSO. The effectiveness of the proposed PSO is tested on three standard test generating systems considering several operational constraints like valve point effect, and prohibited operating zones (POZs). The application results and their comparison with other existing methods show that the proposed MPSO is promising for EED problem of thermal generating units.     

一种新型的电力系统无功优化算法

介绍一种类似于遗传算法的进化算法———粒子群优化算法, 并把它应用到电力系统无功优化问题中。对基本的粒子群优化算法作了适当改进, 在粒子速度更新公式中增加了一项即上一代的全局“最优”值, 相当于增加了全局极值的权重, 提高了算法的收敛性。以粒子群优化算法为基础, 选取适合于该算法的无功优化目标函数。通过对 IEEE- 14节点的仿真计算, 证明了该算法优于基本的粒子群优化算法, 且与遗传算法相比能在更少的迭代次数内搜索到更好的全局最优解。     

Particle Swarm Optimization Based Global Descent Method

This letter proposes a new global descent method based on not only the concept of a conventional descent method in mathematical programming but also the concept of search direction in particle swarm optimization (PSO) in metaheuristics. The proposed method, called particle swarm optimization based global descent method (PSOGDM), consists of two main procedures; (i) determination of search direction and (ii) global optimization for given search direction. Although the search direction that has three parameters is decided based on the concept of PSO, the proposed PSOGDM is a single-point search different from PSO. Global optimization for a given search direction is performed by PSO. The search capability of the proposed PSOGDM is examined based on the results of numerical experiments using five typical benchmark problems. Copyright © 2009 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

Optimization using civilized swarm: Solution to economic dispatch with multiple minima

This paper presents a new optimization strategy, civilized swarm optimization (CSO), by integrating society-civilization algorithm (SCA) with particle swarm optimization (PSO). In SCA, individuals are grouped in small societies (clusters) with better performing individuals of each cluster as society leaders (SL). All such societies constitute the civilization with the best society leader as the civilization leader (CL). To perform optimization, the society members follow their SL; the society leaders follow the CL. Whereas in PSO, particles modify their positions according to their best experiences and that of the swarm. SCA differs with PSO in the fact that the individuals of SCA follow only their leaders neglecting self-experiences. The proposed CSO considers the swarm to be a civilization with societies. The particles of a society are made to search within the society with the help of both the SL and their own experiences; therefore, they can exploit a “promising area”. All the society leaders are allowed to explore the search space for new promising areas through the guidance of both their own experiences and that of the swarm leader. The efficiency of CSO is tested for a set of multi-minima economic dispatch problems and superior results are obtained.     

面向启发式调整策略和粒子群优化的机组组合问题

提出一种启发式调整策略和粒子群优化相结合的新方法求解电力系统中的机组组合(UC)问题.算法将UC问题分解为具有整型变量和连续变量的两个优化子问题,采用离散粒子群优化和等微增率相结合的双层嵌套方法对外层机组启、停状态变量和内层机组功率经济分配子问题进行交替迭代优化求解.同时构造了关机调整和替换调整两个启发式搜索策略对优化结果进行进一步局部微调以提高算法解决UC问题的全局寻优能力和计算效率,从而有效改善解的质量.以10～100台机组组成的5个测试系统为算例,通过与其他算法结果进行比较分析,验证了该方法的可行性和有效性.仿真结果表明该方法解决大规模机组组合问题具有求解精度高和收敛速度快的优势.