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.

An Improved Unsupervised Image Segmentation Method Based on Multi-Objective Particle Swarm Optimization Clustering Algorithm

Most image segmentation methods based on clustering algorithms use singleobjective function to implement image segmentation.To avoid the defect,this paper proposes a new image segmentation method based on a multi-objective particle swarm optimization(PSO)clustering algorithm.This unsupervised algorithm not only offers a new similarity computing approach based on electromagnetic forces,but also obtains the proper number of clusters which is determined by scale-space theory.It is experimentally demonstrated that the applicability and effectiveness of the proposed multi-objective PSO clustering algorithm.

Improved Particle Swarm Optimization for Parameter Identification of Permanent Magnet Synchronous Motor

In the process of identifying parameters for a permanent magnet synchronous motor,the particle swarm optimization method is prone to being stuck in local optima in the later stages of iteration,resulting in low parameter accuracy.This work proposes a fuzzy particle swarm optimization approach based on the transformation function and the filled function.This approach addresses the topic of particle swarmoptimization in parameter identification from two perspectives.Firstly,the algorithm uses a transformation function to change the form of the fitness function without changing the position of the extreme point of the fitness function,making the extreme point of the fitness function more prominent and improving the algorithm’s search ability while reducing the algorithm’s computational burden.Secondly,on the basis of themulti-loop fuzzy control systembased onmultiplemembership functions,it is merged with the filled function to improve the algorithm’s capacity to skip out of the local optimal solution.This approach can be used to identify the parameters of permanent magnet synchronous motors by sampling only the stator current,voltage,and speed data.The simulation results show that the method can effectively identify the electrical parameters of a permanent magnet synchronous motor,and it has superior global convergence performance and robustness.

A Double-Interactively Recurrent Fuzzy Cerebellar Model Articulation Controller Model Combined with an Improved Particle Swarm Optimization Method for Fall Detection

In many Eastern and Western countries,falling birth rates have led to the gradual aging of society.Older adults are often left alone at home or live in a long-term care center,which results in them being susceptible to unsafe events(such as falls)that can have disastrous consequences.However,automatically detecting falls fromvideo data is challenging,and automatic fall detection methods usually require large volumes of training data,which can be difficult to acquire.To address this problem,video kinematic data can be used as training data,thereby avoiding the requirement of creating a large fall data set.This study integrated an improved particle swarm optimization method into a double interactively recurrent fuzzy cerebellar model articulation controller model to develop a costeffective and accurate fall detection system.First,it obtained an optical flow(OF)trajectory diagram from image sequences by using the OF method,and it solved problems related to focal length and object offset by employing the discrete Fourier transform(DFT)algorithm.Second,this study developed the D-IRFCMAC model,which combines spatial and temporal(recurrent)information.Third,it designed an IPSO(Improved Particle Swarm Optimization)algorithm that effectively strengthens the exploratory capabilities of the proposed D-IRFCMAC(Double-Interactively Recurrent Fuzzy Cerebellar Model Articulation Controller)model in the global search space.The proposed approach outperforms existing state-of-the-art methods in terms of action recognition accuracy on the UR-Fall,UP-Fall,and PRECIS HAR data sets.The UCF11 dataset had an average accuracy of 93.13%,whereas the UCF101 dataset had an average accuracy of 92.19%.The UR-Fall dataset had an accuracy of 100%,the UP-Fall dataset had an accuracy of 99.25%,and the PRECIS HAR dataset had an accuracy of 99.07%.

Optimal Location and Sizing of Distributed Generator via Improved Multi-Objective Particle Swarm Optimization in Active Distribution Network Considering Multi-Resource

