一种改进的混合粒子群优化算法

针对粒子群优化算法容易陷入局部极值点、进化后期收敛速度慢、精度较差等缺点,把Hooke-Jeeves模式搜索方法作为粒子群优化算法的一个局部搜索算子,嵌入到粒子群算法中,Hooke-Jeeves的强局部搜索能力提高了粒子群优化算法的局部收敛速度和精度,从而提出了一种混合粒子群优化算法。通过基准函数和实例测试进行了验证,结果表明,提出的混合算法的收敛速度和精度均优于粒子群优化算法。     

3D-Route Planning Method to Realize Missile Cruise Flight

In order to increase the aircraft's survival in the flight mission, it is necessary to carry out flight mission planning, which includes TF/TA2(terrain following/terrain avoidance/threat avoidance). An approach to 3D-route planning based on A heuristic search algorithm was selected to determine the routes of fiber optic guidance missile's cruise segment. The cost function was discussed, which was mainly related to the physical obstacle, threat exposure, and aircraft performance characteristics. The digital map techniques were presented, which included setting “no-go” area according to fiber's safety requirement. The optimal or the sub-optimal route was obtained, while the cost function constraints were satisfied and the stored terrain obtained from a real terrain was digitized. The algorithm is validated through simulation and can fulfill the route planning task which focuses on the cruise segment of fiber optic guidance missile.     

磁性材料成型烧结生产调度优化方法及应用

建立以最小化提前和拖期时间、最小化炉重偏差为目标的混合整数线性规划模型, 解决磁性材料成型-烧结两阶段生产调度问题. 提出一种混合粒子群优化算法(HPSO)进行模型的求解,该算法采用基于订单的编码方式. 针对粒子群算法易陷入局部最优, 在迭代过程中引入模拟退火思想. 改进粒子群算法的全局极值和个体极值选取方式, 使算法尽快收敛到非劣最优解. 生产现场实际数据仿真结果表明: 该混合粒子群算法无论在求解精度, 还是求解速度上均优于普通粒子群算法和遗传算法.     

巡航导弹飞行捷径、高度及速度对突防影响的仿真研究

研究巡航导弹航迹规划中飞行捷径、高度及速度3个关键性因素，重点是通过仿真给出在其约束条件下巡航导弹突防的概率．通过大量实验和作战仿真得出单枚巡航导弹对歼击机火力单元突防的概率随航路捷径、高度以及速度变化的规律和数学模型．     

基于改进粒子群算法考虑阀点效应的经济负荷最优分配

经济分配对于电力系统节能至关重要,是电网中一类典型的优化问题,基于传统的粒子群算法的优化方法由于仅考虑速度与位置参数,易导致局部最优。针对电力系统的有功经济分配,考虑发电机组的阀点效应,提出一种改进型粒子群算法。通过引进视角参数,使粒子的移动状态受到视角的制约,改善传统算法粒子容易早熟而陷入局部最优的缺陷,降低搜索随机性并提高优化精度’仿真结论表明,带有视角参数的改进粒子群算法有更高效的全局搜索能力和更可靠的最优解,为发电机有功经济分配问题提供一种有效的新算法。     

一种基于校正因子的自适应简化粒子群优化算法

针对已有粒子群算法中全局搜索和局部搜索存在盲目性和滞后性以及粒子的早熟收敛等问题,提出了一种基于校正因子的自适应简化粒子群优化算法。该算法在简化粒子群算法基础上,以粒子间平均粒距大小作为触发条件,对惯性权重、平均个体极值和全局极值进行自适应扰动。校正因子可以根据当前粒子群个体信息和全局信息自适应调整,从而完成对当前粒子状态及时准确的更新,最终使粒子可以准确而快速的找到全局最优解。对3种典型测试函数的测试结果表明该算法具有较高的全局和局部搜索能力、能够有效地避免算法陷入局部极值,是一种实用且高效的粒子群改进算法。     

Stability, Convergence of Harmonious Particle Swarm Optimizer and Its Application

Particle swarm optimizer (PSO), a new evolutionary computation algorithm, exhibits good performance for optimization problems, although PSO can not guarantee convergence of a global minimum, even a local minimum. However, there are some adjustable parameters and restrictive conditions which can affect performance of the algorithm. The sufficient conditions for asymptotic stability of an acceleration factor and inertia weight are deduced in this paper. The value of the inertia weight w is enhanced to (-1,1). Furthermore a new adaptive PSO algorithm-harmonious PSO (HPSO) is proposed and proved that HPSO is a global search algorithm. Finally it is focused on a design task of a servo system controller. Considering the existence of model uncertainty and noise from sensors, HPSO are applied to optimize the parameters of fuzzy PID controller. The experiment results demonstrate the efficiency of the methods.     

