Parallel Multipopulation Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control

This paper presents parallel multipopulation differential evolutionary particle swarm optimization (DEEPSO) for voltage and reactive power control (VQC). The problem can be formulated as a mixed integer nonlinear optimization problem and various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Since VQC is one of the online controls, speed‐up of computation is required. Moreover, there is still room for improvement in solution quality. This paper applies parallel multipopulation DEEPSO in order to speed up the calculation and improve solution quality. The proposed method is applied to IEEE 30, 57, and 118 bus systems. The results indicate that the proposed method can realize fast computation and minimize more active power losses than the conventional evolutionary computation techniques.     

粒子群优化算法在电力系统中的应用

粒子群优化方法是一种基于群体智能的新型演化计算技术.它在函数优化、神经网络设计、分类、模式识别、信号处理、机器人技术等许多领域已取得了成功应用,但在电力系统中应用的研究起步较晚,关于它实际应用的报道尚不多见.文章较为全面地详述了粒子群优化方法在配电网扩展规划、检修计划、机组组合、负荷经济分配、最优潮流计算与无功优化控制、谐波分析与电容器配置、配电网状态估计、参数辨识、优化设计等方面应用的主要研究成果.随着粒子群优化理论研究的深入,它还将在电力市场竞价交易、投标策略以及电力市场仿真等领域发挥巨大的应用潜力.     

改进差分进化算法在电力系统无功优化中的应用

针对电力系统无功优化具有非线性、多控制变量、多约束条件、连续变量和离散变量混杂的特点,提出了一种改进的差分进化算法。该算法根据进化学习过程中积累的经验,利用优良群体引导变异的方向,同时提取优良群体各维元素的信息,以优良群体信息指导个体每一维变量的交叉操作。IEEE 30节点系统算例表明,所提算法较基本差分进化算法和粒子群算法,收敛速度快、计算精度高、稳定性好、能有效地求解电力系统无功优化问题。     

Optimal analog active filter design using craziness‐based particle swarm optimization algorithm

Because of the manufacturing constraints, the optimal selection of passive component values for the design of analog active filter is very critical. As the search on possible combinations in preferred values for capacitors and resistors is an exhaustive process, it has to be automated with high accuracy within short computation time. Evolutionary computation may be an attractive alternative for automatic selection of optimal discrete component values such as resistors and capacitors for analog active filter design. This paper presents an efficient evolutionary optimization approach for optimal analog filter design considering different topologies and manufacturing series by selecting their component values. The evolutionary optimization technique employed is craziness‐based particle swarm optimization (CRPSO). PSO is very simple in concept, easy to implement and computationally efficient algorithm with two main advantages: fast convergence and only a few control parameters. However, the performance of PSO depends on its control parameters and may be influenced by premature convergence and stagnation problem. To overcome these problems, the PSO algorithm has been modified to CRPSO and is used for the selection of optimal passive component values of fourth‐order Butterworth low‐pass analog active filter and second‐order state variable low‐pass filter, respectively. CRPSO performs the dual task of efficiently selecting the component values as well as minimizing the total design errors of low‐pass active filters. The component values of the filters are selected in such a way so that they become E12/E24/E96 series compatible. The simulation results prove that CRPSO efficiently minimizes the total design error with respect to previously used optimization techniques. Copyright © 2014 John Wiley & Sons, Ltd.     

基于混合微分演化算法的配电网架结构智能规划

应用地理信息系统(GIS)和改进的微分演化(DE)算法组成混合微分演化(GDE)算法来进行配电网架结构的智能规划.该算法首先利用配电网络的地理特征,分阶段过滤明显不适合的线路,得到初步规划网络,随后利用DE算法收敛快速、鲁棒性强的特点,将其应用到优化计算中.为避免早熟,对传统DE算法进行了改进,利用解群转移策略在给定的条件下对解群进行分散处理,以跳出局部最优点,得到全局最优解.并给出了某省会城市的城区高压配电网规划算例.     

动态规划和粒子群算法在水电站厂内经济运行中的应用比较研究