In the framework of vigorous promotion of low-carbon power system growth as well as economic globalization,multi-resource penetration in active distribution networks has been advancing fiercely.In particular,distributed generation(DG)based on renewable energy is critical for active distribution network operation enhancement.To comprehensively analyze the accessing impact of DG in distribution networks from various parts,this paper establishes an optimal DG location and sizing planning model based on active power losses,voltage profile,pollution emissions,and the economics of DG costs as well as meteorological conditions.Subsequently,multiobjective particle swarm optimization(MOPSO)is applied to obtain the optimal Pareto front.Besides,for the sake of avoiding the influence of the subjective setting of the weight coefficient,the decisionmethod based on amodified ideal point is applied to execute a Pareto front decision.Finally,simulation tests based on IEEE33 and IEEE69 nodes are designed.The experimental results show thatMOPSO can achieve wider and more uniformPareto front distribution.In the IEEE33 node test system,power loss,and voltage deviation decreased by 52.23%,and 38.89%,respectively,while taking the economy into account.In the IEEE69 test system,the three indexes decreased by 19.67%,and 58.96%,respectively.

An Improved Multi-Objective Particle Swarm Optimization Routing on MANET

A Mobile Ad hoc Network(MANET)is a group of low-power con-sumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization.The primary aim of MANETs is to extendflexibility into the self-directed,mobile,and wireless domain,in which a cluster of autonomous nodes forms a MANET routing system.An Intrusion Detection System(IDS)is a tool that examines a network for mal-icious behavior/policy violations.A network monitoring system is often used to report/gather any suspicious attacks/violations.An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks,sending out alerts whenever it detects malicious nodes.The impact of Dynamic Source Routing(DSR)in MANETs challenging blackhole attack is investigated in this research article.The Cluster Trust Adaptive Acknowledgement(CTAA)method is used to identify unauthorised and malfunctioning nodes in a MANET environment.MANET system is active and provides successful delivery of a data packet,which implements Kalman Filters(KF)to anticipate node trustworthiness.Furthermore,KF is used to eliminate synchronisation errors that arise during the sending and receiving data.In order to provide an energy-efficient solution and to minimize network traffic,route optimization in MANET by using Multi-Objective Particle Swarm Optimization(MOPSO)technique to determine the optimal num-ber of clustered MANET along with energy dissipation in nodes.According to the researchfindings,the proposed CTAA-MPSO achieves a Packet Delivery Ratio(PDR)of 3.3%.In MANET,the PDR of CTAA-MPSO improves CTAA-PSO by 3.5%at 30%malware.

An Improved Particle Swarm Optimization Algorithm with Harmony Strategy for the Location of Critical Slip Surface of Slopes

The determination of optimal values for three parameters required in the original particle swarm optimization algorithm is very difficult. It is proposed that two new parameters simulating the harmony search strategy can be adopted instead of the three parameters which are required in the original particle swarm optimization algorithm to update the positions of all the particles. The improved particle swarm optimization is used in the location of the critical slip surface of soil slope, and it is found that the improved particle swarm optimization algorithm is insensitive to the two parameters while the original particle swarm optimization algorithm can be sensitive to its three parameters.

Power optimization of gas pipelines via an improved particle swarm optimization algorithm

In past decades dynamic programming, genetic algorithms, ant colony optimization algorithms and some gradient algorithms have been applied to power optimization of gas pipelines. In this paper a power optimization model for gas pipelines is developed and an improved particle swarm optimization algorithm is applied. Based on the testing of the parameters involved in the algorithm which need to be defined artificially, the values of these parameters have been recommended which can make the algorithm reach efficiently the approximate optimum solution with required accuracy. Some examples have shown that the relative error of the particle swarm optimization over ant colony optimization and dynamic programming is less than 1% and the computation time is much less than that of ant colony optimization and dynamic programming.

Path Planning of Continuum Robot Based on a New Improved Particle Swarm Optimization Algorithm

