基于分布估计—单亲遗传算法的配电网规划

为了改善单亲遗传算法在某些方面存在的缺陷,提出一种分布估计算法与单亲遗传算法相结合的混合智能算法进行配电网的优化规划。并结合普里姆(Prim)算法产生初始种群,获得比完全随机产生的配电网络更优的初始方案。分布估计算法根据所得分布概率可为单亲遗传算法提供搜索方向,而后者则加速了前者精确分布概率模型的获得,二者的结合起到了优势互补的作用。实例计算的对比结果表明,混合算法更加稳定高效。     

免疫算法及其在电力系统无功优化中的应用

提出一种用于电力系统无功优化的免疫算法(Immune Algorithm,IA).该算法是根据生物免疫原理提出的,与遗传算法相比,它具有抗原识别、记忆、抗体的抑制和促进等显著特点.IA将目标函数和约束条件比作抗原,将问题的解比作抗体.通过亲和度的计算来评价抗体并促进或抑制抗体的产生,减小了进化过程陷入局部最优解的可能性;通过抗原记忆,提高了局部搜索能力,加快了计算速度.将IA用于69节点实际电力系统的无功优化计算,并与传统遗传算法的计算结果进行了比较.结果表明IA能够以更快的速度得到最优解,其性能明显优于遗传算法.     

基于分布估计算法和遗传算法融合的神经网络故障诊断模型研究

本文构造了基于分布估计算法(Estimation of Distribution Algorithm,EDA)和遗传算法(GeneticAlgorithm,GA)融合的神经网络(Neural Network,NN)故障诊断模型。传统的GA看作是对生物进化"微观"层面上的模拟,则EDA是对生物进化"宏观"层面上的建模,是一种全新的进化模式。EDA与GA融合的实质是在解空间"宏观"和"微观"两个层面进行寻优,可克服NN陷入局部最小,提高NN的泛化能力,使故障诊断的容错性能得到有效改善。将该模型用于高压输电线系统的故障诊断,并作容错性能的评估。由仿真测试表明,研究模型的容错性能要优于传统的BP-NN模型和单纯GA优化NN模型。因此,新诊断模型是有一定的理论和实用价值的。     

Multiobjective process planning and scheduling using improved vector evaluated genetic algorithm with archive

Multiobjective process planning and scheduling (PPS) is a most important practical but very intractable combinatorial optimization problem in manufacturing systems. Many researchers have used multiobjective evolutionary algorithms (moEAs) to solve such problems; however, these approaches could not achieve satisfactory results in both efficacy (quality, i.e., convergence and distribution) and efficiency (speed). As classical moEAs, nondominated sorting genetic algorithm II (NSGA‐II) and SPEA2 can get good efficacy but need much CPU time. Vector evaluated genetic algorithm (VEGA) also cannot be applied owing to its poor efficacy. This paper proposes an improved VEGA with archive (iVEGA‐A) to deal with multiobjective PPS problems, with consideration being given to the minimization of both makespan and machine workload variation. The proposed method tactfully combines the mechanism of VEGA with a preference for the edge region of the Pareto front and the characteristics of generalized Pareto‐based scale‐independent fitness function (gp‐siff) with the tendency to converge toward the central area of the Pareto front. These two mechanisms not only preserve the convergence rate but also guarantee better distribution performance. Moreover, some problem‐dependent crossover, mutation, and local search methods are used to improve the performance of the algorithm. Complete numerical comparisons show that the iVEGA‐A is obviously better than VEGA in efficacy, and the convergence performance is also better than NSGA‐II and SPEA2, while the distribution performance is comparable to and the efficiency is obviously better than theirs. © 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

基于免疫算法的配电网开关优化配置模型

给出了开关优化的数学模型及基于免疫算法的求解方法。分析了开关投资和运行维修费用、停电损失的计算方法，基于等年值法建立开关优化配置模型。该模型是一含约束、不可微、非连续的组合优化模型。基于免疫算法给出了模型的求解算法。通过模型计算确定开关的最优配置数量和位置，并得到系统的可靠性、投资费用和停电损失等。计算实例表明：提出的模型和算法有较强的工程实用性，免疫算法具有较好的全局收敛性和较快的收敛速度。     

基于免疫算法的地区电网无功综合效益优化

电力系统无功优化分析中引入的免疫算法（IA）是根据生物免疫原理提出的,具有抗体的多样性、促进性、抑制性以及记忆等功能,是一种全局优化的概率搜索算法。将该算法应用到地区电网的无功综合效益分析中,在兼顾地区电网有功网损最小和功率因数达到要求值的同时,可使电网的无功综合效益达到最优。为此,基于Matlab7．0编制了无功优化程序,并与传统的遗传算法（GA）和Broden非线性规划法进行了比较,结果表明,该算法能加快计算速度,为地区电网经济运行带来可观的经济效益。     

A hybrid evolutionary analogue module placement algorithm for integrated circuit layout designs

