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.

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.

Vehicle recognition and tracking based on simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm

Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.

A Proposed Feature Selection Particle Swarm Optimization Adaptation for Intelligent Logistics--A Supply Chain Backlog Elimination Framework

The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,and stability of computing.One of the most successful optimization algorithms is Particle Swarm Optimization(PSO)which has proved its effectiveness in exploring the highest influencing features in the search space based on its fast convergence and the ability to utilize a small set of parameters in the search task.This research proposes an effective enhancement of PSO that tackles the challenge of randomness search which directly enhances PSO performance.On the other hand,this research proposes a generic intelligent framework for early prediction of orders delay and eliminate orders backlogs which could be considered as an efficient potential solution for raising the supply chain performance.The proposed adapted algorithm has been applied to a supply chain dataset which minimized the features set from twenty-one features to ten significant features.To confirm the proposed algorithm results,the updated data has been examined by eight of the well-known classification algorithms which reached a minimum accuracy percentage equal to 94.3%for random forest and a maximum of 99.0 for Naïve Bayes.Moreover,the proposed algorithm adaptation has been compared with other proposed adaptations of PSO from the literature over different datasets.The proposed PSO adaptation reached a higher accuracy compared with the literature ranging from 97.8 to 99.36 which also proved the advancement of the current research.

Fitness Sharing Chaotic Particle Swarm Optimization (FSCPSO): A Metaheuristic Approach for Allocating Dynamic Virtual Machine (VM) in Fog Computing Architecture

In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow tasks.In cloud data centers,fog computing takes more time to run workflow applications.Therefore,it is essential to develop effective models for Virtual Machine(VM)allocation and task scheduling in fog computing environments.Effective task scheduling,VM migration,and allocation,altogether optimize the use of computational resources across different fog nodes.This process ensures that the tasks are executed with minimal energy consumption,which reduces the chances of resource bottlenecks.In this manuscript,the proposed framework comprises two phases:(i)effective task scheduling using a fractional selectivity approach and(ii)VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization(FSCPSO).The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local exploitation.This balance enables the use of a wide range of solutions that leads to minimal total cost and makespan,in comparison to other traditional optimization algorithms.The FSCPSO algorithm’s performance is analyzed using six evaluation measures namely,Load Balancing Level(LBL),Average Resource Utilization(ARU),total cost,makespan,energy consumption,and response time.In relation to the conventional optimization algorithms,the FSCPSO algorithm achieves a higher LBL of 39.12%,ARU of 58.15%,a minimal total cost of 1175,and a makespan of 85.87 ms,particularly when evaluated for 50 tasks.

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.

Application of DSAPSO Algorithm in Distribution Network Reconfiguration with Distributed Generation

With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.

Expressway traffic flow prediction using chaos cloud particle swarm algorithm and PPPR model

Aiming at the real-time fluctuation and nonlinear characteristics of the expressway short-term traffic flow forecasting the parameter projection pursuit regression PPPR model is applied to forecast the expressway traffic flow where the orthogonal Hermite polynomial is used to fit the ridge functions and the least square method is employed to determine the polynomial weight coefficient c.In order to efficiently optimize the projection direction a and the number M of ridge functions of the PPPR model the chaos cloud particle swarm optimization CCPSO algorithm is applied to optimize the parameters. The CCPSO-PPPR hybrid optimization model for expressway short-term traffic flow forecasting is established in which the CCPSO algorithm is used to optimize the optimal projection direction a in the inner layer while the number M of ridge functions is optimized in the outer layer.Traffic volume weather factors and travel date of the previous several time intervals of the road section are taken as the input influencing factors. Example forecasting and model comparison results indicate that the proposed model can obtain a better forecasting effect and its absolute error is controlled within [-6,6] which can meet the application requirements of expressway traffic flow forecasting.

Comprehensive Rainstorm Intensity Formula Based on Particle Swarm Algorithm

[Objective] The research aimed to simplify the traditional method and gain the method which could directly construct the comprehensive rainstorm intensity formula.[Method] The particle swarm optimization was used to optimize the parameters of uniform comprehensive rainstorm intensity formula in every return period and directly construct the comprehensive rainstorm intensity formula.Moreover,took the comprehensive rainstorm intensity formula which was established by the hourly precipitation data in wuhu City as an example,the calculation result compared with the computed result of traditional method.[Result] The calculation result precision of particle swarm algorithm was higher than the traditional method,and the calculation process was simpler.[Conclusion] The particle swarm algorithm could directly construct the comprehensive rainstorm intensity formula.

Blending Scheduling under Uncertainty Based on Particle Swarm Optimization Algorithm

Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimiza- tion problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization (PSO) algorithm is developed for nonlinear optimization problems with both contin- uous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem.

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.

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.

Seepage safety monitoring model for an earth rock dam under influence of high-impact typhoons based on particle swarm optimization algorithm

