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.

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.

Development of hybrid optimization algorithm for structures furnished with seismic damper devices using the particle swarm optimization method and gravitational search algorithm

Previous studies about optimizing earthquake structural energy dissipation systems indicated that most existing techniques employ merely one or a few parameters as design variables in the optimization process,and thereby are only applicable only to simple,single,or multiple degree-of-freedom structures.The current approaches to optimization procedures take a specific damper with its properties and observe the effect of applying time history data to the building;however,there are many different dampers and isolators that can be used.Furthermore,there is a lack of studies regarding the optimum location for various viscous and wall dampers.The main aim of this study is hybridization of the particle swarm optimization(PSO) and gravitational search algorithm(GSA) to optimize the performance of earthquake energy dissipation systems(i.e.,damper devices) simultaneously with optimizing the characteristics of the structure.Four types of structural dampers device are considered in this study:(ⅰ) variable stiffness bracing(VSB) system,(ⅱ) rubber wall damper(RWD),(ⅲ) nonlinear conical spring bracing(NCSB) device,(iv) and multi-action stiffener(MAS) device.Since many parameters may affect the design of seismic resistant structures,this study proposes a hybrid of PSO and GSA to develop a hybrid,multi-objective optimization method to resolve the aforementioned problems.The characteristics of the above-mentioned damper devices as well as the section size for structural beams and columns are considered as variables for development of the PSO-GSA optimization algorithm to minimize structural seismic response in terms of nodal displacement(in three directions) as well as plastic hinge formation in structural members simultaneously with the weight of the structure.After that,the optimization algorithm is implemented to identify the best position of the damper device in the structural frame to have the maximum effect and minimize the seismic structure response.To examine the performance of the proposed PSO-GSA optimization method,it has been applied to a three-story reinforced structure equipped with a seismic damper device.The results revealed that the method successfully optimized the earthquake energy dissipation systems and reduced the effects of earthquakes on structures,which significantly increase the building’s stability and safety during seismic excitation.The analysis results showed a reduction in the seismic response of the structure regarding the formation of plastic hinges in structural members as well as the displacement of each story to approximately 99.63%,60.5%,79.13% and 57.42% for the VSB device,RWD,NCSB device,and MAS device,respectively.This shows that using the PSO-GSA optimization algorithm and optimized damper devices in the structure resulted in no structural damage due to earthquake vibration.

Optimization of Thermal Aware VLSI Non-Slicing Floorplanning Using Hybrid Particle Swarm Optimization Algorithm-Harmony Search Algorithm

Floorplanning is a prominent area in the Very Large-Scale Integrated (VLSI) circuit design automation, because it influences the performance, size, yield and reliability of the VLSI chips. It is the process of estimating the positions and shapes of the modules. A high packing density, small feature size and high clock frequency make the Integrated Circuit (IC) to dissipate large amount of heat. So, in this paper, a methodology is presented to distribute the temperature of the module on the layout while simultaneously optimizing the total area and wirelength by using a hybrid Particle Swarm Optimization-Harmony Search (HPSOHS) algorithm. This hybrid algorithm employs diversification technique (PSO) to obtain global optima and intensification strategy (HS) to achieve the best solution at the local level and Modified Corner List algorithm (MCL) for floorplan representation. A thermal modelling tool called hotspot tool is integrated with the proposed algorithm to obtain the temperature at the block level. The proposed algorithm is illustrated using Microelectronics Centre of North Carolina (MCNC) benchmark circuits. The results obtained are compared with the solutions derived from other stochastic algorithms and the proposed algorithm provides better solution.

Robot stereo vision calibration method with genetic algorithm and particle swarm optimization

Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm （GA） and particle swarm optimization （PSO）, a three-stage calibration method based on hybrid intelligent optimization is pro- posed for nonlinear camera models in this paper. The motivation is to improve the accuracy of the calibration process. In this approach, the stereo vision calibration is considered as an optimization problem that can be solved by the GA and PSO. The initial linear values can be obtained in the frost stage. Then in the second stage, two cameras＇ parameters are optimized separately. Finally, the in- tegrated optimized calibration of two models is obtained in the third stage. Direct linear transforma- tion （DLT）, GA and PSO are individually used in three stages. It is shown that the results of every stage can correctly find near-optimal solution and it can be used to initialize the next stage. Simula- tion analysis and actual experimental results indicate that this calibration method works more accu- rate and robust in noisy environment compared with traditional calibration methods. The proposed method can fulfill the requirements of robot sophisticated visual operation.

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.

Traveling Salesman Problem Using an Enhanced Hybrid Swarm Optimization Algorithm

The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.

Hybrid anti-prematuration optimization algorithm