随着电站装机容量和机组台数的不断增加,利用动态规划求解水电站厂内经济运行问题,将面临"维数灾"和实效性问题.近些年,粒子群算法作为一种新型的群体智能优化方法,由于能够弥补动态规划计算时间长、内存占用量大等诸多不足,在水电站厂内经济运行等方面得到了广泛重视.现有文献,大多数从方法的应用角度探讨较多,但从替代动态规划的必然性和潜力方面探讨较少,鲜有实例分析.本文以百万级装机千瓦的乌江渡水电站为实例,深入分析与比较了粒子群算法与动态规划的优劣,认为粒子群算法是代替动态规划、求解装机规模庞大的巨型水电站厂内经济运行的有效方法.     

Optimal Design of Buffer Material in the Geological Disposal of Radioactive Wastes Using the Satisficing Trade‐off Method and a Self‐Organizing Map

In this paper, we consider the use of a multi‐objective optimization method in order to obtain a preferred solution for the buffer material optimal design problem in the high‐level geological disposal of radioactive waste. The buffer material optimal design problem is formulated as a constrained multi‐objective optimization problem. Its Pareto optimal solutions are distributed evenly over the entire feasible region. Hence, we develop a search method to find a preferred solution easily for a decision maker from the Pareto optimal solutions, which are distributed evenly and broadly. In the preferred solution search method, a technique for visualization of a Pareto optimal solution set using a self‐organizing map is introduced into the satisficing trade‐off method, which is an interactive method for obtaining a Pareto optimal solution that satisfies a decision maker. We confirm the effectiveness of the preferred solution search method in the buffer material optimal design problem. © 2014 Wiley Periodicals, Inc. Electr Eng Jpn, 187(2): 17–32, 2014; Published online in Wiley Online Library ( wileyonlinelibrary.com ). DOI 10.1002/eej.22634     

Optimal sizing and design of CMOS analogue amplifier circuits using craziness‐based particle swarm optimization

This paper presents the optimal designs of two analogue complementary metal–oxide–semiconductor (CMOS) amplifier circuits, namely differential amplifier with current mirror load and two‐stage operational amplifier. A modified Particle Swarm Optimization (PSO), called Craziness‐based Particle Swarm Optimization (CRPSO) technique is applied to minimize the total MOS area of the designed circuits. CRPSO is a highly modified version of conventional PSO, which adopts a number of random variables and has a better and faster exploration and exploitation capability in the multidimensional search space. Integration of craziness factor in the fundamental velocity term of PSO not only brings diversity in particles but also pledges convergence close to global best solution. The proposed CRPSO‐based circuit optimization technique is reassured to be free from the intrinsic disadvantages of premature convergence and stagnation, unlike Differential Evolution (DE), Harmony Search (HS), Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO). The simulation results achieved for the two analogue CMOS amplifier circuits establish the efficacy of the proposed CRPSO‐based approach over those of DE, HS, ABC and PSO in terms of convergence haste, design conditions and design goals. The optimally designed analogue CMOS amplifier circuits occupy the least MOS area and show the best performance parameters like gain and power dissipation, in compared with the other reported literature. Copyright © 2016 John Wiley & Sons, Ltd.     

基于动态多种群粒子群算法的无功优化

提出了一种基于动态多种群策略的改进粒子群算法。该算法将传统粒子群优化算法(particle swarm optimization，PSO)中的种群划分成多个子群，每个子群相对独立地朝同一目标进化，仅通过一种轮形结构的弱联系进行交流。在进化过程中各种群不断分裂和聚类重组，动态调整种群规模以更好地适应进化。该算法可以较好地避免PSO算法过快收敛于局部最优解，并且有较快的收敛速度。文中将该算法应用于求解电力系统无功优化问题，并与标准PSO算法的性能进行了对比，仿真计算证明该算法是有效、可行的。     

基于差异进化算法的并行容错无功优化

容错是应用分布式并行计算系统时必须解决的一个关键难点.在基于广域网络的新型计算环境下实现基于进化算法的电力系统优化应用时,需要对大量个体进行频繁的迭代评估,现有的各类容错技术难以实现对此类应用的高效容错.文中结合进化算法概率性搜索、个别个体失效不会影响系统整体性能的特点,提出以父代个体取代未按时返回的子代个体的方式实现容错,并结合基于差异进化算法的无功优化问题对所提出的方法进行了仿真分析.IEEE 118节点系统测试表明该方法能以优化性能的降低为代价实现高效容错.在该容错手段支持下,可通过采用更大范围网络计算资源基础上更大的群体规模,取得一致性更好、更接近全局最优的解.     

