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.

Using particle swarm optimization algorithm in an artificial neural network to forecast the strength of paste filling material

In order to forecast the strength of filling material exactly, the main factors affecting the strength of filling material are analyzed. The model of predicting the strength of filling material was established by applying the theory of artificial neural net- works. Based on cases related to our test data of filling material, the predicted results of the model and measured values are com- pared and analyzed. The results show that the model is feasible and scientifically justified to predict the strength of filling material, which provides a new method for forecasting the strength of filling material for paste filling in coal mines.

Optimization of Laser Ablation Technology for PDPhSM Matrix Nanocomposite Thin Film by Artificial Neural Networks-particle Swarm Algorithm

A new thermal ring-opening polymerization technique for 1, 1, 3, 3-tetra-ph enyl-1, 3-disilacyclobutane （TPDC） based on the use of metal nanoparticles produced by pulsed laser ablation was investigated. This method facilitates the synthesis of polydiphenysilylenemethyle （PDPhSM） thin film, which is difficult to make by conventional methods because of its insolubility and high melting point. TPDC was first evaporated on silicon substrates and then exposed to metal nanoparticles deposition by pulsed laser ablation prior to heat treatment.The TPDC films with metal nanoparticles were heated in an electric furnace in air atmosphere to induce ring-opening polymerization of TPDC. The film thicknesses before and after polymerization were measured by a stylus profilometer. Since the polymerization process competes with re-evaporation of TPDC during the heating, the thickness ratio of the polymer to the monomer was defined as the polymerization efficiency, which depends greatly on the technology conditions. Therefore, a well trained radial base function neural network model was constructed to approach the complex nonlinear relationship. Moreover, a particle swarm algorithm was firstly introduced to search for an optimum technology directly from RBF neural network model. This ensures that the fabrication of thin film with appropriate properties using pulsed laser ablation requires no in-depth understanding of the entire behavior of the technology conditions.

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.

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.

Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known 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.

Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.

Application of Adaptive Whale Optimization Algorithm Based BP Neural Network in RSSI Positioning

The paper proposes a wireless sensor network(WSN)localization algorithm based on adaptive whale neural network and extended Kalman filtering to address the problem of excessive reliance on environmental parameters A and signal constant n in traditional signal propagation path loss models.This algorithm utilizes the adaptive whale optimization algorithm to iteratively optimize the parameters of the backpropagation(BP)neural network,thereby enhancing its prediction performance.To address the issue of low accuracy and large errors in traditional received signal strength indication(RSSI),the algorithm first uses the extended Kalman filtering model to smooth the RSSI signal values to suppress the influence of noise and outliers on the estimation results.The processed RSSI values are used as inputs to the neural network,with distance values as outputs,resulting in more accurate ranging results.Finally,the position of the node to be measured is determined by combining the weighted centroid algorithm.Experimental simulation results show that compared to the standard centroid algorithm,weighted centroid algorithm,BP weighted centroid algorithm,and whale optimization algorithm(WOA)-BP weighted centroid algorithm,the proposed algorithm reduces the average localization error by 58.23%,42.71%,31.89%,and 17.57%,respectively,validating the effectiveness and superiority of the algorithm.

Efficiency-optimized 6G:A virtual network resource orchestration strategy by enhanced particle swarm optimization

The future Sixth-Generation (6G) wireless systems are expected to encounter emerging services with diverserequirements. In this paper, 6G network resource orchestration is optimized to support customized networkslicing of services, and place network functions generated by heterogeneous devices into available resources.This is a combinatorial optimization problem that is solved by developing a Particle Swarm Optimization (PSO)based scheduling strategy with enhanced inertia weight, particle variation, and nonlinear learning factor, therebybalancing the local and global solutions and improving the convergence speed to globally near-optimal solutions.Simulations show that the method improves the convergence speed and the utilization of network resourcescompared with other variants of PSO.

Forecasting of Software Reliability Using Neighborhood Fuzzy Particle Swarm Optimization Based Novel Neural Network

This paper proposes an artificial neural network(ANN) based software reliability model trained by novel particle swarm optimization(PSO) algorithm for enhanced forecasting of the reliability of software. The proposed ANN is developed considering the fault generation phenomenon during software testing with the fault complexity of different levels. We demonstrate the proposed model considering three types of faults residing in the software. We propose a neighborhood based fuzzy PSO algorithm for competent learning of the proposed ANN using software failure data. Fitting and prediction performances of the neighborhood fuzzy PSO based proposed neural network model are compared with the standard PSO based proposed neural network model and existing ANN based software reliability models in the literature through three real software failure data sets. We also compare the performance of the proposed PSO algorithm with the standard PSO algorithm through learning of the proposed ANN. Statistical analysis shows that the neighborhood fuzzy PSO based proposed neural network model has comparatively better fitting and predictive ability than the standard PSO based proposed neural network model and other ANN based software reliability models. Faster release of software is achievable by applying the proposed PSO based neural network model during the testing period.

Prediction of Flash Point Temperature of Organic Compounds Using a Hybrid Method of Group Contribution ＋ Neural Network ＋ Particle Swarm Optimization

The flash points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) with particle swarm optimization (PSO). Different topologies of a multilayer neural network were studied and the optimum architecture was determined. Property data of 350 compounds were used for training the network. To discriminate different substances the molecular structures defined by the concept of the classical group contribution method were given as input variables. The capabilities of the network were tested with 155 substances not considered in the training step. The study shows that the proposed GCM+ANN+PSO method represent an excellent alternative for the estimation of flash points of organic compounds with acceptable accuracy (AARD = 1.8%; AAE = 6.2 K).

