双局部粒子群算法解决环境经济调度问题

提出一种基于双局部最优的多目标粒子群优化算法,与可行解为优的约束处理方法相结合,来求解决非线性带约束的多目标电力系统环境经济调度问题。该算法针对传统多目标粒子群算法多样性低的局限性,通过对搜索空间的分割归类来增加帕累托最优解的多样性;并采用一种新的双局部最优来引导粒子的搜索,从而增强了算法的全局搜索能力。算法加入了可行解为优的约束处理方法对IEEE30节点六发电机电力系统环境经济负荷分配模型分别在几个不同复杂性问题的情况进行仿真测试,并与文献中的其他算法进行了比较。结果表明,改进的算法能够在保持帕累托最优解多样性的同时具有良好的收敛性能,更有效地解决电力系统环境经济调度问题。     

求解约束优化的改进粒子群算法

针对种群初始化时粒子过于集中和基本粒子群算法搜索精度不高的缺陷,提出了一种求解约束优化问题的改进粒子群算法。该算法引入佳点集技术来优化种群的初始粒子,使种群粒子初始化时分布均匀,因而种群具有多样性,不会陷入局部极值;同时使用协同进化技术使双种群之间保持通信,从而提高算法的搜索精度。仿真实验结果表明：将该算法用于5个基准测试函数,该算法均获得了理论最优解,其中有4个函数的测试方差为0。该算法提高了计算精度且鲁棒性强,可以广泛应用于其他约束优化问题中。     

差分进化粒子群算法求解发电资源调度问题

为了有效地解决水火电力系统资源短期优化调度问题,提出了一种基于差分进化粒子群的调度算法。设计了水火电力系统资源调度问题的数学模型,给出了差分进化粒子群优化算法的框架,通过PSO种群和DE种群之间的信息交流机制以寻求全局最优位置,从而使算法具有动态自适应性,能够较容易地跳出局部最优。实验结果表明,该算法能有效解决水火发电资源调度问题,具有较好的应用价值。     

混合自适应粒子群算法在电力经济调度中的应用

以电力系统中发电成本最低为目标,结合实际发电运行中系统平衡约束和机组操作约束条件,建立电力经济调度(ED)模型。由于标准粒子群算法存在易陷入局部最优的问题,用这种方法求解ED模型得到的最终结果会不太理想。为此,本文提出一种非线性自适应权重调整策略来增强算法全局搜索和局部搜索能力,首先引入小生境优化种群策略使算法跳出局部最优,然后将这种改进后的混合自适应粒子群算法（HAPSO）应用于求解ED模型。最后,算例分析结果表明本文所改进算法的有效性,提高了求解精度。     

基于反向学习和精英提升的无速度项动态粒子群算法

针对粒子群优化算法在处理复杂优化问题时搜索精度低、收敛速度慢且易陷入局部最优的问题，提出一种基于反向学习和精英提升的动态多种群无速度项粒子群算法。首先基于无速度项的粒子位置更新模式，动态划分子群并采用不同的进化策略，利用反向学习为子群拓宽搜索范围，保证种群多样性的同时避免粒子过早陷入局部最优。然后为充分利用优秀粒子的信息并提高搜索精度，改进精英提升策略优化个体历史最优粒子，使用差分进化算法对种群最优粒子进行更新。最后通过CEC2006提出的22个测试函数进行性能测试。结果表明，本文提出的算法相比于其他算法在搜索精度和稳定性上拥有更加出色的性能，并能有效提升算法收敛速度。     

基于差分QPSO的多能源集线器系统优化调度

针对多能源集线器系统优化调度中强耦合、约束复杂和高维度等问题,提出了一种差分进化量子粒子群优化算法.该算法将差分进化算法中的变异、交叉和选择操作与量子粒子群算法中粒子位置更新公式相结合,进而增加了量子粒子群算法中种群的多样性,解决了粒子在搜索中后期易陷入局部最优的问题,提高了算法全局搜索的能力.采用标准测试函数对该算法进行测试,测试结果表明新算法具有良好的收敛性和全局搜索能力.将上述算法应用于多能源集线器系统优化调度中,计算结果表明上述算法的有效性和适用性.     

基于QPSO算法的作业车间调度问题的研究

针对现行的遗传算法存在进化速度过慢和过早收敛的局限,以及粒子群优化算法搜索空间有限、容易陷入局部最优点的缺陷,提出将一种基于量子行为的粒子群优化算法应用于作业车间调度问题.将该问题中的每个调度组成一个多维向量,以此向量作为量子粒子群优化算法中的粒子进行进化,由此在解空间内搜索最优解.实例仿真结果表明,该算法收敛速度快、全局收敛性能好,可以得到比遗传算法、粒子群优化算法更佳的调度效果,证明了算法的有效性.     

双种群粒子群算法及其在UUV路径规划中的应用

