混合SQP的基于完全学习的粒子群优化算法在电力系统中经济分配问题的应用

电力系统经济负荷分配(ELD)问题是电力系统运行中一个重要的优化问题.此前,多种经典数学逼近方法和启发式搜索算法被用于对该问题进行了求解.但是,这些方法仍然存在两个很重要而未引起足够重视的问题:1)算法的稳定性得不到有效保证;2)算法在大规模ELD问题上的性能仍然不能令人满意.CLPSO是一种新的高效全局优化算法.针对其存在的多样性保持能力强但收敛性不足的问题,文中引入序列二次规划SQP,提出了一种新的混合SQP的CLPSO算法SQP-CLPSO.用其求解多个典型ELD问题,并与多种知名算法进行了对比.实验结果表明,SQP-CLPSO具有优秀的收敛性、多样性和可拓展性,是求解复杂ELD问题的有效算法.

考虑风电场并网性能差异的风电集群有功控制策略优化

为更合理准确地控制大规模风电集群接入多重嵌套断面场景下的新能源出力,提出了一种考虑风电场并网性能差异的风电集群有功控制优化策略。该控制策略考虑了新能源发电量、各风电场的指令功率输出偏差值及指令功率输出与实际功率输出偏差值三个方面的影响。在不满足网络安全约束的情况下,将根据风电场并网性能差异实施强制触发策略。通过仿真算例验证了该策略可实现对风电集群有功出力的精确控制,并有效提高了风电的消纳率。

量子群智能优化算法综述

随着科学技术的不断发展,最优化理论及其衍生出的算法已经广泛应用于人们的日常工作与生活当中,现实世界中的很多问题都可以被描述为组合优化问题。群智能优化算法这些年来被证明在解决组合优化问题方面效果显著,将当下处于研究热点的量子计算概念引入群智能优化算法形成的量子群智能优化算法,为更好地解决组合优化问题提出了一个新的研究方向。在过去的二十多年里,许多量子群智能优化算法被不断开发出来,同时在此基础上进行了大量改进与应用。综述了量子蚁群算法、量子粒子群算法、量子人工鱼群算法、量子人工蜂群算法、量子布谷鸟搜索算法、量子混合蛙跳算法、量子萤火虫算法、量子蝙蝠算法等量子群智能优化算法,并对量子群智能优化算法面临的问题以及未来研究方向进行了深入探讨。

Application and optimization design of non-obstructive particle damping-phononic crystal vibration isolator in viaduct structure-borne noise reduction

The problems associated with vibrations of viaducts and low-frequency structural noise radiation caused by train excitation continue to increase in importance.A new floating-slab track vibration isolator-non-obstructive particle damping-phononic crystal vibration isolator is proposed herein,which uses the particle damping vibration absorption technology and bandgap vibration control theory.The vibration reduction performance of the NOPD-PCVI was analyzed from the perspective of vibration control.The paper explores the structure-borne noise reduction performance of the NOPD-PCVIs installed on different bridge structures under varying service conditions encountered in practical engineering applications.The load transferred to the bridge is obtained from a coupled train-FST-bridge analytical model considering the different structural parameters of bridges.The vibration responses are obtained using the finite element method,while the structural noise radiation is simulated using the frequency-domain boundary element method.Using the particle swarm optimization algorithm,the parameters of the NOPD-PCVI are optimized so that its frequency bandgap matches the dominant bridge structural noise frequency range.The noise reduction performance of the NOPD-PCVIs is compared to the steel-spring isolation under different service conditions.

高保真中子输运程序HNET共振计算方法研究

为实现精细化中子物理计算程序HNET高效、精确的共振计算,本文基于自主开发的HDF5格式多群数据库研究并优化了子群共振计算方法。针对子群参数的计算,研究并实施了经调整拟合点方法优化后的帕德近似法,以保证子群参数计算的准确性;为提高计算效率,需解决传统子群方法频繁调用中子输运求解器的问题,采用等效单共振群方法,并对共振核素进行分组,只对每组的代表性核素进行固定源方程求解。基于上述方法,开发了HNET共振计算模块,并针对典型基准例题进行分析验证。数值结果表明:优化后的子群方法能在保证计算效率的前提下,具有较高的计算精度。

基于数据的铝电解槽氧化铝浓度预测