Heuristic optimization methods provide a robust and efficient approach to solving complex optimization problems.This paper presents a hybrid optimization technique combining two heuristic optimization methods,artificial immune system（AIS） and particle swarm optimization（PSO）,together in searching for the global optima of nonlinear functions.The proposed algorithm,namely hybrid anti-prematuration optimization method,contains four significant operators,i.e.swarm operator,cloning operator,suppression operator,and receptor editing operator.The swarm operator is inspired by the particle swarm intelligence,and the clone operator,suppression operator,and receptor editing operator are gleaned by the artificial immune system.The simulation results of three representative nonlinear test functions demonstrate the superiority of the hybrid optimization algorithm over the conventional methods with regard to both the solution quality and convergence rate.It is also employed to cope with a real-world optimization problem.

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.

Analytical Hybrid Particle Swarm Optimization Algorithm for Optimal Siting and Sizing of Distributed Generation in Smart Grid

In this paper,the hybridization of standard particle swarm optimisation(PSO)with the analytical method(2/3 rd rule)is proposed,which is called as analytical hybrid PSO(AHPSO)algorithm used for the optimal siting and sizing of distribution generation.The proposed AHPSO algorithm is implemented to cater for uniformly distributed,increasingly distributed,centrally distributed,and randomly distributed loads in conventional power systems.To demonstrate the effectiveness of the proposed algorithm,the convergence speed and optimization performances of standard PSO and the proposed AHPSO algorithms are compared for two cases.In the first case,the performances of both the algorithms are compared for four different load distributions via an IEEE 10-bus system.In the second case,the performances of both the algorithms are compared for IEEE 10-bus,IEEE 33-bus,IEEE 69-bus systems,and a real distribution system of Korea.Simulation results show that the proposed AHPSO algorithm converges significantly faster than the standard PSO.The results of the proposed algorithm are compared with those of an analytical algorithm,and the results of them are similar.

A hybrid constriction coefficientbased particle swarm optimization and gravitational search algorithm for training multi-layer perceptron

Purpose-In this paper,a newly proposed hybridization algorithm namely constriction coefficient-based particle swarm optimization and gravitational search algorithm(CPSOGSA)has been employed for training MLP to overcome sensitivity to initialization,premature convergence,and stagnation in local optima problems of MLP.Design/methodology/approach-In this study,the exploration of the search space is carried out by gravitational search algorithm(GSA)and optimization of candidate solutions,i.e.exploitation is performed by particle swarm optimization(PSO).For training the multi-layer perceptron(MLP),CPSOGSA uses sigmoid fitness function for finding the proper combination of connection weights and neural biases to minimize the error.Secondly,a matrix encoding strategy is utilized for providing one to one correspondence between weights and biases of MLP and agents of CPSOGSA.Findings-The experimental findings convey that CPSOGSA is a better MLP trainer as compared to other stochastic algorithms because it provides superior results in terms of resolving stagnation in local optima and convergence speed problems.Besides,it gives the best results for breast cancer,heart,sine function and sigmoid function datasets as compared to other participating algorithms.Moreover,CPSOGSA also provides very competitive results for other datasets.Originality/value-The CPSOGSA performed effectively in overcoming stagnation in local optima problem and increasing the overall convergence speed of MLP.Basically,CPSOGSA is a hybrid optimization algorithm which has powerful characteristics of global exploration capability and high local exploitation power.In the research literature,a little work is available where CPSO and GSA have been utilized for training MLP.The only related research paper was given by Mirjalili et al.,in 2012.They have used standard PSO and GSA for training simple FNNs.However,the work employed only three datasets and used the MSE performance metric for evaluating the efficiency of the algorithms.In this paper,eight different standard datasets and five performance metrics have been utilized for investigating the efficiency of CPSOGSA in training MLPs.In addition,a non-parametric pair-wise statistical test namely the Wilcoxon rank-sum test has been carried out at a 5%significance level to statistically validate the simulation results.Besides,eight state-of-the-art metaheuristic algorithms were employed for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.

Crack detection of the cantilever beam using new triple hybrid algorithms based on Particle Swarm Optimization

The presence of cracks in a concrete structure reduces its performance and increases in the size of cracks result in the failure of the structure.Therefore,the accurate determination of crack characteristics,such as location and depth,is one of the key engineering issues for assessment of the reliability of structures.This paper deals with the inverse analysis of the crack detection problems using triple hybrid algorithms based on Particle Swarm Optimization(PSO);these hybrids are Particle Swarm Optimization-Genetic Algorithm-Firefly Algorithm(PSO-GA-FA),Particle Swarm Optimization-Grey Wolf Optimization-Firefly Algorithm(PSO-GWO-FA),and Particle Swarm Optimization-Genetic Algorithm-Grey Wolf Optimization(PSO-GA-GWO).A strong correlation exists between the changes in the natural frequency of a concrete beam and the crack parameters.Thus,the location and depth of a crack in a beam can be predicted by measuring its natural frequency.Hence,the measured natural frequency can be used as the input parameter of the algorithm.In this paper,this is applied to identify crack location and depth in a cantilever beam using the new hybrid algorithms.The results show that among the proposed triple hybrid algorithms,the PSO-GA-FA and PSO-GWO-FA algorithms are much more effective than PSO-GA-GWO algorithm for the crack detection.