Continuum robot is a new type of biomimetic robot,which realizes the motion by bending some parts of its body.So its path planning becomes more difficult even compared with hyper-redundant robots.In this paper a circular arc spline interpolating method is proposed for the robot shape description,and a new two-stage position-selectable-updating particle swarm optimization(TPPSO)algorithm is put forward to solve this path planning problem.The algorithm decomposes the standard PSO velocity’s single-step updating formula into twostage multi-point updating,specifically adopting three points as candidates and selecting the best one as the updated position in the first half stage,and similarly taking seven points as candidates and selecting the best one as the final position in the last half stage.This scheme refines and widens each particle’s searching trajectory,increases the updating speed of the individual best,and improves the converging speed and precision.Aiming at the optimization objective to minimize the sum of all the motion displacements of every segmental points and all the axial stretching or contracting displacements of every segment,the TPPSO algorithm is used to solve the path planning problem.The detailed solution procedure is presented.Numerical examples of five path planning cases show that the proposed algorithm is simple,robust,and efficient.

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.

Hybrid Hierarchical Particle Swarm Optimization with Evolutionary Artificial Bee Colony Algorithm for Task Scheduling in Cloud Computing

Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.

Codebook design using improved particle swarm optimization based on selection probability of artificial bee colony algorithm

In the paper, a new selection probability inspired by artificial bee colony algorithm is introduced into standard particle swarm optimization by improving the global extremum updating condition to enhance the capability of its overall situation search. The experiment result shows that the new scheme is more valuable and effective than other schemes in the convergence of codebook design and the performance of codebook, and it can avoid the premature phenomenon of the particles.

Multi-path routing algorithm in WSN using an improvedparticle swarm optimization

To slove the problems of constrained energy and unbalanced load of wireless sensor network(WSN)nodes,a multipath load balancing routing algorithm based on neighborhood subspace cooperation is proposed.The algorithm adopts the improved particle swarm optimization(PSO)algorithm,takes the shortest distance and minimum energy consumption as optimization target and divides the nodes in one-hop neighborhood near the base station area into different regions.Furthermore,the algorithm designs a fitness function to find the best node in each region as a relay node and forward the data in parallel through the different paths of the relay nodes.The simulation results show that the proposed algorithm can reduce energy consumption and average end-to-end delay,balance network load and prolong network lifetime effectively.

Optimization of the Hydrological Model Using Multi-objective Particle Swarm Optimization Algorithm

An application of multi-objective particle swarm optimization （MOPSO） algorithm for optimization of the hydrological model （HYMOD） is presented in this paper. MOPSO algorithm is used to find non-dominated solutions with two objectives： high flow Nash-Sutcliffe efficiency and low flow Nash- Sutcliffe efficiency. The two sets＇ coverage rate and Pareto front spacing metric are two criterions to analyze the performance of the algorithms. MOPSO algorithm surpasses multi-objective shuffled complex evolution metcopolis （MOSCEM_UA） algorithr~, in terms of the two sets＇ coverage rate. But when we come to Pareto front spacing rate, the non-dominated solutions of MOSCEM_ UA algorithm are better-distributed than that of MOPSO algorithm when the iteration is set to 40 000. In addition, there are obvious conflicts between the two objectives. But a compromise solution can be acquired by adopting the MOPSO algorithm.

Multi-Objective Weather Routing Algorithm for Ships Based on Hybrid Particle Swarm Optimization

Maritime transportation has become an important part of the international trade system.To promote its sustainable de-velopment,it is necessary to reduce the fuel consumption of ships,decrease navigation risks,and shorten the navigation time.Ac-cordingly,planning a multi-objective route for ships is an effective way to achieve these goals.In this paper,we propose a multi-ob-jective optimal ship weather routing system framework.Based on this framework,a ship route model,ship fuel consumption model,and navigation risk model are established,and a non-dominated sorting and multi-objective ship weather routing algorithm based on particle swarm optimization is proposed.To fasten the convergence of the algorithm and improve the diversity of route solutions,a mutation operation and an elite selection operation are introduced in the algorithm.Based on the Pareto optimal front and Pareto optimal solution set obtained by the algorithm,a recommended route selection criterion is designed.Finally,two sets of simulated navigation simulation experiments on a container ship are conducted.The experimental results show that the proposed multi-objective optimal weather routing system can be used to plan a ship route with low navigation risk,short navigation time,and low fuel consumption,fulfilling the safety,efficiency,and economic goals.