根据铝电解的工艺原理和生产数据特点,分析工艺参数对铝电解槽氧化铝浓度的影响。针对铝电解生产数据存在噪声的问题,及铝电解槽在不同槽况下氧化铝浓度不同的特征,提出具有除噪功能FCM算法(NCFCM算法)的槽况分类多支持向量机氧化铝浓度预测方法;上述方法将训练样本数据分为c类,对每个子类样本建立支持向量机预测模型,用粒子群算法优化模型参数;建立判别函数,判别待预测样本数据所属类别;将待预测样本数据代入相应类的回归模型中进行预测。采用某铝厂电解槽采集数据作为应用案例,建立改进方法预测模型。相比标准模糊C-均值聚类算法的支持向量机模型,改进方法不仅考虑多个铝电解工艺参数对氧化铝浓度的影响,且有高预测精度、低训练难度等优点,为铝电解生产过程的稳定提供参考。仿真证实了改进方法的有效性。

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

Springback prediction for incremental sheet forming based on FEM-PSONN technology

In the incremental sheet forming （ISF） process, springback is a very important factor that affects the quality of parts. Predicting and controlling springback accurately is essential for the design of the toolpath for ISF. A three-dimensional elasto-plastic finite element model （FEM） was developed to simulate the process and the simulated results were compared with those from the experiment. The springback angle was found to be in accordance with the experimental result, proving the FEM to be effective. A coupled artificial neural networks （ANN） and finite element method technique was developed to simulate and predict springback responses to changes in the processing parameters. A particle swarm optimization （PSO） algorithm was used to optimize the weights and thresholds of the neural network model. The neural network was trained using available FEM simulation data. The results showed that a more accurate prediction of s!oringback can be acquired using the FEM-PSONN model.

Driving fatigue fusion detection based on T-S fuzzy neural network evolved by subtractive clustering and particle swarm optimization

In order to improve the accuracy and reliability of the driving fatigue detection based on a single feature, a new detection algorithm based on multiple features is proposed. Two direct driver＇s facial features reflecting fatigue and one indirect vehicle behavior feature indicating fatigue are considered. Meanwhile, T-S fuzzy neural network（TSFNN）is adopted to recognize the driving fatigue of drivers. For the structure identification of the TSFNN, subtractive clustering（SC） is used to confirm the fuzzy rules and their correlative parameters. Moreover, the particle swarm optimization （PSO）algorithm is improved to train the TSFNN. Simulation results and experiments on vehicles show that the proposed algorithm can effectively improve the convergence speed and the recognition accuracy of the TSFNN, as well as enhance the correct rate of driving fatigue detection.

Multiobjective particle swarm inversion algorithm for two-dimensional magnetic data

Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.

AC-PSO ALGORITHM FOR UAV MISSION PLANNING

Choosing the best path during unmanned air vehicle （UAV） flying is the target of the UAV mission planning problem. Because of its nearly constant flight height, the UAV mission planning problem can be treated as a 2-D （horizontal） path arrangement problem. By modeling the antiaircraft threat, the UAV mission planning can be mapped to the traveling seaman problem （TSP）. A new algorithm is presented to solve the TSP. The algorithm combines the traditional ant colony system （ACS） with particle swarm optimization （PSO）, thus being called the AC-PSO algorithm. It uses one by one tour building strategy like ACS to determine that the target point can be chosen like PSO. Experiments show that AC-PSO synthesizes both ACS and PSO and obtains excellent solution of the UAV mission planning with a higher accuracy.

A PSO microseismic localization method based on group waves' time difference information

Aiming at the lower microseismic localization accuracy in underground shallow distributed burst point localization based on time difference of arriva（TDOA）,this paper presents a method for microseismic localization based on group waves’ time difference information Firstly, extract the time difference corresponding to direct P wavers dominant frequency by utilizing its propagation characteristics. Secondly, construct TDOA model with non-prediction velocity and identify objective function of particle swarm optimization （PSO）. Afterwards, construct the initial particle swarm by using time difference information Finally, search the localization results in optimal solution space. The results of experimental verification show that the microseismic localization method proposed in this paper effectively enhances the localization accuracy of microseismic explosion source with positioning error less than 50 cm, which can satisfy the localization requirements of shallow burst point and has definite value for engineering application in underground space positioning field.

PSO algorithm for Young's modulus reconstruction

To get the quantitive value of abnormal biological tissues, an inverse algorithm about the Young＇s modulus based on the boundary extraction and the image registration technologies is proposed. With the known displacements of boundary tissues and the force distribution, the Young＇s modulus is calculated by constructing the unit system and the inverse finite element method （IFEM）. Then a tough range of the modulus for the whole tissue is estimated referring the value obtained before. The improved particle swarm optimizer （PSO） method is adopted to calculate the whole Yong＇s modulus distribution. The presented algorithm overcomes some limitations in other Young＇s modulus reconstruction methods and relaxes the displacements and force boundary condition requirements. The repetitious numerical simulation shows that errors in boundary displacement are not very sensitive to the estimation of next process; a final feasible solution is obtained by the improved PSO method which is close to the theoretical values obtained during searching in an extensive range.