This paper presents an integrated approach of simulated annealing (SA) and genetic algorithm (GA) for the analogue module placement in mixed‐signal integrated circuit layout designs. The proposed algorithm follows the optimization flow of a normal GA controlled by the methodology of SA. The bit‐matrix chromosomal representation is employed to describe the location and the orientation of modules. Compared with the conventional bit‐string representation, the proposed chromosomal representation tends to significantly improve the search efficiency. In addition, a slide‐based flat scheme is developed to transform an absolute co‐ordinate placement of modules to a relative placement. In this way, the symmetry constraints imposed on analogue very large scale integration circuits can be easily fulfilled in the placement run. Use of a radiation‐decoder can also drastically shrink the configuration space without degrading search opportunities. The proposed algorithm has been tested with several example circuits. The experiments show this promising algorithm makes the better performance than the simpler SA or GA approaches working alone, and the quality of the automatically generated layouts is comparable to those done manually. Copyright © 2005 John Wiley & Sons, Ltd.     

旅行商问题的免疫算法

介绍了一种模拟生物免疫系统自我调节功能的免疫算法(IA)和这种算法的基本步骤．基于旅行商问题，提出了IA的抗体表示方法、初始抗体的产生方法、抗体与抗原之间以及抗体与抗体之间亲和力的计算方法，构造了几种抗体生成算子．仿真实验表明IA具有较强的全局搜索能力．     

多馈入交直流输电系统的模糊控制器协调优化算法

设计了一套阻尼区域间功率振荡的模糊控制器。在多馈入交直流输电系统的直流功率控制系统和发电机励磁系统中同时采用了该模糊控制器,并对影响其性能的关键参数进行了协调优化。为了解决优化结果容易限于局部最优的问题,采用了遗传算法进行全局并行寻优,同时引入序优化理论在概率意义上保证优化解的质量。仿真结果表明:与常规阻尼控制器相比,模糊控制器能更好地提高交直流互联系统的动态稳定性且具有鲁棒性。序优化遗传算法比传统遗传算法具有更稳定的性能,可作为多馈入交直流输电系统的模糊控制器参数协调优化的一种有效方法。     

Oppositional krill herd algorithm for optimal location of capacitor with reconfiguration in radial distribution system

The delivery of power from sources to the consumer points is always accompanied of power losses. Basically, active losses in distribution systems can be reduced by optimal reconfigurations of the network. Optimal capacitor allocation problem in reconfigured distribution network is a challenge of researchers for several decades. This paper presents a computationally efficient methodology namely, krill herd (KH) algorithm to find optimal location of capacitor and optimal reconfiguration in order to minimize real power loss of radial distribution systems. Moreover, the opposition based learning (OBL) concept is integrated with KH algorithm for improving the convergence speed and simulation results. In order to show the usefulness and supremacy, the conventional KH and proposed oppositional KH (OKH) algorithms are tested on 33-bus and 69-bus radial distribution networks. The simulation results of the proposed methods are compared with fuzzy multi-objective approach and non dominated sorting genetic algorithm (NSGA). The solution results show that OKH technique could generate better quality solutions and better convergence characteristics than those obtained by conventional KH algorithm and other existing optimization techniques available in the literature. Results also show the robustness of the proposed methodology to solve reconfigured distribution network (RDN) problems.     

配电网重构的自适应和声搜索算法

采用和声搜索算法（ＨＳＡ）搜索最优方案进行配电网重构时,会受初始参数值的影响。为此,提出自适应和声搜索算法（ＡＨＳＡ）。在和声搜索算法中加入局部搜索进行改进,增强了算法的寻优性能。建立以降低网络的有功和无功功率损耗为目标的配电网重构的数学模型,采用基于节点分层的前推回代法对网络结构进行潮流计算和分析。对IEEE69节点配电网进行仿真,与和声搜索算法,遗传算法（ＧＡ）的结果进行对比分析,表明该算法的迭代次数少,有较好的收敛效果。在配电网重构的算例应用中,证明了自适应和声搜索算法是可行的。     

遗传禁忌混合算法及其在电网规划中的应用

电网规划是一个较难解决的NP难问题。文中首先就遗传算法、禁忌搜索算法(TS)及其两者的混合算法在旅行商问题(TSP)中的应用来比较它们之间的优缺点,认为采用了TS变异算子的改进遗传算法将大大提高其优化能力;然后通过该混合算法在典型电网扩展规划算例中的应用来看,认为该混合算法适用于求解复杂的电网规划问题;最后通过对该混合算法在求解实际的城市中压配电网络规划问题时与其他两种单一算法的结果比较来看,其搜索效率相比单一算法得到了很大程度的提高,体现了很好的应用前景。     

基于分布估计算法的输电网扩展规划

分布估计算法是一类新的进化算法,它通过统计在当前群体中选出的个体信息给出下一代个体分布的概率估计,用随机取样的方法生成下一代群体.文章将分布估计算法应用于求解输电网扩展规划问题,提出了两种基于分布估计算法(基于群体的递增学习算法和因子分布算法)的电力系统输电网扩展规划模型,分析了加权估计、随机母本规模选择、条件概率链的重新排列、随机变异和精英保留等改进策略对算法的影响.仿真分析结果表明了文中所采用的分布估计算法在求解输电网扩展规划问题时是可靠有效的.     

