Adaptive differential evolution algorithm for efficient reactive power management

This paper introduces a proposed procedure to solve the optimal reactive power management (ORPM) problem based on a multi-objective function using a modified differential evolution algorithm (MDEA). The proposed MDEA is investigated in order to enhance the voltage profile as well as to reduce the active power losses by solving the ORPM problem. The ORPM objective function aims to minimize transmission power losses and voltage deviation considering the system constraints. The MDEA aims to enhance the convergence characteristic of the differential evolution algorithm through updating the self-adaptive scaling factor, which can exchange information dynamically every generation. The scaling factor dynamically adopts the global and local searches to efficiently eliminate trapping in local optima. In addition, a strategy is developed to update the penalty factor for alleviating the effects of various system constraints. Numerical applications of different case studies are carried out on three standard IEEE systems, i.e., 14-bus, 30-bus and 57-bus test systems. Also, the proposed procedure is applied on Western Delta Network, which is a real part of the Egyptian main grid system. The flexibility of synchronous machines to provide controllable reactive power is proven with less dependency on the discrete reactive power controllers, such as installing the switchable devices and variations of tap changers. The obtained results show the effectiveness of the proposed enhanced optimization algorithm as an advanced optimization technique that was successively implemented with good performance characteristics.     

An enhanced self-adaptive differential evolution based solution methodology for multiobjective optimal power flow

This paper presents an Enhanced Self-adaptive Differential Evolution with Mixed Crossover (ESDE-MC) algorithm to solve the multiobjective optimal power flow problems with conflicting objectives that reflect the minimization of total production cost, emission pollution, L-index, and active power loss. In this algorithm, a combination of eigenvector and binomial crossovers has been used to move the current population towards better search positions to provide good quality solutions. Besides, an adaptive dynamic parameter adjusting strategy is adopted to obtain the appropriate parameter settings in differential evolution algorithm during the evolution process. Further, an external archive is used to preserve all the nondominated solutions evaluated in each iteration and a fuzzy decision-making technique is applied to extract the best compromise solution from all the nondominated solutions in the archive set. Finally, in order to investigate the usefulness of the proposed algorithm, IEEE 30-bus, IEEE 57-bus and Algerian 59-bus systems with different single and multiobjective OPF problems have been solved and the simulation results are evaluated and compared with the other algorithms recently reported in the literature. The results indicate that the proposed algorithm is competent, effective and quite suitable for solving single/multi objective optimal power flow problems.     

一种基于JADE改进的差分演化算法

差分演化算法有局部搜索能力不足、容易跌入局部最优等缺点,其搜索性能主要依赖于对杂交概率和缩放因子的设置。为了改善上述缺陷,对带归档的自适应差分演化算法JADE进行深入的研究与分析,提出了改进的自适应差分演化算法ZJADE。该算法采用斜帐篷混沌映射函数初始化种群,在每次迭代中为每个个体分别产生满足正态分布、柯西分布的杂交概率和满足正态分布的缩放因子,并且记录成功变异个体的杂交概率和缩放因子,引入统计杂交概率,采用两种策略自适应地更新杂交概率。在13个经典测试函数上将ZJADE算法与多种经典自适应差分演化算法进行对比,实验结果表明,ZJADE算法在解的精度与收敛速度上更优,具有更好的搜索性能。     

基于差分进化的改进狼群算法研究

针对传统狼群算法（WPA）存在易陷入局部最优解、计算资源耗费大、鲁棒性低等问题,提出一种基于差分进化的改进狼群算法（DWPA）。首先,通过引入探狼搜索因子、猛狼最大奔袭次数、自适应围攻步长、差分进化策略等对传统狼群算法进行了改进,降低算法计算耗费的同时提高了算法的全局搜索能力;然后,运用马尔可夫链理论证明了DWPA的收敛性;最后,对13个测试函数进行寻优测试并与WPA等4种算法进行对比分析。测试结果表明,DWPA具有良好的鲁棒性和全局搜索能力,在求解多峰、高维、不可分函数方面的寻优能力尤为突出。     

基于改进差分进化算法的在线轨迹优化

首先提出一种基于混沌映射的差分进化算法,通过引入混沌映射的概念,在群体初始化和子代重构两个方面对经典差分进化算法进行改进,提高其寻优精度及稳定性,并通过对几个典型的Benchmark函数进行对比测试,验证该算法的全局收敛能力与稳定性.然后将该改进算法应用于在线轨迹优化,利用其快速寻优、不依赖梯度信息等特点,结合滚动窗口的思想,提出局部极值逃逸方法,实现了轨迹的在线优化.最后在板球系统上通过仿真实验,验证了所提出方法的有效性.     

一种基于改进差分进化算法的源码漏洞检测模型的冷启动方法