提出一种双种群粒子群算法,在粒子进化过程中,具有当前最优位置的种群侧重于局部搜索,而不具有当前最优位置的种群侧重于全局搜索。两个种群在进化过程中受共同的群体最优位置影响进行进化,从而实现信息共享,协调进化。利用几个测试函数对算法性能进行分析验证,并与其他改进算法进行比较,结果表明算法在搜索精度、稳定性以及搜索速度上均优于改进算法。将双种群粒子群算法用于UUV三维空间轨迹规划问题,获得了满意的规划效果。     

改进的耗散量子粒子群优化算法及其应用*

针对量子粒子群优化算法(QPSO)存在着保持种群多样性差、容易陷入局部最优等缺陷,将耗散操作算子引入到QPSO量子角度更新中,提出了改进的耗散量子粒子群优化算法(DQPSO)。为验证算法的有效性,将DQPSO算法应用于标准函数优化问题。仿真结果表明,改进的耗散量子粒子群算法的优化性能优于传统的量子进化算法(QEA)和QPSO算法。可见,在量子角度更新策略中引入耗散操作算子能够使算法更好地保持种群的多样性、摆脱局部最优的限制、提高算法的搜索能力。     

双层多种群PSO在水库群供水优化调度中应用

针对水库群供水优化调度问题,提出了一种带差分进化的双层多种群粒子群算法(DE-TMPSO)。该算法实现粒子群优化算法的群体拓展和双并行运行机制,针对性地提高粒子群算法的全局搜索能力,同时采用不同粒度的多子群并行机制、种群间的双向最优信息流动以及引入差分进化策略也提高了该算法的局部搜索能力,在一定程度上避免了"早熟"现象的发生,具有较好的稳定性,收敛速度也得到了提高。该算法应用于我国南方某流域的水库群供水优化调度问题中,调度结果合理,为求解高维、复杂的水库群供水优化调度提供了新的思路和方法。     

基于改进多目标骨干粒子群算法的电力系统环境经济调度

针对粒子群优化算法种群多样性不足、易陷入局部寻优的问题,提出一种基于改进多目标骨干粒子群优化算法(improved bare-bones multi-objective particle swarm optimization,IBBMOPSO)的电力系统环境经济调度的求解方法.IBBMOPSO采用一种搜索权重非线性递减...     

A multi-objective optimization based solution for the combined economic-environmental power dispatch problem

The combined economic-environmental dispatch issue is multidimensional, non-linear, non-convex and highly constrained problem. It involves multiple and often conflicting optimization criteria for which no unique optimal solution can be determined with respect to all criteria. In this paper a multi-objective optimization based solution to the combined economic-environmental power dispatch is proposed. The derivation of the optimal solution is based on the weighted sum method for which improvements are made in direction of penalty function integration. For that purpose a modified dynamic normalization is suggested. A penalization method based on membership functions is introduced in order to calculate the constraint violations. The objective of the proposed method is gaining an optimal solution for the dynamic combined economic-environmental dispatch problem associated to real power systems. Therefore, the algorithm is applied on different test power systems. The obtained results are analyzed and compared with various optimization techniques presented in the literature. The results demonstrate the efficiency of the proposed method in finding solutions toward global optimum.     

Reserve-constrained multiarea environmental/economic dispatch based on particle swarm optimization with local search

The objective of economic dispatch (ED) is to minimize the total operational cost while satisfying the operational constraints of power systems. Multiarea economic dispatch (MAED) deals with the optimal power dispatch of multiple areas. In this investigation, multiarea environmental/economic dispatch (MAEED) is proposed to address the environmental issue during the ED. Its target is to dispatch the power among different areas by simultaneously minimizing the operational costs and pollutant emissions. In this paper, the MAEED problem is first formulated and then an improved multiobjective particle swarm optimization (MOPSO) algorithm is developed to derive a set of Pareto-optimal solutions. In the proposed version of MOPSO, local search is used to increase its search efficiency. To ensure the system security, tie-line transfer limits between different areas are incorporated as a set of constraints in the optimization process. Moreover, the reserve-sharing scheme is applied to ensure that each area is able to fulfill its reserve requirement. Numerical studies based on a four-area test power generation system are carried out to demonstrate the validity of the proposed optimization method as well as the results from different problem formulations. Comparative results with respect to other optimization methods are also presented.     

基于CRQP的多小区OFDMA系统联合资源分配算法

针对OFDMA多小区系统中相邻小区同频干扰下的吞吐量最大化问题,在系统功率的约束条件下,基于协同量子粒子群算法提出一种子载波和功率联合分配的协同随机量子粒子群算法（CRQP）。分别利用粒子群算法独立优化子载波的功率分配,并利用改进的量子遗传算法独立优化用户的子载波分配。在独立优化的同时,通过随机协同策略避免陷入局部最优解,达到全局最优。仿真结果表明,与传统的分步求解算法相比,CRQP算法能获得更多的系统吞吐量和更高的资源利用率。     

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.     

Optimal reactive power dispatch with uncertainties in load demand and renewable energy sources adopting scenario-based approach

