Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm

The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.

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.

Angular insensitive nonreciprocal ultrawide band absorption in plasma-embedded photonic crystals designed with improved particle swarm optimization algorithm

Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded photonic crystals arranged in a structure composed of periodic and quasi-periodic sequences on a normalized scale.The effective dielectric function,which determines the absorption of the plasma,is subject to the basic parameters of the plasma,causing the absorption of the proposed absorber to be easily modulated by these parameters.Compared with other quasi-periodic sequences,the Octonacci sequence is superior both in relative bandwidth and absolute bandwidth.Under further optimization using IPSO with 14 parameters set to be optimized,the absorption characteristics of the proposed structure with different numbers of layers of the smallest structure unit N are shown and discussed.IPSO is also used to address angular insensitive nonreciprocal ultrawide bandwidth absorption,and the optimized result shows excellent unidirectional absorbability and angular insensitivity of the proposed structure.The impacts of the sequence number of quasi-periodic sequence M and collision frequency of plasma1ν1 to absorption in the angle domain and frequency domain are investigated.Additionally,the impedance match theory and the interference field theory are introduced to express the findings of the algorithm.

Quantum-Inspired Particle Swarm Optimization Algorithm Encoded by Probability Amplitudes of Multi-Qubits

To enhance the optimization ability of particle swarm algorithm, a novel quantum-inspired particle swarm optimization algorithm is proposed. In this method, the particles are encoded by the probability amplitudes of the basic states of the multi-qubits system. The rotation angles of multi-qubits are determined based on the local optimum particle and the global optimal particle, and the multi-qubits rotation gates are employed to update the particles. At each of iteration, updating any qubit can lead to updating all probability amplitudes of the corresponding particle. The experimental results of some benchmark functions optimization show that, although its single step iteration consumes long time, the optimization ability of the proposed method is significantly higher than other similar 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.

Short-term Load Prediction of Integrated Energy System with Wavelet Neural Network Model Based on Improved Particle Swarm Optimization and Chaos Optimization Algorithm

To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)model optimized by the improved particle swarm optimization(IPSO)and chaos optimization algorithm(COA)for short-term load prediction of IES.The proposed model overcomes the disadvantages of the slow convergence and the tendency to fall into the local optimum in traditional WNN models.First,the Pearson correlation coefficient is employed to select the key influencing factors of load prediction.Then,the traditional particle swarm optimization(PSO)is improved by the dynamic particle inertia weight.To jump out of the local optimum,the COA is employed to search for individual optimal particles in IPSO.In the iteration,the parameters of WNN are continually optimized by IPSO-COA.Meanwhile,the feedback link is added to the proposed model,where the output error is adopted to modify the prediction results.Finally,the proposed model is employed for load prediction.The experimental simulation verifies that the proposed model significantly improves the prediction accuracy and operation efficiency compared with the artificial neural network(ANN),WNN,and PSO-WNN.

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

Research on the Optimization Approach for Cargo Oil Tank Design Based on the Improved Particle Swarm Optimization Algorithm

Based on the improved particle swarm optimization(PSO) algorithm,an optimization approach for the cargo oil tank design(COTD) is presented in this paper.The purpose is to design an optimal overall dimension of the cargo oil tank(COT) under various kinds of constraints in the preliminary design stage.A non-linear programming model is built to simulate the optimization design,in which the requirements and rules for COTD are used as the constraints.Considering the distance between the inner shell and hull,a fuzzy constraint is used to express the feasibility degree of the double-hull configuration.In terms of the characteristic of COTD,the PSO algorithm is improved to solve this problem.A bivariate extremum strategy is presented to deal with the fuzzy constraint,by which the maximum and minimum cargo capacities are obtained simultaneously.Finally,the simulation demonstrates the feasibility and effectiveness of the proposed approach.

A novel mapping algorithm for three-dimensional network on chip based on quantum-behaved particle swarm optimization

Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.

基于IQPSO-EKF的多传感器融合姿态测量方法研究

为解决自动化竖井掘进设备的定位调姿精度对竖井、孔桩挖掘效率与质量的影响,提出了一种基于改进量子粒子群(IQPSO)-扩展卡尔曼滤波(EKF)的姿态测量算法,以提高微机电系统(MEMS)传感器测量精度。首先,对MEMS传感器数据进行了预处理(除噪、滤波、校准等);然后,参考现有飞行器的坐标系,建立了姿态解算模型,通过姿态角数学模型及运动学分析,构建了EFK状态方程,针对EKF方法参数估计不准确的问题,以分段混沌映射优化初始种群,引入平均位置最优值来避免陷入局部最优的IQPSO-EFK算法,优化EKF的系统、测量噪声的协方差参数;最后,对改进算法和三组姿态误差估计进行了对比实验。研究结果表明:对比三种典型目标函数,IQPSO-EFK相较于普通粒子群算法(QPSO-EFK)具有更强的寻优能力与收敛精度;对比三组旋转速度姿态测量误差,基于IQPSO-EKF算法的姿态测量方法在测量误差时比真实测量误差减少了约86.3%,比扩展卡尔曼滤波减少了约68.7%,比普通粒子群算法减少了约28.2%,证明该算法有效地提高了MEMS传感器测量精度。

An Effective Non-Commutative Encryption Approach with Optimized Genetic Algorithm for Ensuring Data Protection in Cloud Computing

