基于融合禁忌搜索粒子群算法的配电网无功优化

从数学角度分析,配电网无功优化是一个非线性、多变量、多约束的混合规划问题。粒子群优化搜索算法被广泛应用于求解配电网无功优化问题。由于粒子群算法粒子群在进化过程易趋向同一化,失去多样性,从而使算法陷入局部最优解。本文在分析配电网无功优化的特性基础上,提出一种改进的紧融合禁忌搜索-粒子群算法用于配电网无功优化问题的求解。通过将禁忌搜索功能融合到粒子历史最优解和全局最优解寻优过程中,避免了粒子群算法寻优过程中出现的局部最优问题,从而提高粒子群算法的全局搜索能力。通过IEEE14节点系统的仿真计算结果表明,改进的算法能取得良好的效果。     

等效线性化方法中系统参数求解的优化算法

等效周期和有效阻尼比的合理取值是保证等效线性化方法求解精度的关键。该研究利用在自振周期和阻尼比两维空间中的全局优化搜索手段,提出了一种确定等效线性化方法系统参数的标准粒子群优化算法。算例分析验证了优化算法求解的可行性。在保证系统参数合理取值的同时,标准粒子群优化算法的计算效率约为统计分析方法的2．0％,从而克服了统计分...     

基于最小二乘支持向量机的电站锅炉高效率低NOx的多目标优化研究

针对锅炉燃烧系统的多目标优化,在所建立的锅炉燃烧系统预测模型的基础上,分别采用加权-粒子群算法和多目标粒子群优化(multi-objective particle swarm optimization,MOPSO)算法优化锅炉系统的可调整运行参数,以实现锅炉高效率低NO_x排放。分析表明,2种优化算法所得的运行参数相近,趋势与燃烧特性分析和燃烧调整试验结果相符合,说明智能算法优化电站锅炉燃烧系统有效可行。但是加权-粒子群优化算法主观依赖性严重,难以选取合适的权值,优化时间长且结果少;而MOPSO算法优化时间远远小于加权-粒子群算法优化时间,并且优化结果更多,优化效率更高,更有利于指导锅炉的实际运行。     

基于混合粒子群优化算法辨识Hammerstein模型

非线性系统辨识是现代辨识领域中的一个主要问题。在非线性系统辨识中,系统常被表示为一系列块连接。针对非线性系统中的Hammerstein模型,本文提出了利用混合粒子群优化算法对非线性系统模型进行辨识。该方法的基本思想是将非线性系统的辨识问题转化为参数空间上的优化问题,然后采用粒子群优化算法(PSO)获得该优化问题的解。为了进一步增强粒子群优化算法的辨识性能,提出利用一种混合粒子群优化算法。最后,给出仿真实验,其结果验证了本文给出的辨识方法是有效的。     

粒子群优化算法在电网规划中的应用

粒子群算法适合求解连续变量优化问题,本文提出了粒子群算法的新离散化方法。常规粒子群算法在电力系统优化问题中取得了成功,但有"趋同性"。本文提出了改进多粒子群优化算法(IPPSO),IPPSO是两层结构:底层用多个粒子群相互独立地搜索解空间以扩大搜索范围;上层用1个粒子群追逐当前全局最优解以加快收敛。粒子群以及粒子状态更新策略不要求相同。     

无功优化中粒子群、遗传算法的简要对比

在做无功优化算法设计时,发现遗传算法和粒子群算法是无功优化的两大主要算法,相关算法都是从这两中标准算法中改进而来,到底选择哪一分支去改进更好,本文通过IEEE6标准节点系统的仿真结表明：粒子群算法用于无功优化具有可行性和有效性,比遗传算法更具优势。     

混合粒子群算法在混流装配线优化调度中的应用

应用粒子群算法求解混流装配线的优化调度问题,给出粒子的构造方法,并针对算法中存在过早收敛的问题,提出了一种与局部优化和粒子微变异方法相结合的混合粒子群算法.给出了一个实例,实例应用粒子群算法和混合粒子群算法分别进行求解,与其他一些方法比较表明,混合粒子群算法可以有效、快速地求得混流装配线优化调度问题的解.     

基于信息熵改进的粒子群算法在桁架结构