Combined heat and power economic dispatch by harmony search algorithm

The optimal utilization of multiple combined heat and power (CHP) systems is a complicated problem that needs powerful methods to solve. This paper presents a harmony search (HS) algorithm to solve the combined heat and power economic dispatch (CHPED) problem. The HS algorithm is a recently developed meta-heuristic algorithm, and has been very successful in a wide variety of optimization problems. The method is illustrated using a test case taken from the literature as well as a new one proposed by authors. Numerical results reveal that the proposed algorithm can find better solutions when compared to conventional methods and is an efficient search algorithm for CHPED problem.     

Graph planarization problem optimization based on triple‐valued gravitational search algorithm

This article presents a triple‐valued gravitational search algorithm (TGSA) to tackle the graph planarization problem (GPP). GPP is one of the most important tasks in graph theory, and has proved to be an NP‐hard problem. To solve it, TGSA uses a triple‐valued encoding scheme and models the search space into a triangular hypercube quantitatively based on the well‐known single‐row routing representation method. The agents in TGSA, whose interactions are driven by the gravity law, move toward the global optimal position gradually. The position updating rule for each agent is based on two indices: one is a velocity index which is a function of the current velocity of the agent, and the other is a population index based on the cumulative information in the whole population. To verify the performance of the algorithm, 21 benchmark instances are tested. Experimental results indicate that TGSA can solve the GPP by finding its maximum planar subgraph and embedding the resulting edges into a plane simultaneously. Compared with traditional algorithms, a novelty of TGSA is that it can find multiple optimal solutions for the GPP. Comparative results also demonstrate that TGSA outperforms the traditional meta‐heuristics in terms of the solution qualities within reasonable computational times. Published by John Wiley & Sons, Inc.     

基于免疫算法的配电网故障定位方法研究

提出一种基于免疫算法的配电网故障定位新方法。免疫算法依据个体的亲和度对个体进行评价,根据个体的亲和度和浓度选择进行交叉、变异的个体,增大了群体多样性,避免了算法快速陷入局部最优,同时进化过程建立记忆单元,保留部分最优解,以免交叉、变异过程后群体退化,保证算法终止时得到的结果是历代出现过的最高亲和度的个体。针对多电源开环运行的配电网,结合区域划分思想,通过判断变电站变压器低压侧开关的故障信息,提出一种提高故障定位速度的方法。仿真结果表明该算法可有效实现配电网的故障定位,并通过与遗传算法相对比,验证了免疫算法用于配电网故障定位的有效性及可靠性。     

基于自适应遗传算法和蚁群算法融合的配电网重构

配电网重构可以降低线损,均衡负荷,提高电压质量和增加配电网可靠性.主要在降低线损、提高电压质量和提高寻优效率方面,采用了自适应遗传算法和蚁群算法融合的方法.对遗传算法的交叉因子和变异因子进行了自适应控制,也不再人为规定迭代的最大代数,而是引入了染色体相似度和种群相似度的概念,使遗传算法的终止条件更加合理.自适应遗传算法...     

基于最短路算法和遗传算法的配电网络重构

提出了通过组合负荷实现寻优的重构方法。利用最短路径法按照某一顺序为每个负荷分别寻找供电路径,然后利用遗传算法选择最优的负荷排列顺序,从而实现在局部最优解中寻求全局最优解。通过将容量约束和电压约束转换成弧的权值,在网络形成的过程中就考虑这些约束,从而进一步保证了该算法高效地找到全局优化解。此方法很容易实现树状约束,并对多环的复杂结构网络也能高效地实现重构寻优。     

基于改进差分进化算法的配电网无功优化

采用改进差分进化算法(Improved Differential Evolution Algorithm,IDEA)求解配电网无功优化问题。该算法引入基于反学习的种群初始化方法,使算法得到的初始种群具有多样性,能够充分提取搜索空间的信息;引入高斯扰动机制到交叉操作中,提高了在维尺度上的种群多样性;在进化过程中融入人工蜂群搜索思想,引入蜂群加速进化与侦查操作策略,使算法能快速跳出局部最优,避免了早熟问题。建立了配电网无功优化数学模型,并采用IDE算法对IEEE30节点系统求解该模型,并与基本DE算法进行对比,仿真结果证明了所提IDE算法具有更佳的性能,能够有效的求解配电网无功优化的问题。     

基于改良策略的配电网重构遗传算法

该文提出了基于改良策略的配电网重构遗传算法，通过对与不可行解相对应的个体进行改良操作，打开回路，连通孤岛，使其变为可行解，并使得搜索仅在可行解范围内进行，从而提高搜索效率；文中还针对改良策略，提出了新的编码方案，并改进了遗传操作；最后还对2个算例进行了试算，其结果与最优解相吻合。算例表明本算法具有计算速度快、性能好的特点，可有效地应用于以降低网损为目的的配电网重构中。