并行自适应粒子群算法在电力系统无功优化中的应用

针对传统粒子群优化算法"早熟"与后期收敛速度慢的缺点,提出了一种基于并行自适应粒子群优化算法的电力系统无功优化方法。该方法首先将初始种群随机划分成N个子群,然后分别在各子群中以所提方法寻优,从而实现了算法的并行计算。为避免各子群陷入局部最优解,采用二值交叉算子使各子群间的信息共享并更新相关粒子位置,保证了算法的全局搜索能力并维持了种群的多样性。同时,各子群寻优过程中,根据利己、利他及自主3个方向对当前搜索方向自适应更新,提高了算法的收敛速度。将所提出算法在IEEE 30节点系统上进行了仿真验证,结果证明了并行自适应粒子群算法用于无功优化的可行性和有效性。     

梯级水库发电优化调度的改进粒子群算法应用研究

本文针对粒子群算法在求解高维、复杂的梯级水库发电优化调度时后期种群缺乏多样性、收敛于局部最优解的缺陷,结合梯级水库发电优化调度的特点,提出了应用差分演化算法改进粒子群的混合优化算法。通过实际算例验证了该混合方法的合理性和可靠性,从而为高维、复杂梯级水库发电优化调度模型求解提供了一种新的途径。     

Maximum loadability limit of power system using hybrid differential evolution with particle swarm optimization

Differential evolution (DE), a simple evolutionary algorithm which shows superior performance in global optimization. Since it utilizes the differential information to get the new candidate solution, sometimes it results in instability of performance. Particle swarm optimization (PSO) is widely used to solve the optimization problems as it can converge quickly. But PSO easily gets stuck in local optima. Hybridization of DE and PSO (DEPSO) eliminates the disadvantages of both. This paper presents the application of DEPSO algorithm to determine the maximum loadability limit of power system. It is tested on Matpower 30 bus and IEEE 118 bus systems. To compare the performance of this DEPSO algorithm with other evolutionary algorithms like DE and Multi Agent Hybrid PSO, statistical measures like best, mean, standard deviation of results and average computation time over 20 independent trials are considered here. The results show the better performance of DEPSO algorithm to solve the maximum loadability problem. DEPSO algorithm provides high maximum loading point in reduced time.     

考虑运行风险的主动配电网分布式电源多目标优化配置

考虑配电网运行中的不确定性,文章通过改进蒙特卡洛法生成大量预想事故集,利用潮流计算和拓扑分析得到接入分布式电源后系统运的行风险。提出一种考虑主动配电网运行风险的分布式电源多目标优化配置模型,将主动配电网运行带来的运行风险RL与分布式电源运行成本CDG作为目标函数,采用改进的粒子群算法对多目标优化模型进行求解,获得分布式电源安装位置和安装容量以及运行风险与运行成本之间的权衡关系。仿真算例表明,所提出的考虑主动配电网运行风险的分布式电源多目标优化配置方法,与单一只考虑经济性或者可靠性的优化模型相比更加合理,适用于分布式电源的优化选址和定容,验证了该模型的可行性。     

基于复合学习算法的配电网理论线损计算模型

为了提高配电网理论线损计算精度,提出一种基于复合学习算法的配电网理论线损计算模型。该模型将配电网理论线损计算抽象成多元回归问题,将理论线损计算的各类影响因素和理论线损值分别作为多元回归问题的输入向量和输出向量,并构造样本集输入到复合学习算法中加以训练,以得到配电网理论线损计算模型。复合学习算法由广义回归神经网络完成样本集训练,并在训练过程中利用粒子群算法动态地搜索广义回归神经网络最优训练参数,从而降低了理论线损计算模型的误差。实验结果显示,与传统方法相比基于复合学习算法的配电网理论线损计算模型具有更高的计算精度。     

粒子群优化算法在电力系统中的应用综述