Optimizing reactive power flow in electrical network is an important aspect of system study as the reactive power supports network voltage which needs to be maintained within desirable limits for system reliability. A network consisting of only conventional thermal generators has been extensively studied for optimal active and reactive power dispatch. However, increasing penetration of renewable sources into the grid necessitates power flow studies incorporating these sources. This paper presents a formulation and solution procedure for stochastic optimal reactive power dispatch (ORPD) problem with uncertainties in load demand, wind and solar power. Appropriate probability density functions (PDFs) are considered to model the stochastic load demand and the power generated from the renewable energy sources. Numerous scenarios are created running Monte-Carlo simulation and scenario reduction technique is implemented to deal with reduced number of scenarios. Real power loss and steady state voltage deviation of load buses in the network are set as the objectives of optimization. Success history based adaptive differential evolution (SHADE) is adopted as the basic search algorithm. SHADE has been successfully integrated with a constraint handling technique, called epsilon constraint (EC) handling, to handle constraints in ORPD problem. The effectiveness of a proper constraint handling technique is substantiated with case studies for deterministic ORPD on base configurations of IEEE 30-bus and 57-bus systems using SHADE-EC algorithm. The single-objective and multi-objective stochastic ORPD cases are also solved using the SHADE-EC algorithm. The results are discussed, compared and critically analyzed in this study.     

Modeling a mixed-integer-binary small-population evolutionary particle swarm algorithm for solving the optimal power flow problem in electric power systems

This research discusses the application of a mixed-integer-binary small-population-based evolutionary particle swarm optimization to the problem of optimal power flow, where the optimization problem has been formulated taking into account four decision variables simultaneously: active power (continuous), voltage generator (continuous), tap position on transformers (integer) and shunt devices (binary). The constraint handling technique used in the algorithm is based on a strategy to generate and keep the decision variables in feasible space through the heuristic operators. The heuristic operators are applied in the active power stage and the reactive power stage sequentially. Firstly, the heuristic operator for the power balance is computed in order to maintain the power balance constraint through a re-dispatch of the thermal units. Secondly, the heuristic operators for the limit of active power flows and the bus voltage constraint at each generator bus are executed through the sensitivity factors. The advantage of our approach is that the algorithm focuses the search of the decision variables on the feasible solution space, obtaining a better cost in the objective function. Such operators not only improve the quality of the final solutions but also significantly improve the convergence of the search process. The methodology is verified in several electric power systems.     

Optimal reactive power dispatch by particle swarm optimization with an aging leader and challengers

This study presents a particle swarm optimization (PSO) with an aging leader and challengers (ALC-PSO) for the solution of optimal reactive power dispatch (ORPD) problem. The ORPD problem is formulated as a nonlinear constrained single-objective optimization problem where the real power loss and the total voltage deviations are to be minimized separately. In order to evaluate the performance of the proposed algorithm, it has been implemented on IEEE 30-, 57- and 118-bus test power systems and the optimal results obtained are compared with those of the other evolutionary optimization techniques surfaced in the recent state-of-the-art literature. The results presented in this paper demonstrate the potential of the proposed approach and show its effectiveness and robustness for solving the ORPD problem of power system.     

Comprehensive learning particle swarm optimization for reactive power dispatch

Reactive power dispatch (RPD) is an optimization problem that reduces grid congestion by minimizing the active power losses for a fixed economic power dispatch. RPD reduces power system losses by adjusting the reactive power control variables such as generator voltages, transformer tap-settings and other sources of reactive power such as capacitor banks and provides better system voltage control, resulting in an improved voltage profile, system security, power transfer capability and over all system operation. In this paper, RPD problem is solved using particle swarm optimization (PSO). To overcome the drawback of premature convergence in PSO, a learning strategy is introduced in PSO, and this approach called, comprehensive learning particle swarm optimization (CLPSO) is also applied to this problem and a comparison of results is made between these two. Three different test cases have been studied such as minimization of real power losses, improvement of voltage profile and enhancement of voltage stability through a standard IEEE 30-bus and 118-bus test systems and their results have been reported. The study results show that the approaches developed are feasible and efficient.     

多目标差分进化算法的电力系统无功优化

 在传统电力系统无功优化( Reactive Power Optimization,RPO) 模型中引入电压水平 指标,建立了以网损最小,电压水平最好为目标的多目标差分进化算法( Differential Evolution Algorithm) 的模型。针对基本差分进化算法易陷入局部最优解、收敛速度慢的缺点,提出一种 具有自适应参数策略的改进差分进化算法并首次用于多目标电力系统无功优化问题。通过在 算法进化过程中调整变异因子F 和交叉因子CR,在初期增加种群的多样性、扩大全局搜索区 域; 从而可以避免算法陷入局部最优解; 同时在后期也加快了收敛速度。将该算法用于电力系 统无功优化并仿真计算了IEEE-14 节点标准测试系统,结果验证模型和算法的有效性。