Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

Particle Swarm Optimization Algorithm vs Genetic Algorithm to Develop Integrated Scheme for Obtaining Optimal Mechanical Structure and Adaptive Controller of a Robot

The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.

Design of Radial Basis Function Network Using Adaptive Particle Swarm Optimization and Orthogonal Least Squares

This paper presents a two-level learning method for designing an optimal Radial Basis Function Network (RBFN) using Adaptive Velocity Update Relaxation Particle Swarm Optimization algorithm (AVURPSO) and Orthogonal Least Squares algorithm (OLS) called as OLS-AVURPSO method. The novelty is to develop an AVURPSO algorithm to form the hybrid OLS-AVURPSO method for designing an optimal RBFN. The proposed method at the upper level finds the global optimum of the spread factor parameter using AVURPSO while at the lower level automatically constructs the RBFN using OLS algorithm. Simulation results confirm that the RBFN is superior to Multilayered Perceptron Network (MLPN) in terms of network size and computing time. To demonstrate the effectiveness of proposed OLS-AVURPSO in the design of RBFN, the Mackey-Glass Chaotic Time-Series as an example is modeled by both MLPN and RBFN.

A Hybrid Differential Evolution Algorithm Integrated with Particle Swarm Optimization

To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.

Optimization of Adaptive Fuzzy Controller for Maximum Power Point Tracking Using Whale Algorithm

The advantage of fuzzy controllers in working with inaccurate and nonlinear inputs is that there is no need for an accurate mathematical model and fast convergence and minimal fluctuations in the maximum power point detector.The capability of online fuzzy tracking systems is maximum power,resistance to radiation and temperature changes,and no need for external sensors to measure radiation intensity and temperature.However,the most important issue is the constant changes in the amount of sunlight that cause the maximum power point to be constantly changing.The controller used in the maximum power point tracking(MPPT)circuit must be able to adapt to the new radiation conditions.Therefore,in this paper,to more accurately track the maximumpower point of the solar system and receive more electrical power at its output,an adaptive fuzzy control was proposed,the parameters of which are optimized by the whale algorithm.The studies have repeated under different irradiation conditions and the proposed controller performance has been compared with perturb and observe algorithm(P&O)method,which is a practical and high-performance method.To evaluate the performance of the proposed algorithm,the particle swarm algorithm optimized the adaptive fuzzy controller.The simulation results show that the adaptive fuzzy control system performs better than the P&O tracking system.Higher accuracy and consequently more production power at the output of the solar panel is one of the salient features of the proposed control method,which distinguishes it from other methods.On the other hand,the adaptive fuzzy controller optimized by the whale algorithm has been able to perform relatively better than the controller designed by the particle swarm algorithm,which confirms the higher accuracy of the proposed algorithm.

Improved Prediction of Metamaterial Antenna Bandwidth Using Adaptive Optimization of LSTM

The design of an antenna requires a careful selection of its parameters to retain the desired performance.However,this task is time-consuming when the traditional approaches are employed,which represents a significant challenge.On the other hand,machine learning presents an effective solution to this challenge through a set of regression models that can robustly assist antenna designers to find out the best set of design parameters to achieve the intended performance.In this paper,we propose a novel approach for accurately predicting the bandwidth of metamaterial antenna.The proposed approach is based on employing the recently emerged guided whale optimization algorithm using adaptive particle swarm optimization to optimize the parameters of the long-short-term memory(LSTM)deep network.This optimized network is used to retrieve the metamaterial bandwidth given a set of features.In addition,the superiority of the proposed approach is examined in terms of a comparison with the traditional multilayer perceptron(ML),Knearest neighbors(K-NN),and the basic LSTM in terms of several evaluation criteria such as root mean square error(RMSE),mean absolute error(MAE),and mean bias error(MBE).Experimental results show that the proposed approach could achieve RMSE of(0.003018),MAE of(0.001871),and MBE of(0.000205).These values are better than those of the other competing models.

混合策略改进的粒子群算法

针对粒子群算法易陷入局部最优、收敛精度低、收敛速度慢等缺陷,提出了基于混合策略的改进粒子群算法。使用融合Circle映射与精英反向学习的策略初始化种群,提升初始种群的质量,同时加快收敛速度;在粒子速度更新方式中引入蜘蛛移动策略平衡算法的全局搜索与局部搜索;提出了基于自适应t分布的变异策略,增强算法全局搜索和跳出局部最优能力;对15个单峰和多峰函数进行仿真实验,与其他3种算法进行了对比分析,结果表明:所提出的改进算法具有很强的寻优能力与稳定性。

基于改进PSO算法的光伏阵列MPPT研究