提出了信息熵改进的粒子群优化算法用于解决有应力约束、位移约束的桁架结构杆件截面尺寸优化设计问题.首先介绍了信息熵基本理论和基本粒子群优化算法理论,然后对粒子群优化算法作了合理的参数设置,并将信息熵引入粒子群优化算法的适应函数和停机判别准则中.最后对2个经典的优化问题进行求解并与其他算法进行了比较.数据结果表明信息熵改进后的粒子群优化算法在桁架结构优化设计中优于其他同类算法.     

模拟退火-二进制粒子群优化算法在配电网重构中的应用

将模拟退火算法与二进制粒子群算法相结合应用于配电网重构的优化算法既发挥了粒子群算法收敛速度快的特点,又因为引入的模拟退火算法具有的较强的跳出局部最优解能力,实现了有效地避免粒子群算法易陷入局部极值点的缺点,提高了进化后期算法的收敛速度和精度。实例中应用IEEE16节点系统的算例验证了模拟退火-二进制粒子群混合算法在配电网重构中的可行性和有效性。     

基于微粒群算法的系统可靠性优化

微粒群算法是近来发展起来的一种新的优化计算方法,在简要说明微粒群算法的基础上,将该算法用于系统可靠性优化计算,分别对串联系统的可靠性分配、桥联系统的冗余可靠性优化设计问题进行分析计算,探讨了微粒群算法在系统的可靠性优化计算中应用的可行性,计算机仿真结果表明了微粒群算法求解该问题的可靠性和有效性。     

一种基于椭球约束的加速度计粒子群优化静态修正方法

研究了微机电系统加速度计基于椭球约束的静态修正法。根据微机电系统加速度计输出数学模型,采用标准粒子群优化算法估计微机电系统加速度计的输出数学模型中的刻度因数、零偏及正交误差。实验结果表明,该方法有效剔除了采样过程中的随机误差,粒子群优化方法的引入,使得微机电系统加速度计输出能够准确地反映其真实值。     

基于粒子群与聚类的多目标优化算法

针对粒子群优化算法容易陷入局部最优的问题,提出了一种基于粒子群优化与分解聚类方法相结合的多目标优化算法。算法基于参考向量分解的方法,通过聚类优选粒子策略来更新全局最优解。首先,通过每条均匀分布的参考向量对粒子进行聚类操作,来促进粒子的多样性。从每个聚类中选择一个具有最小聚合函数适应度值的粒子,以平衡收敛性和多样性。动态更新全局最优解和个体最优解,引导种群均匀分布在帕累托前沿附近。通过仿真实验,与4种粒子群多目标优化算法进行对比。实验结果表明,提出的算法在27个选定的基准测试问题中获得了20个反世代距离(IGD)最优值。     

基于改进量子粒子群算法的纸浆浓度控制系统

目的为了克服传统PID控制在具有大时滞性、非线性等特点的纸浆浓度控制系统中性能不足和参数调整困难等问题,研究参数在线调整的方法。方法在传统PID控制的基础上,结合量子粒子群仿生算法(QPSO),提出一种量子粒子群算法优化的传统PID控制器参数,并应用于纸浆浓度控制系统;同时对基本量子粒子群算法进行改进,引入交叉算子,并将该控制算法应用到纸浆浓度控制系统中,并与传统控制进行对比。结果与传统PID控制和基本量子粒子群优化的PID相比较,改进的优化算法能够得到更加令人满意的控制效果,具有系统超调量小、响应速度快、鲁棒性高等优良的性能。结论基于改进的量子粒子群优化算法的纸浆浓度控制系统可有效控制纸浆浓度,能够明显提高系统的控制精度等性能指标,更好地满足实际应用的要求。     

Genetic particle swarm parallel algorithm analysis of optimization arrangement on mistuned blades

This article introduces a method of mistuned parameter identification which consists of static frequency testing of blades, dichotomy and finite element analysis. A lumped parameter model of an engine bladed-disc system is then set up. A bladed arrangement optimization method, namely the genetic particle swarm optimization algorithm, is presented. It consists of a discrete particle swarm optimization and a genetic algorithm. From this, the local and global search ability is introduced. CUDA-based co-evolution particle swarm optimization, using a graphics processing unit, is presented and its performance is analysed. The results show that using optimization results can reduce the amplitude and localization of the forced vibration response of a bladed-disc system, while optimization based on the CUDA framework can improve the computing speed. This method could provide support for engineering applications in terms of effectiveness and efficiency.     

求解连续空间优化问题的扩展粒子蚁群算法