Remanufacturing closed-loop supply chain network design based on genetic particle swarm optimization algorithm

As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.

A hybrid particle swarm optimization approach with neural network and set pair analysis for transmission network planning

Transmission network planning (TNP) is a large-scale, complex, with more non-linear discrete variables and the multi-objective constrained optimization problem. In the optimization process, the line investment, network reliability and the network loss are the main objective of transmission network planning. Combined with set pair analysis (SPA), particle swarm optimization (PSO), neural network (NN), a hybrid particle swarm optimization model was established with neural network and set pair analysis for transmission network planning (HPNS). Firstly, the contact degree of set pair analysis was introduced, the traditional goal set was converted into the collection of the three indicators including the identity degree, difference agree and contrary degree. On this bases, using shi(H), the three objective optimization problem was converted into single objective optimization problem. Secondly, using the fast and efficient search capabilities of PSO, the transmission network planning model based on set pair analysis was optimized. In the process of optimization, by improving the BP neural network constantly training so that the value of the fitness function of PSO becomes smaller in order to obtain the optimization program fitting the three objectives better. Finally, compared HPNS with PSO algorithm and the classic genetic algorithm, HPNS increased about 23% efficiency than THA, raised about 3.7% than PSO and improved about 2.96% than GA.

Quantum Particle Swarm Optimization Based Convolutional Neural Network for Handwritten Script Recognition

Even though several advances have been made in recent years,handwritten script recognition is still a challenging task in the pattern recognition domain.This field has gained much interest lately due to its diverse application potentials.Nowadays,different methods are available for automatic script recognition.Among most of the reported script recognition techniques,deep neural networks have achieved impressive results and outperformed the classical machine learning algorithms.However,the process of designing such networks right from scratch intuitively appears to incur a significant amount of trial and error,which renders them unfeasible.This approach often requires manual intervention with domain expertise which consumes substantial time and computational resources.To alleviate this shortcoming,this paper proposes a new neural architecture search approach based on meta-heuristic quantum particle swarm optimization(QPSO),which is capable of automatically evolving the meaningful convolutional neural network(CNN)topologies.The computational experiments have been conducted on eight different datasets belonging to three popular Indic scripts,namely Bangla,Devanagari,and Dogri,consisting of handwritten characters and digits.Empirically,the results imply that the proposed QPSO-CNN algorithm outperforms the classical and state-of-the-art methods with faster prediction and higher accuracy.

Surface Quality Evaluation of Fluff Fabric Based on Particle Swarm Optimization Back Propagation Neural Network

Aiming at the problem that back propagation(BP)neural network predicts the low accuracy rate of fluff fabric after fluffing process,a BP neural network model optimized by particle swarm optimization(PSO)algorithm is proposed.The sliced image is obtained by the principle of light-cutting imaging.The fluffy region of the adaptive image segmentation is extracted by the Freeman chain code principle.The upper edge coordinate information of the fabric is subjected to one-dimensional discrete wavelet decomposition to obtain high frequency information and low frequency information.After comparison and analysis,the BP neural network was trained by high frequency information,and the PSO algorithm was used to optimize the BP neural network.The optimized BP neural network has better weights and thresholds.The experimental results show that the accuracy of the optimized BP neural network after applying high-frequency information training is 97.96%,which is 3.79%higher than that of the unoptimized BP neural network,and has higher detection accuracy.

Temperature prediction model for a high-speed motorized spindle based on back-propagation neural network optimized by adaptive particle swarm optimization

To predict the temperature of a motorized spindle more accurately,a novel temperature prediction model based on the back-propagation neural network optimized by adaptive particle swarm optimization(APSO-BPNN)is proposed.First,on the basis of the PSO-BPNN algorithm,the adaptive inertia weight is introduced to make the weight change with the fitness of the particle,the adaptive learning factor is used to obtain different search abilities in the early and later stages of the algorithm,the mutation operator is incorporated to increase the diversity of the population and avoid premature convergence,and the APSO-BPNN model is constructed.Then,the temperature of different measurement points of the motorized spindle is forecasted by the BPNN,PSO-BPNN,and APSO-BPNN models.The experimental results demonstrate that the APSO-BPNN model has a significant advantage over the other two methods regarding prediction precision and robustness.The presented algorithm can provide a theoretical basis for intelligently controlling temperature and developing an early warning system for high-speed motorized spindles and machine tools.

A fuzzy neural network evolved by particle swarm optimization

A cooperative system of a fuzzy logic model and a fuzzy neural network(CSFLMFNN)is proposed,in which a fuzzy logic model is acquired from domain experts and a fuzzy neural network is generated and prewired according to the model.Then PSO-CSFLMFNN is constructed by introducing particle swarm optimization(PSO)into the cooperative system instead of the commonly used evolutionary algorithms to evolve the prewired fuzzy neural network.The evolutionary fuzzy neural network implements accuracy fuzzy inference without rule matching.PSO-CSFLMFNN is applied to the intelligent fault diagnosis for a petrochemical engineering equipment,in which the cooperative system is proved to be effective.It is shown by the applied results that the performance of the evolutionary fuzzy neural network outperforms remarkably that of the one evolved by genetic algorithm in the convergence rate and the generalization precision.

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.

Control of Neural Network Feedback Linearization Based on Chaotic Particle Swarm Optimization

A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.