Extreme hydrological events induced by typhoons in reservoir areas have presented severe challenges to the safe operation of hydraulic structures. Based on analysis of the seepage characteristics of an earth rock dam, a novel seepage safety monitoring model was constructed in this study. The nonlinear influence processes of the antecedent reservoir water level and rainfall were assumed to follow normal distributions. The particle swarm optimization （PSO） algorithm was used to optimize the model parameters so as to raise the fitting accuracy. In addition, a mutation factor was introduced to simulate the sudden increase in the piezometric level induced by short-duration heavy rainfall and the possible historical extreme reservoir water level during a typhoon. In order to verify the efficacy of this model, the earth rock dam of the Siminghu Reservoir was used as an example. The piezometric level at the SW1-2 measuring point during Typhoon Fitow in 2013 was fitted with the present model, and a corresponding theoretical expression was established. Comparison of fitting results of the piezometric level obtained from the present statistical model and traditional statistical model with monitored values during the typhoon shows that the present model has a higher fitting accuracy and can simulate the uprush feature of the seepage pressure during the typhoon perfectly.

Dynamic Optimization Method on Electromechanical Coupling System by Exponential Inertia Weight Particle Swarm Algorithm

Dynamic optimization of electromechanical coupling system is a significant engineering problem in the field of mechatronics. The performance improvement of electromechanical equipment depends on the system design parameters. Aiming at the spindle unit of refitted machine tool for solid rocket, the vibration acceleration of tool is taken as objective function, and the electromechanical system design parameters are appointed as design variables. Dynamic optimization model is set up by adopting Lagrange-Maxwell equations, Park transform and electromechanical system energy equations. In the procedure of seeking high efficient optimization method, exponential function is adopted to be the weight function of particle swarm optimization algorithm. Exponential inertia weight particle swarm algorithm（EPSA）, is formed and applied to solve the dynamic optimization problem of electromechanical system. The probability density function of EPSA is presented and used to perform convergence analysis. After calculation, the optimized design parameters of the spindle unit are obtained in limited time period. The vibration acceleration of the tool has been decreased greatly by the optimized design parameters. The research job in the paper reveals that the problem of dynamic optimization of electromechanical system can be solved by the method of combining system dynamic analysis with reformed swarm particle optimizati on. Such kind of method can be applied in the design of robots, NC machine, and other electromechanical equipments.

A hybrid discrete particle swarm optimization-genetic algorithm for multi-task scheduling problem in service oriented manufacturing systems

To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.

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.

Tidal Turbine Array Optimization Based on the Discrete Particle Swarm Algorithm

In consideration of the resource wasted by unreasonable layout scheme of tidal current turbines, which would influence the ratio of cost and power output, particle swarm optimization algorithm is introduced and improved in the paper. In order to solve the problem of optimal array of tidal turbines, the discrete particle swarm optimization(DPSO) algorithm has been performed by re-defining the updating strategies of particles’ velocity and position. This paper analyzes the optimization problem of micrositing of tidal current turbines by adjusting each turbine’s position,where the maximum value of total electric power is obtained at the maximum speed in the flood tide and ebb tide.Firstly, the best installed turbine number is generated by maximizing the output energy in the given tidal farm by the Farm/Flux and empirical method. Secondly, considering the wake effect, the reasonable distance between turbines,and the tidal velocities influencing factors in the tidal farm, Jensen wake model and elliptic distribution model are selected for the turbines’ total generating capacity calculation at the maximum speed in the flood tide and ebb tide.Finally, the total generating capacity, regarded as objective function, is calculated in the final simulation, thus the DPSO could guide the individuals to the feasible area and optimal position. The results have been concluded that the optimization algorithm, which increased 6.19% more recourse output than experience method, can be thought as a good tool for engineering design of tidal energy demonstration.

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.

Shaping the Wavefront of Incident Light with a Strong Robustness Particle Swarm Optimization Algorithm

We demonstrate a modified particle swarm optimization(PSO) algorithm to effectively shape the incident light with strong robustness and short optimization time. The performance of the modified PSO algorithm and genetic algorithm(GA) is numerically simulated. Then, using a high speed digital micromirror device, we carry out light focusing experiments with the modified PSO algorithm and GA. The experimental results show that the modified PSO algorithm has greater robustness and faster convergence speed than GA. This modified PSO algorithm has great application prospects in optical focusing and imaging inside in vivo biological tissue, which possesses a complicated background.

An extended particle swarm optimization algorithm based on coarse-grained and fine-grained criteria and its application

In order to study the problem that particle swarm optimization (PSO) algorithm can easily trap into local mechanism when analyzing the high dimensional complex optimization problems, the optimization calculation using the information in the iterative process of more particles was analyzed and the optimal system of particle swarm algorithm was improved. The extended particle swarm optimization algorithm (EPSO) was proposed. The coarse-grained and fine-grained criteria that can control the selection were given to ensure the convergence of the algorithm. The two criteria considered the parameter selection mechanism under the situation of random probability. By adopting MATLAB7.1, the extended particle swarm optimization algorithm was demonstrated in the resource leveling of power project scheduling. EPSO was compared with genetic algorithm (GA) and common PSO, the result indicates that the variance of the objective function of resource leveling is decreased by 7.9%, 18.2%, respectively, certifying the effectiveness and stronger global convergence ability of the EPSO.