为解决传统粒子群优化(PSO)算法在寻优过程中出现粒子早熟、收敛速度慢、易陷入局部优化等问题,提出一种基于反向学习的Logistic-Tent双重混沌映射和时变双重压缩因子(TVCF)策略的改进粒子群优化(LT-TVCFPSO)算法,在传统PSO算法基础上,引入了Logistic-Tent混沌映射和TVCF,既可增强种群多样性,避免粒子早熟,跳出局部优化,又能加快粒子收敛,提升全局寻优能力。最后在MATLAB/Simu-link上进行仿真。仿真结果表明:相比于传统MPPT算法,LT-TVCFPSO算法能够快速准确地追踪到全局最大功率点(GMPP)。

复杂多方向威胁下的导弹预警雷达优化部署方法

针对现有导弹预警雷达部署相对独立、协同困难,难以满足大规模对抗场景的现状,从远程预警雷达、跟踪识别雷达、机动式预警雷达不同的任务特点出发,建立应对复杂多方向威胁的多型导弹预警雷达优化部署模型,在满足最优覆盖、协同交接、目标识别等任务约束下,解决雷达协同部署问题。针对所提模型设计了一种基于云自适应的分区优化离散粒子群(CPBPSO)算法,通过设计分区编码策略缩减算法求解空间、加入云自适应变异算子提高算法全局寻优和局部跳出能力,使算法更适用于导弹预警雷达部署问题的处理。实例验证了所提模型在求解单方向、多方向威胁场景部署问题的可行性,对比分析了CPBPSO算法的有效性,基本满足导弹预警雷达最优化协同部署的需求。

基于改进T分布烟花-粒子群算法的AUV全局路径规划

针对传统粒子群算法在处理自主水下机器人(Autonomous Underwater Vehicle,AUV)全局路径规划时面临的寻优时间长、能耗高的问题,本文提出一种改进的T分布烟花-粒子群算法(T-distribution Fireworks-Particle Swarm Optimization Algorithm,TFWA-PSO),该算法融合了烟花算法的高效全局搜索能力和粒子群算法的快速局部寻优特性.在变异阶段,提出自适应T分布变异来扩大搜索范围,并在理论上证明了该变异方式能够使个体在局部最优解附近增强搜索能力.在选择阶段提出了适应度选择策略,淘汰适应度差的个体,解决了传统烟花算法易丢失优秀个体的问题,并对改进的T分布烟花算法与传统烟花算法的收敛速度进行对比.将改进算法的爆炸操作、变异操作和选择策略融合到粒子群算法中,对粒子群算法的速度更新公式进行了改进,同时从理论上对所改进的算法进行了收敛性证明.仿真实验结果表明,TFWA-PSO能够有效规划出一条最短路径,同时与给定的智能优化算法相比,TFWA-PSO在寻找最优路径的时间上平均降低了24.72%,能耗平均降低了17.33%,路径长度平均降低了16.96%.

公路隧道风光水储互补发电系统容量配置研究

为降低公路隧道的电力运营成本,探究可再生能源互补发电系统在公路隧道的应用前景,研究合适的容量配置求解方法。建立利用风、光、水和储能设备的互补发电系统为公路隧道提供电力资源。以特长公路隧道(总长7.1 km)为估算模型,采用改进后的粒子群优化算法,即离散型自适应粒子群优化算法,以全生命周期的建设成本和设备维护成本最小为目标函数,以缺电负荷率(LPSP)和储能电池的状态为约束,对风力发电设备、光伏发电设备、水力发电设备和储能设备的最优容量配置进行求解。结果表明:1)对比标准粒子群算法,离散型自适应粒子群优化算法的总投入成本更少,寻优能力更强;2)对比该隧道1年的用电成本,前期投入将在5年内回本;3)在风光水储互补发电系统的设备全生命使用周期的20年内,该隧道可节省1 920.39万元电费。

基于双通道生成对抗网络的城市用电负荷缺失数据补全方法

用电负荷数据的完整性与有效性在负荷预测等应用中具有重要意义。传统的缺失数据补全方法缺乏对用电负荷和多种外部时空关联信息的挖掘,难以获得高精度的补全结果。文中提出了一种双通道生成对抗网络,对缺失的负荷数据进行补全。首先,根据负荷的周期性变化特征和时空关联性构建三阶负荷张量,并将影响负荷变化的多种外部因素构建为三阶辅助信息张量。然后,为满足两种张量的双输入需求,在生成对抗网络的输入层引入双通道机制,通过卷积与反卷积运算提取张量的特征;为提升网络对张量数据的训练效果和补全精度,将张量分解损失引入原始损失函数,并采用改进的混沌映射粒子群优化算法联合优化超参数和网络。最后,在真实负荷数据集上开展数据补全实验。结果表明,所提方法能够对随机缺失率不超过50%、连续缺失不超过3天的负荷数据进行准确补全。