源码漏洞检测作为重要的研究课题,其传统方法在面对规模庞大、脆弱性多样化的代码时,存在人工参与度高、未知漏洞检测能力弱等诸多问题。针对以上问题,基于开放源代码的语法语义信息,提出了改进差分进化算法的源码漏洞检测模型冷启动优化方法。运用源码切片技术、启发式优化算法及神经网络模型,解决了漏洞检测模型在启动之初超参数无法准确选定的问题。对于实验中样本信息冗余和正负样本鲜明特征混和的情况,提出了正负样本鲜明特征交叉剔除的思想以减小模型的漏报率及误报率。实验表明,该方法可以有效加速模型的收敛,使得模型在10个epoch内达到稳定,在提升源码漏洞检测模型准确率的同时其收敛速度比其他模型提升了2~3倍。在后续改进实验中,源码漏洞检测模型在所有类型漏洞的准确率上均提高了1~3个百分点,充分证明了改进措施的有效性。该方法的优化策略和改进措施同样适用于其他神经网络分类模型,可以为漏洞检测领域探索新方法和新模型提供思路。     

微分进化粒子滤波

针对传统粒子滤波重采样算法带来的样本贫化问题,提出了一种利用微分进化算法进行重采样的粒子滤波改进方法,新方法通过引入交叉变异操作,保持了粒子的多样性并抑制了粒子退化现象,提高了目标状态的估计与跟踪能力。仿真结果表明,相对于普通粒子滤波,新算法的估计精度提高了一倍,使用较少的粒子数即可完成跟踪任务。     

一种改进的基于差分进化的多目标进化算法

近年来运用进化算法（EAs）解决多目标优化问题（Multi-objective Optimization Problems MOPs）引起了各国学者们的关注。作为一种基于种群的优化方法,EAs提供了一种在一次运行后得到一组优化的解的方法。差分进化（DE）算法是EA的一个分支,最开始是用来解决连续函数空间的问题。提出了一种改进的基于差分进化的多目标进化算法（CDE）,并且将它与另外两个经典的多目标进化算法（MOEAs）NSGA-II和SPEA2进行了对比实验。     

Chaotic krill herd algorithm for optimal reactive power dispatch considering FACTS devices

Conventionally, optimal reactive power dispatch (ORPD) is described as the minimization of active power transmission losses and/or total voltage deviation by controlling a number of control variables while satisfying certain equality and inequality constraints. This article presents a newly developed meta-heuristic approach, chaotic krill herd algorithm (CKHA), for the solution of the ORPD problem of power system incorporating flexible AC transmission systems (FACTS) devices. The proposed CKHA is implemented and its performance is tested, successfully, on standard IEEE 30-bus test power system. The considered power system models are equipped with two types of FACTS controllers (namely, thyristor controlled series capacitor and thyristor controlled phase shifter). Simulation results indicate that the proposed approach yields superior solution over other popular methods surfaced in the recent state-of-the-art literature including chaos embedded few newly developed optimization techniques. The obtained results indicate the effectiveness for the solution of ORPD problem of power system considering FACTS devices. Finally, simulation is extended to some large-scale power system models like IEEE 57-bus and IEEE 118-bus test power systems for the same objectives to emphasis on the scalability of the proposed CKHA technique. The scalability, the robustness and the superiority of the proposed CKHA are established in this paper.     

改进ASMDE算法和RBFNN的配电网线损计算

针对中压配电网结构复杂,运行数据不全,常规网损计算方法难以实施的问题,提出了一种配电网线损的实用计算方法。利用RBF神经网络的强拟合特性,映射配电线路的特征参量与线损之间复杂的非线性关系,记忆配电线路在结构参数和运行参数变化时线损的变化规律,建立了基于RBF神经网络的线损计算模型。采用改进的自适应二次变异差分进化（ASMDE）算法,对RBF神经网络的结构参数进行整体优化,克服了常规算法隐含层与输出层结构参数分开确定,输出层易陷入局部极小的缺点。实例仿真验证了所提方法的有效性和实用性。     

基于超级账本的蚁群因子差分进化算法的可信服务组合优化

为了保障服务组合优化过程中的QoS数据的真实性,提出了一种基于超级账本平台的可信框架;同时为了提高服务组合的优化效率,提出了一种蚁群因子的差分进化算法的服务组合优化方法(ACOF-DE)。首先,在超级账本平台上部署相应节点,构建可信框架,保障候选服务的真实性;然后,将所提出的算法以智能合约的形式,在区块链上对服务组合的优化问题进行求解,使组合过程在可信的环境下执行。该算法通过引入多种蚁群因子,比如蚁群路径因子、最优蚁群因子、信息素因子以及基于蚁群因子的差分计算,帮助算法动态控制搜索空间、记录迭代过程中的关键信息,以提高算法优化能力。最后,通过仿真实验证明可信框架可以有效地保障数据的可信;ACOF-DE相比其他智能优化算法拥有更佳的优化效率。     

差分型复杂过程全局进化方法

