Pursuit‐Escape Particle Swarm Optimization

This paper presents a new Particle Swarm Optimization (PSO) with pursuit and escape behavior. This method takes a cue from the behaviors of schools of sardines and pods of killer whales. When the sardines are attacked by the killer whales, they would behave unusually, that is, the sardines would escape from the killer whales, and on another front, the killer whales would pursue the sardines. By this method, particles are divided into two categories called the pursuit‐particles and the escape‐particles, having interactions with each other. They play the key roles of intensification and diversification, respectively. This allows the particles to avoid local optimal solutions and find a global optimal one, and also achieve an appropriate balance between diversification (global search) and intensification (local search) during the search. Then, the proposed method is validated through numerical simulations using several functions which are well‐known as the optimization benchmark problems by comparing them to powerful methods such as SAPPO, LDIWM, and CFM. Copyright © 2007 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

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.     

Dynamic parameter tuning of particle swarm optimization

This paper proposes an adaptive particle swarm optimization (PSO) algorithm using the information defined as the average absolute value of velocity of all of the particles, which can be used as an index to understand the briskness of all the particles. While a stability analysis of PSO algorithm is carried out on the basis of not only a simplified model but also simple numerical simulations, an adaptive strategy for tuning one of its parameters is introduced so as to follow a given ideal average velocity by feedback control. The feasibility and advantages of the proposed adaptive PSO algorithm are verified through numerical simulations using some typical global optimization problems. © 2006 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

A competitive particle swarm optimizer and its application to wireless sensor networks

In this paper, a simple competitive particle swarm optimizer for finding plural acceptable solutions is proposed. In the proposed algorithm, particles are divided into plural groups corresponding to the required number of solutions. The groups simultaneously search for solutions in their own priority search regions. These regions prevent the different groups from searching for the same solutions. The proposed algorithm can effectively find desired plural acceptable solutions without introducing complex judgments for convergences to each solution and without increasing the number of search iterations. Also, the proposed algorithm can easily control distances between these solutions by adjusting a single additional parameter. Through numerical experiments, the effectiveness of the proposed algorithm is verified. In addition, the proposed algorithm is applied to a problem in wireless sensor networks. It is shown that obtained results can contribute to prolonging lifetime of such networks. © 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

电力系统经济负荷分配的量子粒子群算法

本文首次将量子粒子群算法用于电力系统经济负荷分配中。该算法是以粒子群中粒子的收敛特性为基础,依据量子物理理论提出的,改变了传统粒子群算法的搜索策略,可使粒子在整个可行解空间中搜索寻求全局最优解。同时该算法的进化方程中不需要速度向量,而且进化方程的形式更简单,参数较少且容易控制。对两个算例进行仿真测试,证实该算法可有效解决经济负荷分配问题;性能对比显示,该算法求得的解优于已有的改进粒子群算法及其它优化算法所求得的解。本文为量子粒子群算法用于经济负荷分配的实用化研究奠定了必要的理论基础。     

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

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

Consideration of Particle Swarm Optimization combined with tabu search

This paper presents a new form of Particle Swarm Optimization (PSO) based on the concept of tabu search (TS). In PSO, when a particle finds a local optimal solution, all of the particles gather around that one, and cannot escape from it. On the other hand, TS can escape from the local optimal solution by moving away from the best present solution. The proposed Tabu List PSO (TL‐PSO) is a method for combining the strong points of PSO and TS. This method stores the history of pbest in a tabu list. When a particle has a reduced searching ability, it selects a pbest of the past from the historical values, which is used for the update. This makes each particle active, and the searching ability of the swarm makes progress. The proposed method was validated by numerical simulations with several functions that are well known as optimization benchmark problems for comparison to the conventional PSO method. © 2010 Wiley Periodicals, Inc. Electr Eng Jpn, 172(4): 31–37, 2010; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20966     

基于局优分支优化的粒子群收敛保证算法及其在电网规划中的应用

总结了粒子群（PSO）算法的一些改进方法;分析并指出了PSO算法收敛困难的关键原因;提出了局优分支优化技术.该技术由5要素组成：①局部最优区域的确定;②局部最优区域的闭锁;③局部最优区域的深度搜索;④全局搜索的粒子补充;⑤迭代终止判据.还结合电网规划的特点提出了采用启发式逐步倒推模型对局部最优子群进行深度搜索的技术.在电网规划中的应用表明,该2项技术克服了PSO算法的收敛困难,提高了PSO算法的搜索效率,保证了PSO算法的全局搜索性能和局部搜索性能.同时,也为其它算法提供了新的优化思路.     

改进PSO算法用于电力系统无功优化的研究

由于电力系统无功优化为一有多变量、多约束、非线性的组合优化问题,针对传统粒子群算法收敛精度不高、易陷入局部最优的缺点,提出了一种改进的算法:分别赋予传统算法中的粒子以不同的初始惯性权重,权重较大的粒子拓展搜索空间,惯性权重较小的粒子完成局部强化寻优的工作。用改进的PSO算法无功优化计算IEEE-14节点系统的结果表明:新算法不仅避免了惯性因子权重调整的困难,而且较好地协调了算法的局部与全局搜索能力,可较好地解决电力系统的无功优化问题。     