扩展蚁群算法是蚁群算法创始人Dorigo提出的一种用于求解连续空间优化问题的最新蚁群算法,但该算法的收敛速度参数和局部搜索参数取值缺乏理论指导,因此其性能受算法参数影响较大.本文提出一种求解连续空间优化的扩展粒子蚁群算法,将粒子群算法嵌入到扩展蚁群算法中用于在线优化扩展蚁群算法参数,减少了参数人为调整的盲目性.从而改善扩展蚁群算法的寻径行为.通过将本文提出的算法与遗传算法、克隆选择算法、蚁群算法、扩展蚁群算法对5种典型测试函数优化的结果对比表明,本文算法在搜索速度和全局搜索能力方面均优于其它算法.     

An improved hybrid self-inertia weight adaptive particle swarm optimization algorithm with local search

As an evolutionary computing technique, particle swarm optimization (PSO) has good global search ability, but the swarm can easily lose its diversity, leading to premature convergence. To solve this problem, an improved self-inertia weight adaptive particle swarm optimization algorithm with a gradient-based local search strategy (SIW-APSO-LS) is proposed. This new algorithm balances the exploration capabilities of the improved inertia weight adaptive particle swarm optimization and the exploitation of the gradient-based local search strategy. The self-inertia weight adaptive particle swarm optimization (SIW-APSO) is used to search the solution. The SIW-APSO is updated with an evolutionary process in such a way that each particle iteratively improves its velocities and positions. The gradient-based local search focuses on the exploitation ability because it performs an accurate search following SIW-APSO. Experimental results verified that the proposed algorithm performed well compared with other PSO variants on a suite of benchmark optimization functions.     

A new multi-objective particle swarm optimizer using empirical movement and diversified search strategies

Most real-world optimization problems involve the optimization task of more than a single objective function and, therefore, require a great amount of computational effort as the solution procedure is designed to anchor multiple compromised optimal solutions. Abundant multi-objective evolutionary algorithms (MOEAs) for multi-objective optimization have appeared in the literature over the past two decades. In this article, a new proposal by means of particle swarm optimization is addressed for solving multi-objective optimization problems. The proposed algorithm is constructed based on the concept of Pareto dominance, taking both the diversified search and empirical movement strategies into account. The proposed particle swarm MOEA with these two strategies is thus dubbed the empirical-movement diversified-search multi-objective particle swarm optimizer (EMDS-MOPSO). Its performance is assessed in terms of a suite of standard benchmark functions taken from the literature and compared to other four state-of-the-art MOEAs. The computational results demonstrate that the proposed algorithm shows great promise in solving multi-objective optimization problems.     

A cloud theory-based particle swarm optimization for multiple decision maker vehicle routing problems with fuzzy random time windows

This article puts forward a cloud theory-based particle swarm optimization (CTPSO) algorithm for solving a variant of the vehicle routing problem, namely a multiple decision maker vehicle routing problem with fuzzy random time windows (MDVRPFRTW). A new mathematical model is developed for the proposed problem in which fuzzy random theory is used to describe the time windows and bi-level programming is applied to describe the relationship between the multiple decision makers. To solve the problem, a cloud theory-based particle swarm optimization (CTPSO) is proposed. More specifically, this approach makes improvements in initialization, inertia weight and particle updates to overcome the shortcomings of the basic particle swarm optimization (PSO). Parameter tests and results analysis are presented to highlight the performance of the optimization method, and comparison of the algorithm with the basic PSO and the genetic algorithm demonstrates its efficiency.     

Comparison of genetic and binary particle swarm optimization algorithms on system maintenance scheduling using prognostics information

Recent technical advances in condition-based maintenance technology have made it possible to not only diagnose existing failures, but also forecast future failures, which is called prognostics. A common method of maintenance scheduling in condition-based maintenance is to apply thresholds to prognostics information, which is not appropriate for systems consisting of multiple serially connected machinery. Maintenance scheduling is defined as a binary optimization problem and has been solved with a genetic algorithm. In this article, various binary particle swarm optimization methods are analysed and compared with each other and a genetic algorithm on a maintenance-scheduling problem for condition-based maintenance systems using prognostics information. The trade-off between maintenance and failure is quantified as the risk to be minimized. The forecasted failure probability of serially connected machinery is utilized in the analysis of the whole system. In addition to the comparison of a genetic algorithm and binary particle swarm optimization methods, a new binary particle swarm optimization that combines the good sides of two binary particle swarm optimizations is presented.