Stability, Convergence of Harmonious Particle Swarm Optimizer and Its Application

Particle swarm optimizer(PSO),a new evolutionary computation algorithm,exhibits good performance for optimization problems,although PSO can not guarantee convergence of a global minimum,even a local minimum.However,there are some adjustable parameters and restrictive conditions which can affect performance of the algorithm.The sufficient conditions for asymptotic stability of an acceleration factor and inertia weight are deduced in this paper.The value of the inertia weight w is enhanced to(-1,1).Furthermore a new adaptive PSO algorithm-harmonious PSO(HPSO) is proposed and proved that HPSO is a global search algorithm.Finally it is focused on a design task of a servo system controller.Considering the existence of model uncertainty and noise from sensors,HPSO are applied to optimize the parameters of fuzzy PID controller.The experiment results demonstrate the efficiency of the methods.     

Trajectory Optimization Design for Morphing Wing Missile

This paper presents a new particle swarm optimization (PSO) algorithm to optimize the trajectory of morphing-wing missile so as to achieve the enlargement of the maximum range. Equations of motion for the two-dimensional dynamics are derived by treating the missile as an ideal controllable mass point. An investigation of aerodynamic characteristics of morphing-wing missile with varying geometries is performed. After deducing the optimizing trajectory model for maximizing range, a type of discrete method is put forward for taking optimization control problem into nonlinear dynamic programming problem. The optimal trajectory is solved by using PSO algorithm and penalty function method. The simulation results suggest that morphing-wing missile has the larger range than the fixed-shape missile when launched at supersonic speed, while morphing-wing missile has no obvious range increment than the fixed-shape missile at subsonic speed.     

采用扰动加速因子的自适应粒子群优化算法

针对粒子群算法容易陷入早熟收敛和搜索效率不高等问题,分析了几个现有的改进粒子群优化算法．在粒子对称分布有利于提高搜索结果的基础上,对粒子群优化算法进行了改进．改进后的算法可以在运行过程中的不同阶段自适应地以余弦函数的变化方式调整惯性权重系数;在加速因子线性变化的基础上,基于一定的条件对加速因子进行扰动;并确定了相应条件参数的参数取值．通过几个经典的函数,对该算法进行了验证,并与相关文献中改进的粒子群优化算法进行了对比．结果表明,新算法不仅显著提高了收敛速度,而且能有效地改善早熟现象．     

一种改进的粒子群优化算法及其应用

介绍了粒子群优化算法及其原理,针对其后期容易陷入局部极值的缺陷,提出了一种改进粒子群算法.改进算法采用全局最优粒子变异策略和部分粒子群部分维初始化策略.通过将其应用于(N M)容错系统模型的实例,对改进算法的性能进行了分析,结果表明,改进算法的搜索效率和精度均优于一般的粒子群算法,同时具有较好的收敛稳定性.     

多角色多策略多目标粒子群优化算法

针对粒子群算法在解决复杂多目标问题时存在过早收敛和多样性不足的问题,提出多角色多策略多目标粒子群优化算法(MOPSO_RS). 该算法根据粒子的角色划分指标,给不同性能的粒子赋予不同角色;提出多策略的学习参数调整方法和多策略的全局最优粒子选取方法,帮助种群执行各种搜索策略. 不同的学习参数使各角色粒子获得不同的搜索策略,以调整粒子的探索和开发能力. 不同的全局最优粒子使各角色粒子搜索不同区域,提高种群的搜索效率. 为了避免算法陷入局部最优,引入带有高斯函数的变异算子,使粒子根据其角色朝向不同的全局最优粒子变异,提高算法的求解精度. 实验结果表明,对比其他改进多目标算法,MOPSO_RS具有良好的收敛性和多样性,并验证了所提策略的有效性.     

Three-dimensional multi-constraint route planning of unmanned aerial vehicle low-altitude penetration based on coevolutionary multi-agent genetic algorithm

To address the issue of premature convergence and slow convergence rate in three-dimensional (3D) route planning of unmanned aerial vehicle (UAV) low-altitude penetration, a novel route planning method was proposed. First and foremost, a coevolutionary multi-agent genetic algorithm (CE-MAGA) was formed by introducing coevolutionary mechanism to multi-agent genetic algorithm (MAGA), an efficient global optimization algorithm. A dynamic route representation form was also adopted to improve the flight route accuracy. Moreover, an efficient constraint handling method was used to simplify the treatment of multi-constraint and reduce the time-cost of planning computation. Simulation and corresponding analysis show that the planning results of CE-MAGA have better performance on terrain following, terrain avoidance, threat avoidance (TF/TA²) and lower route costs than other existing algorithms. In addition, feasible flight routes can be acquired within 2 s, and the convergence rate of the whole evolutionary process is very fast.     