Improved wavelet neural network combined with particle swarm optimization algorithm and its application

An improved wavelet neural network algorithm which combines with particle swarm optimization was proposed to avoid encountering the curse of dimensionality and overcome the shortage in the responding speed and learning ability brought about by the traditional models. Based on the operational data provided by a regional power grid in the south of China, the method was used in the actual short term load forecasting. The results show that the average time cost of the proposed method in the experiment process is reduced by 12.2 s, and the precision of the proposed method is increased by 3.43% compared to the traditional wavelet network. Consequently, the improved wavelet neural network forecasting model is better than the traditional wavelet neural network forecasting model in both forecasting effect and network function.

Quantitative algorithm for airborne gamma spectrum of large sample based on improved shuffled frog leaping-particle swarm optimization convolutional neural network

In airborne gamma ray spectrum processing,different analysis methods,technical requirements,analysis models,and calculation methods need to be established.To meet the engineering practice requirements of airborne gamma-ray measurements and improve computational efficiency,an improved shuffled frog leaping algorithm-particle swarm optimization convolutional neural network(SFLA-PSO CNN)for large-sample quantitative analysis of airborne gamma-ray spectra is proposed herein.This method was used to train the weight of the neural network,optimize the structure of the network,delete redundant connections,and enable the neural network to acquire the capability of quantitative spectrum processing.In full-spectrum data processing,this method can perform the functions of energy spectrum peak searching and peak area calculations.After network training,the mean SNR and RMSE of the spectral lines were 31.27 and 2.75,respectively,satisfying the demand for noise reduction.To test the processing ability of the algorithm in large samples of airborne gamma spectra,this study considered the measured data from the Saihangaobi survey area as an example to conduct data spectral analysis.The results show that calculation of the single-peak area takes only 0.13~0.15 ms,and the average relative errors of the peak area in the U,Th,and K spectra are 3.11,9.50,and 6.18%,indicating the high processing efficiency and accuracy of this algorithm.The performance of the model can be further improved by optimizing related parameters,but it can already meet the requirements of practical engineering measurement.This study provides a new idea for the full-spectrum processing of airborne gamma rays.

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.

Research on the Novel Computer Network Intrusion Detection Model based on Improved Particle Swarm Optimization Algorithm

In this paper, we conduct research on the novel computer network intrusion detection model based on improved particle swarmoptimization algorithm. TCP fl ood attack, UDP fl ood attack, ICMP fl ood attack, deformity of message attack, the application layer attack is themost typical DDOS attacks, DDOS attacks are also changing to upgrade at the same time, scholars research on DDOS attack defense measuresbecome more and more has the application value and basic practical signifi cance. Network security protection is a comprehensive project, nomatter what measures to take that safety is always relative, so as the network security administrator, should change with the network securitysituation and the security requirements, moderate to adjust security policies, so as to achieve the target. Under this basis, we propose the newperspective on the IDS system that will then enhance the robustness and safetiness of the overall network system.

Optimizing the Multi-Objective Discrete Particle Swarm Optimization Algorithm by Deep Deterministic Policy Gradient Algorithm

Deep deterministic policy gradient(DDPG)has been proved to be effective in optimizing particle swarm optimization(PSO),but whether DDPG can optimize multi-objective discrete particle swarm optimization(MODPSO)remains to be determined.The present work aims to probe into this topic.Experiments showed that the DDPG can not only quickly improve the convergence speed of MODPSO,but also overcome the problem of local optimal solution that MODPSO may suffer.The research findings are of great significance for the theoretical research and application of MODPSO.