基于改进PSO算法的UAV三维路径规划研究

提出一种根据适应度值使粒子侧重于不同寻优任务的改进粒子群优化(FPSO)算法,并将其应用于UAV三维路径规划问题。传统粒子群优化(PSO)算法对所有粒子设置统一的控制参数,寻优过程不够灵活,易陷入局部极值且收敛速度慢。改进的FPSO算法提出三种优化策略,即将PSO算法与遗传算法(GA) 结合、设置动态惯性权重、引入步长因子,以充分发挥不同适应度值粒子的搜索优势,使其动态侧重于局部搜索或全局搜索。仿真结果表明,FPSO算法搜索结果更优,迭代次数更少,平均消耗时间比PSO算法缩短22.0%、比GA算法缩短39.6%,具有显著的性能优势。     

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.     

一种改进粒子群算法在横向磁通永磁电机优化中的应用

通过对鸟、鱼等动物群体捕食行为的深入分析,进行了粒子群优化算法的改进研究:在优化过程中,动态调整学习因子和惯性参量,得到了全新的粒子速度与位置更新模式,从而有效防止了粒子的"早熟"问题,并改善了算法的全局寻优能力。使用提出的改进粒子群算法对典型数学函数进行校验,结果表明:改进算法的全局寻优能力比原算法有明显提高。将其引入电磁场逆问题求解过程,对一台聚磁式横向磁通永磁同步电机进行基于磁钢用量和电机整体体积最小的尺寸优化设计,取得了令人较为满意的效果。     

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.     

求解机组组合问题的改进离散粒子群算法

电力系统机组组合问题是一个高维数、离散、非线性的大规模复杂工程优化问题.文中提出了一种基于改进离散粒子群优化算法求解机组组合问题的新方法.首先采用新的策略生成粒子,以保证所有生成的粒子均为满足基本约束条件的可行解,使整个算法只在可行解区域进行优化搜索;然后引入优化窗口的概念和启发式的规则以缩短计算时间和提高优化精度.仿真结果表明所提出的算法具有解的质量高、收敛速度快的特点,充分证明了它能很好地解决机组组合问题.     

供电设备检修优化算法及其在地区电网中的应用

针对某地区电力局检修计划安排的实际情况,建立了满足地区电网要求的检修计划优化模型。该模型基于停电范围形成变量集,并以设备偏离到期检修时间最少和工作量分配最合理为目标函数。采用混沌粒子群优化(chaos particle swarm optimization,CPSO)算法来求解模型,该算法将所有粒子分成几个粒子簇。粒子向最优点靠拢的过程中,在解空间做混沌搜索,并更新粒子的历史最优值。通过某地区电网算例,对CPSO算法与遗传算法、标准PSO算法进行了比较,结果表明CPSO算法全局搜索能力和收敛性能优于后2种方法,具有良好的工程应用前景。     

多样性引导的改进量子粒子群优化算法及其在干式空心电抗器优化设计中的应用

针对量子粒子群优化(quantum-behaved particle swarm optimization,QPSO)算法在求解复杂问题时的早熟收敛现象,提出了多样性引导的改进量子粒子群优化(diversity-guided modified QPSO,DGMQPSO)算法。该算法对基于混合概率分布的QPSO算法进行了扩展,利用群体多样性信息来引导粒子的搜索,即当群体的多样性小于下限值时,对全局最优粒子的位置进行混沌变异,从而提高群体的多样性,增强算法跳出局部最优解的能力;另外,还分析了采用不同混沌随机序列变异对优化设计结果的影响。对50 kvar干式空心电抗器的优化设计表明,DGMQPSO算法具有较强的全局搜索能力、较好的稳定性和良好的优化效果。     

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.     

确定复杂环网方向保护最小断点集的改进离散粒子群优化算法

确定复杂环网方向保护最优配合顺序的核心步骤是求解最小断点集(minimum break point set,MBPS)。文章提出一种基于改进的离散粒子群优化算法(discrete particle swarm optimization,DPSO)求解MBPS的新方法。该方法首先以带约束的策略生成初始粒子,然后在迭代中引入惯性权重因子来平衡粒子的全局与局部搜索能力,同时增加一个固定粒子飞行方向的约束,以保证搜索始终在解的可行域中进行。文章最后以具有典型线路保护配置的电力系统为例进行了仿真,结果表明,新方法能以较快的收敛速度和较高的收敛精度得到MBPS的可行解,具有较好的实用性和有效性。     

Improvement of particle swarm optimization based on the repetitive search guideline

Particle Swarm Optimization (PSO), which has attracted a great deal of attention as a global optimization method in recent years, has the drawback that continuous search based on its excellent dynamic characteristics cannot be performed stably until the end of computation due to its very strong tendency to convergence. In this paper, we propose a ARepetitive Search Guidelinewhich differs from the common guidelines in the improved methods which have since been proposed and by which the continuous search in PSO is achieved without losing PSO's excellent dynamic characteristics due to repetitive search in a promising area where the objective function values are expected to be small. We consider four improved methods based on the proposed guidelines, then confirm their effectiveness by application to 100‐variable multipeaked benchmark problems. 2010 Wiley Periodicals, Inc. Electr Eng Jpn, 173(2): 42–54, 2010; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ eej.20964     

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

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