基于粒子群聚类算法的图像边缘检测

提出了一种基于动态粒子群的聚类算法应用于图像边缘检测。由于FCM算法容易陷入局部最优,并对初始化敏感,这种算法利用粒子群较强全局寻优能力与局部寻优能力,动态确定聚类数目和中心,在此基础上又进行FCM聚类。两者有效地结合起来能搜索到有效的全局最优解。仿真实验表明,该算法应用与图像边缘检测是可行和有效的。     

粒子群算法在多传感器多目标跟踪的应用

多传感器多目标跟踪系统中,数据关联是其中的关键问题之一.它可以表述为多维分配问题,提出了基于粒子群优化算法的多维分配算法,它将多维分配问题中的目标代价函数极小化问题作为组合优化问题求解.通过在粒子群初始化步骤以及交叉和变异时充分考虑确认备选量测,缩小优化搜索范围,能较快找到最优解实现关联.在虚警和漏检、密集目标环境下,该算法应用于多传感器多目标融合系统仿真,结果表明所述算法在多目标数据关联中有较好的可行性和优越性.     

改进的多目标粒子群优化算法及其在雷达布站中的应用

为更好地解决多目标问题,提高多目标优化算法的多样性和收敛性,提出一种改进的多目标粒子群优化算法。算法将种群分为多个子种群同时进行优化搜索并改进粒子速度更新公式,扩大Pareto最优解集的覆盖面;利用反三角函数logistic映射初始化种群,使初始种群分布更均匀;并使用时变变异方法对外部档案进行变异,避免陷入局部最优。通过与标准多目标粒子群优化算法(MOPSO)和NSGA-Ⅱ在标准测试函数ZDT1、ZDT2、KUR上的仿真实验对比,验证了该文提出的改进算法的有效性,并将其应用于雷达优化布站。     

改进粒子群优化算法及其在4G网络-基站选址中的应用

针对粒子群优化算法搜索精度不高、整体上容易陷入局部最小的不足,提出了一种改进的粒子群优化算法.该算法一方面在速度更新式中用粒子群中粒子个体极值的加权值替代粒子的个体极值,另外通过使用两种非线性递减函数对惯性权重进行调整,这种改进有效地提高了粒子群优化算法的收敛速度和全局寻优能力.然后,通过对4个基准函数的仿真,验证了本文改进算法的全局收敛寻优能力.最后,将本文改进算法应用于珠三角地区某市4G网络基站选址优化中.仿真和应用的结果表明,改进后的粒子群优化算法具有更高的收敛速度和全局寻优能力.     

基于量子粒子群算法的测试数据自动生成算法

本文针对现在流行的进化算法生成测试数据存在参数设置难、算法复杂度高、易陷入局部最优解等缺点,提出了一种应用于软件测试中的基于量子粒子群算法（QPSO）的测试数据自动生成算法。该算法是在粒子群（PSO）算法基础上引入量子理论的思想。解决了PSO算法搜索空间有限,容易陷入局部最优解的问题。通过具体实验证明,该方法是有效可行的,其效率也明显高于GA算法和PSO算法。     

基于多样性优化策略的粒子群算法

针对标准粒子群优化算法(SPSO)存在粒子群多样性丢失而易陷入局部最优的问题,提出了一种改进优化算法(PSOBF),该算法通过引入排斥操作而提高了搜索效率.通过对4个标准测试函数的性能数值实验对比,并比较了PSOBF、SPSO及ARPSO算法结果,证实PSOBF可以较好地实现全局与局部搜索的平衡,表明改进算法是有效的.     

航迹预测的多无人机任务规划方法

为提高无人机自主控制性能,实现任务分配与航迹规划整体架构,提出一种基于航迹预测的多无人机任务规划方法.首先,将禁飞区考虑为更接近真实场景的多边形模型;然后,使用改进A*航迹预测算法生成任意两个航迹点间障碍规避后的最短路径,利用该路径近似航迹航程作为任务分配过程的输入信息,建立目标函数,采用改进PSO算法求取最优结果;最后,使用B样条曲线平滑分配后的路径组合,生成无人机可飞行航迹.仿真结果表明,该方法能够以较高的计算速度和精度生成近似最优的任务分配结果和满足飞行约束的平滑航迹.