Nowadays,succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers.Hence,to secure both data and keys ensuring secured data storage and access,our proposed work designs a Novel Quantum Key Distribution(QKD)relying upon a non-commutative encryption framework.It makes use of a Novel Quantum Key Distribution approach,which guarantees high level secured data transmission.Along with this,a shared secret is generated using Diffie Hellman(DH)to certify secured key generation at reduced time complexity.Moreover,a non-commutative approach is used,which effectively allows the users to store and access the encrypted data into the cloud server.Also,to prevent data loss or corruption caused by the insiders in the cloud,Optimized Genetic Algorithm(OGA)is utilized,which effectively recovers the data and retrieve it if the missed data without loss.It is then followed with the decryption process as if requested by the user.Thus our proposed framework ensures authentication and paves way for secure data access,with enhanced performance and reduced complexities experienced with the prior works.

基于IQPSO-GA优化ANFIS模型的服务器故障预警方法

针对服务器底层部分业务类硬件故障对系统稳定运行的影响,提出一种改进的量子行为粒子群优化(IQPSO)与遗传算法(GA)相结合的混合元启发式优化算法对自适应神经模糊推理系统(ANFIS)参数进行训练,以获得更准确的ANFIS规则进行硬件故障预警的方法;首先,通过分析服务器业务与硬件相关参数之间的映射关系,通过采集的数据集对ANFIS模型进行训练构造预测模型;其次,考虑ANFIS在梯度计算过程中存在容易陷入局部最优值的问题,设计了一种IQPSO算法结合GA中的交叉和变异算子操作混合元启发算法全局搜索ANFIS规则参数;最后,通过一组后处理样本数据集对所提方法有效性和稳定性进行了检验;实验结果表明,该方法可有效预警服务器硬件故障,基于所提混合元启发优化算法获得的ANFIS模型具备更快的收敛速度和更高的全局搜索精度,与传统ANFIS模型相比泛化精度提高了47%以上。

Quantum control based on three forms of Lyapunov functions

This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.Stability is analyzed by the La Salle invariance principle and the numerical simulation is carried out in a 2D test system.The calculation process for the Lyapunov function is based on a combination of the average of virtual mechanical quantities, the particle swarm algorithm and a simulated annealing algorithm.Finally, a unified form of the control laws under the three forms is given.

基于IQPSO-BP算法的煤矿瓦斯涌出量预测

针对煤矿回采工作面瓦斯涌出的非线性特征,提出一种基于改进量子粒子群优化BP神经网络(IQPSO-BP)的瓦斯涌出量预测方法。鉴于量子粒子群算法的遍历能力有限,采用混沌序列来初始化量子的初始角位置。同时,采用凸函数调整惯性权重,以平衡算法的全局勘探和局部开发能力。并依此来优化BP神经网络的权值、阈值参数,进而建立了瓦斯涌出量预测模型。试验结果表明,IQPSO-BP算法具有较强的泛化能力及较高的预测精度,可有效用于煤矿瓦斯涌出量的预测。

Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

Improvement of Stochastic Competitive Learning for Social Network

As an unsupervised learning method,stochastic competitive learning is commonly used for community detection in social network analysis.Compared with the traditional community detection algorithms,it has the advantage of realizing the time-series community detection by simulating the community formation process.In order to improve the accuracy and solve the problem that several parameters in stochastic competitive learning need to be pre-set,the author improves the algorithms and realizes improved stochastic competitive learning by particle position initialization,parameter optimization and particle domination ability self-adaptive.The experiment result shows that each improved method improves the accuracy of the algorithm,and the F1 score of the improved algorithm is 9.07%higher than that of original algorithm.

Automatic Image Inspection of Fabric Defects Based on Optimal Gabor Filter

An effective method for automatic image inspection of fabric defects is presented. The proposed method relies on a tuned 2D-Gabor filter and quantum-behaved particle swarm optimization( QPSO) algorithm. The proposed method consists of two main steps:( 1) training and( 2) image inspection. In the image training process,the parameters of the 2D-Gabor filters can be tuned by QPSO algorithm to match with the texture features of a defect-free template. In the inspection process, each sample image under inspection is convoluted with the selected optimized Gabor filter.Then a simple thresholding scheme is applied to generating a binary segmented result. The performance of the proposed scheme is evaluated by using a standard fabric defects database from Cotton Incorporated. Good experimental results demonstrate the efficiency of proposed method. To further evaluate the performance of the proposed method,a real time test is performed based on an on-line defect detection system. The real time test results further demonstrate the effectiveness, stability and robustness of the proposed method,which is suitable for industrial production.

改进灰狼算法优化GBDT在PM_(2.5)预测中的应用

针对灰狼算法易陷入局部最优解和全局搜索能力不足的问题,通过霍尔顿序列(Halton Sequence)搜索算法初始化狼群位置,避免灰狼算法陷入局部最优解和重复运算;引入莱维飞行和随机游动策略对灰狼算法的寻优过程进行优化,以增加算法的全局搜索能力;利用粒子群算法模拟灰狼种群得出的最佳适应度以用于惩罚项改进灰狼算法中的头狼更新策略。使用改进算法优化的梯度提升树(Gradient Boosting Decision Trees,GBDT)模型对北京市大气污染物监测数据中PM_(2.5)质量浓度进行预测,采用3种评估函数对各模型以及混合模型预测效果得分进行评估。结果显示,本文改进的灰狼算法对梯度提升树的优化效果优于其他算法,均方根误差E RMS为6.65μg/m^(3),平均绝对值误差E MA为3.20μg/m^(3),拟合优度(R^(2))为99%,比传统灰狼算法优化结果的均方根误差减少了19.19μg/m^(3),平均绝对值误差降低了10.03μg/m^(3),拟合优度增加了9百分点;与霍尔顿序列和莱维飞行改进的(Levy Flight-Halton Sequence,LHGWO)相比,改进的灰狼算法预测得分的均方根误差降低了10.39μg/m^(3),平均绝对值误差减小了6.71μg/m^(3),拟合优度提高了5百分点。研究表明了预测模型优化的有效性,为未来城市改善空气质量提供了科学依据和技术支持。