Application of several optimization techniques for estimating TBM advance rate in granitic rocks

This study aims to develop several optimization techniques for predicting advance rate of tunnel boring machine(TBM)in different weathered zones of granite.For this purpose,extensive field and laboratory studies have been conducted along the 12,649 m of the Pahang-Selangor raw water transfer tunnel in Malaysia.Rock properties consisting of uniaxial compressive strength(UCS),Brazilian tensile strength(BTS),rock mass rating(RMR),rock quality designation(RQD),quartz content(q)and weathered zone as well as machine specifications including thrust force and revolution per minute(RPM)were measured to establish comprehensive datasets for optimization.Accordingly,to estimate the advance rate of TBM,two new hybrid optimization techniques,i.e.an artificial neural network(ANN)combined with both imperialist competitive algorithm(ICA)and particle swarm optimization(PSO),were developed for mechanical tunneling in granitic rocks.Further,the new hybrid optimization techniques were compared and the best one was chosen among them to be used for practice.To evaluate the accuracy of the proposed models for both testing and training datasets,various statistical indices including coefficient of determination(R^2),root mean square error(RMSE)and variance account for(VAF)were utilized herein.The values of R^2,RMSE,and VAF ranged in 0.939-0.961,0.022-0.036,and 93.899-96.145,respectively,with the PSO-ANN hybrid technique demonstrating the best performance.It is concluded that both the optimization techniques,i.e.PSO-ANN and ICA-ANN,could be utilized for predicting the advance rate of TBMs;however,the PSO-ANN technique is superior.

Estimation of distribution algorithm enhanced particle swarm optimization for water distribution network optimization

The optimization of a water distribution network （WDN） is a highly nonlinear, multi-modal, and constrained combinatorial problem. Particle swarm opti- mization （PSO） has been shown to be a fast converging algorithm for WDN optimization. An improved estimation of distribution algorithm （EDA） using historic best positions to construct a sample space is hybridized with PSO both in sequential and in parallel to improve population diversity control and avoid premature conver- gence. Two water distribution network benchmark exam- ples from the literature are adopted to evaluate the performance of the proposed hybrid algorithms. The experimental results indicate that the proposed algorithms achieved the literature record minimum （6.081 MS） for the small size Hanoi network. For the large size Balerma network, the parallel hybrid achieved a slightly lower minimum （1.921M） than the current literature reported best minimum （1.923MC）. The average number of evaluations needed to achieve the minimum is one order smaller than most existing algorithms. With a fixed, small number of evaluations, the sequential hybrid outperforms the parallel hybrid showing its capability for fast convergence. The fitness and diversity of the populations were tracked for the proposed algorithms. The track record suggests that constructing an EDA sample space with historic best positions can improve diversity control significantly. Parallel hybridization also helps to improve diversity control yet its effect is relatively less significant.

A Hybrid Algorithm Based on PSO and GA for Feature Selection

One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection of features has an essential importance in the classification process to be able minimize computational time,which decreases data size and increases the precision and effectiveness of specific machine learning activities.Due to its superiority to conventional optimization methods,several metaheuristics have been used to resolve FS issues.This is why hybrid metaheuristics help increase the search and convergence rate of the critical algorithms.A modern hybrid selection algorithm combining the two algorithms;the genetic algorithm(GA)and the Particle Swarm Optimization(PSO)to enhance search capabilities is developed in this paper.The efficacy of our proposed method is illustrated in a series of simulation phases,using the UCI learning array as a benchmark dataset.

Application of Metaheuristic Algorithms for Optimizing Longitudinal Square Porous Fins

The objectives of this study involve the optimization of longitudinal porous fins of square cross-section using metaheuristic algorithms.A generalized nonlinear ordinary differential equation is derived using Darcy and Fourier’s laws in the energy balance around a control volume and is solved numerically using RFK 45 method.The temperature of the base surface is higher than the fin surface,and the fin tip is kept adiabatic or cooled by convection heat transfer.The other pertinent parameters include Rayleigh number(100≤Ra≤10^(4)),Darcy number,(10^(−4)≤Da≤10^(−2)),relative thermal conductivity ratio of solid phase to fluid(1000≤kr≤8000),Nusselt number(10≤Nu≤100),porosity(0.1≤φ≤0.9).The impacts of these parameters on the entropy generation rate are investigated and optimized using metaheuristic algorithms.In computer science,metaheuristic algorithms are one of the most widely used techniques for optimization problems.In this research,three metaheuristic algorithms,including the firefly algorithm(FFA),particle swarm algorithm(PSO),and hybrid algorithm(FFAPSO)are employed to examine the performance of square fins.It is demonstrated that FFA-PSO takes fewer iterations and less computational time to converge compared to other algorithms.

改进灰狼算法优化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百分点。研究表明了预测模型优化的有效性,为未来城市改善空气质量提供了科学依据和技术支持。