引入PID反馈的SHAEKF算法估算电池SOC

电池荷电状态(SOC)的估算精度是电动汽车电池组的重要指标。为提升SOC估算精度,在融合Sage-Husa扩展卡尔曼滤波(SHEKF)算法与自适应扩展卡尔曼滤波(AEKF)算法的基础上,增加比例积分微分(PID)反馈环节,形成改进算法。采用粒子群优化(PSO)算法对二阶RC等效电路模型进行参数辨识;用开源电池数据集对模型和算法进行实验和分析。改进的SHAEKF算法在电池动态应力测试(DST)、北京动态应力测试(BJDST)和美国联邦城市驾驶(FUDS)等工况下的平均估计误差都在1%以内,与单纯的融合算法SHAEKF算法相比,最大误差可减小5%。

基于多变量灰色系统的乏信息堤防变形短期预测模型

依据信息模糊和不确定状态下乏信息数据处理理论,提出了一种改进多变量灰色系统的乏信息堤防短期预测模型;引入多变量灰色模型对多测点的沉降变形序列进行拟合,结合混沌粒子群优化算法和分数阶微积分理论,实现了在乏信息条件下对堤防多测点变形的短期预测;由对比结果可知,研究提出的模型可行且有效,填补了堤防乏信息处理模型的空白。

基于自适应变异粒子群算法的装配式建筑施工安全投入优化

针对装配式建筑施工安全投入问题,以实际工程项目为例,对装配式建筑施工风险因素进行了二级分解;基于数学规划理论建立了非线性规划模型,并引入3种函数关系进行拟合;采用自适应变异粒子群算法在Matlab中进行求解,得到了相对较优方案。结果表明:在安全风险主要因素中,物的风险因素对安全投入最为敏感;在二级风险因素中,预制构件吊装器具的选择最为敏感,该结论可为日后施工安全投入的方向提供参考依据。

港口高压开关柜局部放电信号自适应小波去噪方法

为了有效抑制港口高压开关柜局部放电实测信号中存在的白噪声,文中提出一种基于小波的自适应阈值去噪算法。首先对小波阈值去噪算法中的阈值选取及阈值函数进行优化,通过添加变量增加算法的适用性和灵活性,并使用改进后的粒子群算法(SPSO)对添加的变量进行最优值求解从而实现小波分解层数、小波阈值和阈值函数的自适应选取;其次对仿真信号与实测信号进行去噪。结果表明:与传统软、硬阈值函数去噪相比,使用文中所提算法去噪后的信号信噪比分别提高了5.31 dB和2.38 dB。由去噪后信号的时域图可以看出,与其他几种算法相比本文提出的算法不仅去噪效果良好,还能极大地保留信号中的有效成分。

基于混沌多目标粒子群算法的综合能源调度

目的针对当前综合能源系统中资源协同优化效率不足、微网运行经济性和环保性差的问题,提出了一种计及风电储能及不稳定因素的微网优化调度方法。方法该方法在微网负荷侧需求响应对新能源消纳影响的基础上,以消纳新能源和削峰填谷为目的,提出了优化负荷曲线的方案;然后,考虑微网调度侧风电出力的不稳定性以及微网内部设备的耦合,进行优化调度以降低微网运行成本、减少环境惩罚费用并提高风电消纳平稳性;最后,采用混沌多目标粒子群算法对优化问题进行求解,并在风电不稳定度占比0%、5%、10%和15%时进行了算例仿真分析。结果当风电不稳定度为10%和加入风电储能,系统运行成本和环境治理费用最少,比方案1和无风电储能少6919.4元,风电平稳量也提高38 kWh。在电热冷网中,负荷侧加入需求响应后,系统得到稳定运行和能源合理利用,可以很好地满足负荷侧用能需求。从算法对比中,混沌多目标粒子群算法加入自适应权重和变异率后,具有较强的全局搜索能力和更好的准确性。结论该方法通过合理设置风电不稳定度能够有效降低运行成本和环境惩罚费用,提高风电稳定性,其次,负荷侧的需求响应可以一定程度地削峰填谷和消纳新能源。

基于寻优算法的双馈风机变流器动态运行控制参数辨识

针对运行过程中双馈风机变流器控制参数难以获取的问题,提出了一种基于自适应混沌粒子群算法的转子侧变流器参数辨识方法。首先,基于机组实际运行下可量测电气量时间序列,建立双馈风机变流器控制系统离散化数学模型;然后,根据不同观测电气量下参数的轨迹灵敏度,对辨识难易程度进行分析;最后,利用自适应混沌粒子群算法对变流器PI控制参数进行辨识。仿真实验结果验证了所提出辨识方法的准确性与可行性。