复杂过程全局进化算法是一种具有类似分散搜索的通用框架结构,能够高效完成全局搜索的新型进化算法。在该算法的基础上,提出了差分型复杂过程全局进化算法。差分型算法采用拉丁超立方体抽样生成多样性种群,并应用“最小欧几里德距离的最大值法”产生参考集Refset2,以保证参考集的多样性。采用差分变异和交叉策略替代原算法的线性合并,兼顾算法的收敛速度和种群的多样性。应用Nelder-Mead直接搜索法进行局部搜索,防止搜索过程在局部最优点附近反复。仿真结果表明差分型复杂过程全局进化算法,具有较高的搜索效率。     

一种基于多策略差分进化的分解多目标进化算法

为了提高多目标优化问题非支配解集合的分布性和收敛性,根据不同差分进化策略的特点,基于切比雪夫分解机制,提出一种基于多策略差分进化的分解多目标进化算法(MOEA/D-WMSDE).该算法首先采用切比雪夫分解机制,将多目标优化问题转化为一系列单目标优化子问题;然后引入小波基函数和正态分布实现差分进化算法的参数控制,探究一种...     

Dynamic optimal reactive power dispatch based on parallel particle swarm optimization algorithm

In this paper, Message Passing Interface (MPI) based parallel computation and particle swarm optimization (PSO) algorithm are combined to form the parallel particle swarm optimization (PPSO) method for solving the dynamic optimal reactive power dispatch (DORPD) problem in power systems. In the proposed algorithm, the DORPD problem is divided into smaller ones, which can be carried out concurrently by multi-processors. This method is evaluated on a group of IEEE power systems test cases with time-varying loads in which the control of the generator terminal voltages, tap position of transformers and reactive power sources are involved to minimize the transmission power loss and the costs of adjusting the control devices. The simulation results demonstrate the accuracy of the PPSO algorithm and its capability of greatly reducing the runtimes of the DORPD programs.     

折衷的差分演化算法在有约束优化中的应用

设计了一种求解有约束优化问题的新方案,该方案以一种折衷的差分演化算法为基础,应用两个简单的基于可行解的规则引导算法向可行域搜索,应用周期模式处理边界约束。并用该方案优化了一个标准测试集上的全部函数,试验结果表明,与同类方法相比而言,该方案在收敛速度和稳定性两方面表现出较强的竞争力。     

基于小生境的混合差分演化模拟退火算法

提出了一种新的演化算法——基于小生境的混合差分演化-模拟退火算法(NDESA算法),分析了构造NDESA算法的合理性。并且结合典型多峰值测试函数——Shubert函数的求解试验,说明NDESA算法能够高效地、快速地找到具有多个全局最优值点的多峰函数的所有全局最优值点,且参数的选择不必很严格,是一种较好地求解多峰值函数的所有最优值点的方法。还通过实验说明了结合小生境,差分演化和模拟退火算法这三种策略的必要性。     

Exchange market algorithm based optimum reactive power dispatch

In this paper, an exchange market algorithm (EMA) approach is applied to solve highly non-linear power system optimal reactive power dispatch (ORPD) problems. ORPD is most vital optimization problems in power system study and are usually devised as optimal power flow (OPF) problem. The problem is formulated as nonlinear, non-convex constrained optimization problem with the presence of both continuous and discrete control variables. The EMA searches for optimal solution via two main phases; namely, balanced market and oscillation market. Each of the phases comprises of both exploration and exploitation, which makes the algorithm unique. This uniqueness of EMA is exploited in this paper to solve various vital objectives associated with ORPD problems. Programs are developed in MATLAB and tested on standard IEEE 30 and IEEE 118 bus systems. The results obtained using EMA are compared with other contemporary methods in the literature. Simulation results demonstrate the superiority of EMA in terms of its computational efficiency and robustness. Consumed function evaluation for each case study is mentioned in the convergence plot itself for better clarity. Parametric study is also performed on different case studies to obtain the suitable values of tuneable parameters.     

非线性约束优化问题的自适应差分进化算法

提出了一种非线性约束优化问题改进的自适应差分进化算法。该算法对差分进化算法中固定的加权因子和交叉概率因子进行改进;定义了约束违反度函数,将约束优化问题转化为无约束双目标优化问题,在每次迭代中按照约束违反度的大小保留一部分性能较优不可行粒子,有效地维持了种群的多样性;为了扩大粒子的搜索范围引入变异算子。数值实验表明,新算法具有较快的收敛速度和较好的全局寻优能力。     

基于浮点型编码策略的差分多目标柔性车间调度优化

运用进化算法求解柔性车间调度问题时,编码的特殊性对进化策略造成的局限制约了算法的搜索能力。为此,提出一种基于浮点型编码策略的差分多目标优化算法。该算法采用基于工序权重的浮点数编码—解码机制,消除了排列组合型编码方式对进化操作带来的约束,运用差分进化策略生成新个体,以提高优秀个体产生的几率,进而保证算法有更好的收敛性。将算法与传统算法及其改进形式在相同测试用例上进行对比,结果表明,本算法在保证收敛性的同时,搜索到更多的非支配个体,体现出更好的分布性。此外,提出了平行决策和等价平行决策的定义,将柔性车间调度模型的研究拓展至决策空间。