粒子群优化(PSO)算法是一种新兴的群体智能优化技术,其思想来源于人工生命和演化计算理论,PSO通过粒子追随自己找到的最优解和整个群的最优解来完成优化。该算法简单易实现,可调参数少,已得到广泛研究和应用。在大量参阅国内外相关文献的基础上,简要介绍了PSO算法的工作原理,较为全面地详述了粒子群优化方法在电力系统中的应用,如电网规划、检修计划、短期发电计划、机组组合、负荷频率控制、最优潮流、无功优化、谐波分析与电容器配置、参数辨识、状态估计、优化设计等方面,并对今后可能的应用指出了研究方向。     

基于改进差分进化-生物地理学优化算法的最优潮流问题

生物地理学优化算法(biogeography-based optimization,BBO)是一种新提出的全局智能优化算法,但是其应用于最优潮流计算时,具有早熟和收敛不稳定的问题。将BBO与差分进化(differential evolution,DE)算法相结合,并对差分进化部分的改进策略稍做修改,形成改进DE-BBO算法。应用所提方法对IEEE 30节点系统进行了有功优化的计算,并和GA、PSO、BBO和DE 4种方法进行了分析和比较,结果表明所提方法具有良好的收敛稳定性,可以有效缩短迭代时间。     

Optimal siting and sizing of intermittent distributed generators in distribution system

Intermittent distributed generators (IDGs), such as distributed wind turbine generator (WTG) and photovoltaic generator (PVG), have been developing rapidly in recent years. The output power of WTG and PVG highly depends on the wind speed and illumination intensity, respectively. There always exist correlations among the wind speed, illumination intensity, and bus load, which could have significant influence on the determination of siting and sizing of IDGs in distribution system. Given this background, a chance‐constrained‐programming‐based IDGs planning model, which can take into account the correlations, is developed in this paper. Latin hypercube sampling technique and Cholesky decomposition are introduced to handle the correlations. A Monte Carlo simulation‐embedded multi‐population differential evolution algorithm is employed to solve the developed model. Case studies carried out on the Baran & Wu 33‐bus distribution system verify the feasibility of the developed model and effectiveness of the proposed solving methodology. © 2015 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

Distribution network expansion planning and DG placement in the presence of uncertainties

Distribution network expansion planning (DNEP) is one of the most important tools to deal with the demand growth in a system. DNEP is usually carried out through reinforcement or installation of new components. In this paper, a new and combined methodology is used to consider several practical aspects in DNEP such as uncertainty, distributed generation (DG), load growth, electricity market and multi stage dynamic expansion are included in the planning. So that DNEP is addressed in the presence of distributed generation (DG), considering load and price uncertainties under electricity market environment. The proposed planning aims at minimizing investment and operational costs simultaneously. Since DNEP in coordination with DG planning leads to reduce planning cost; therefore, the coordinated DNEP and DG planning are presented in this paper. The proposed planning is implemented by the particle swarm optimization (PSO) technique. Besides, the uncertainties are modeled as the probability distribution function (PDF) and Monte-Carlo simulation (MCS) is used to insert the uncertainties into the programming. The proposed planning is carried out based on the 9-bus as well as Kianpars–Ahvaz test systems (Kianpars–Ahvaz is a practical network in Ahvaz province, Iran). The simulation results demonstrate the ability and effectiveness of the proposed planning to deal with uncertainties under electricity market environment.     

考虑源荷不确定性的分布式电源选址定容

大规模的分布式电源入网给配电网的规划带来诸多不确定性因素。为使配网规划结果更加合理,考虑待规划地区的风速、光照强度和负荷的不确定性,构建了以年综合费用最少为目标函数的分布式电源选址定容规划模型。首先,对风、光和负荷进行了概率建模;其次,采用拉丁超立方采样方法生成初始场景,并采用改进的同步回代缩减法对场景进行削减;最后,鉴于粒子群算法具有收敛速度慢和容易早熟的缺点,将自适应惯性权重和混沌优化算法融入粒子群算法中,进而提出了一种改进型粒子群算法,并且在IEEE 33节点的标准算例系统上进行了仿真,结果表明所建模型和所提算法的合理性与有效性。