Modified particle swarm optimization-based antenna tilt angle adjusting scheme for LTE coverage optimization

In order to solve the challenging coverage problem that the long term evolution（ LTE） networks are facing, a coverage optimization scheme by adjusting the antenna tilt angle（ ATA） of evolved Node B（ e NB） is proposed based on the modified particle swarm optimization（ MPSO） algorithm.The number of mobile stations（ MSs） served by e NBs, which is obtained based on the reference signal received power（RSRP） measured from the MS, is used as the metric for coverage optimization, and the coverage problem is optimized by maximizing the number of served MSs. In the MPSO algorithm, a swarm of particles known as the set of ATAs is available; the fitness function is defined as the total number of the served MSs; and the evolution velocity corresponds to the ATAs adjustment scale for each iteration cycle. Simulation results showthat compared with the fixed ATA, the number of served MSs by e NBs is significantly increased by 7. 2%, the quality of the received signal is considerably improved by 20 d Bm, and, particularly, the system throughput is also effectively increased by 55 Mbit / s.

Swarm intelligence optimization and its application in geophysical data inversion

The inversions of complex geophysical data always solve multi-parameter, nonlinear, and multimodal optimization problems. Searching for the optimal inversion solutions is similar to the social behavior observed in swarms such as birds and ants when searching for food. In this article, first the particle swarm optimization algorithm was described in detail, and ant colony algorithm improved. Then the methods were applied to three different kinds of geophysical inversion problems： （1） a linear problem which is sensitive to noise, （2） a synchronous inversion of linear and nonlinear problems, and （3） a nonlinear problem. The results validate their feasibility and efficiency. Compared with the conventional genetic algorithm and simulated annealing, they have the advantages of higher convergence speed and accuracy. Compared with the quasi-Newton method and Levenberg-Marquardt method, they work better with the ability to overcome the locally optimal solutions.

Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems

A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.

Genetic algorithm and particle swarm optimization tuned fuzzy PID controller on direct torque control of dual star induction motor

This study presents analysis, control and comparison of three hybrid approaches for the direct torque control (DTC) of the dual star induction motor (DSIM) drive. Its objective consists of combining three different heuristic optimization techniques including PID-PSO, Fuzzy-PSO and GA-PSO to improve the DSIM speed controlled loop behavior. The GA and PSO algorithms are developed and implemented into MATLAB. As a result, fuzzy-PSO is the most appropriate scheme. The main performance of fuzzy-PSO is reducing high torque ripples, improving rise time and avoiding disturbances that affect the drive performance.

Application of SVM and PCA-CS algorithms for prediction of strip crown in hot strip rolling

To make up the poor quality defects of traditional control methods and meet the growing requirements of accuracy for strip crown,an optimized model based on support vector machine(SVM)is put forward firstly to enhance the quality of product in hot strip rolling.Meanwhile,for enriching data information and ensuring data quality,experimental data were collected from a hot-rolled plant to set up prediction models,as well as the prediction performance of models was evaluated by calculating multiple indicators.Furthermore,the traditional SVM model and the combined prediction models with particle swarm optimization(PSO)algorithm and the principal component analysis combined with cuckoo search(PCA-CS)optimization strategies are presented to make a comparison.Besides,the prediction performance comparisons of the three models are discussed.Finally,the experimental results revealed that the PCA-CS-SVM model has the highest prediction accuracy and the fastest convergence speed.Furthermore,the root mean squared error(RMSE)of PCA-CS-SVM model is 2.04μm,and 98.15%of prediction data have an absolute error of less than 4.5μm.Especially,the results also proved that PCA-CS-SVM model not only satisfies precision requirement but also has certain guiding significance for the actual production of hot strip rolling.

A method combining refined composite multiscale fuzzy entropy with PSO-SVM for roller bearing fault diagnosis

Combining refined composite multiscale fuzzy entropy(RCMFE)and support vector machine(SVM)with particle swarm optimization(PSO)for diagnosing roller bearing faults is proposed in this paper.Compared with refined composite multiscale sample entropy(RCMSE)and multiscale fuzzy entropy(MFE),the smoothness of RCMFE is superior to that of those models.The corresponding comparison of smoothness and analysis of validity through decomposition accuracy are considered in the numerical experiments by considering the white and 1/f noise signals.Then RCMFE,RCMSE and MFE are developed to affect extraction by using different roller bearing vibration signals.Then the extracted RCMFE,RCMSE and MFE eigenvectors are regarded as the input of the PSO-SVM to diagnose the roller bearing fault.Finally,the results show that the smoothness of RCMFE is superior to that of RCMSE and MFE.Meanwhile,the fault classification accuracy is higher than that of RCMSE and MFE.

A composite particle swarm algorithm for global optimization of multimodal functions

During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.