Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm

Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems.This approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization tasks.In this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)optimizer.The proposed hybrid algorithm will be referred to as BHJO.Through this fusion,the BHJO algorithm aims to leverage the strengths of each optimizer.Before this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and exploitation.This meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization performance.In addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid algorithm.Moreover,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem domains.Similarly,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation metrics.This rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedding light on its effectiveness and reliability in solving optimization problems.Finally,the obtained numerical statistics underwent rigorous analysis using the Friedman post hoc Dunn’s test.The resulting numerical values revealed the BHJO algorithm’s competitiveness in tackling intricate optimization problems,affirming its capability to deliver favorable outcomes in challenging scenarios.

Inversion of Seabed Geotechnical Properties in the Arctic Chukchi Deep Sea Basin Based on Time Domain Adaptive Search Matching Algorithm

The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.

Improving path planning efficiency for underwater gravity-aided navigation based on a new depth sorting fast search algorithm

This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.

Highly Accurate Golden Section Search Algorithms and Fictitious Time Integration Method for Solving Nonlinear Eigenvalue Problems

This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.

Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm

Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.

Winter Wheat Yield Estimation Based on Sparrow Search Algorithm Combined with Random Forest:A Case Study in Henan Province,China

Precise and timely prediction of crop yields is crucial for food security and the development of agricultural policies.However,crop yield is influenced by multiple factors within complex growth environments.Previous research has paid relatively little attention to the interference of environmental factors and drought on the growth of winter wheat.Therefore,there is an urgent need for more effective methods to explore the inherent relationship between these factors and crop yield,making precise yield prediction increasingly important.This study was based on four type of indicators including meteorological,crop growth status,environmental,and drought index,from October 2003 to June 2019 in Henan Province as the basic data for predicting winter wheat yield.Using the sparrow search al-gorithm combined with random forest(SSA-RF)under different input indicators,accuracy of winter wheat yield estimation was calcu-lated.The estimation accuracy of SSA-RF was compared with partial least squares regression(PLSR),extreme gradient boosting(XG-Boost),and random forest(RF)models.Finally,the determined optimal yield estimation method was used to predict winter wheat yield in three typical years.Following are the findings:1)the SSA-RF demonstrates superior performance in estimating winter wheat yield compared to other algorithms.The best yield estimation method is achieved by four types indicators’composition with SSA-RF)(R^(2)=0.805,RRMSE=9.9%.2)Crops growth status and environmental indicators play significant roles in wheat yield estimation,accounting for 46%and 22%of the yield importance among all indicators,respectively.3)Selecting indicators from October to April of the follow-ing year yielded the highest accuracy in winter wheat yield estimation,with an R^(2)of 0.826 and an RMSE of 9.0%.Yield estimates can be completed two months before the winter wheat harvest in June.4)The predicted performance will be slightly affected by severe drought.Compared with severe drought year(2011)(R^(2)=0.680)and normal year(2017)(R^(2)=0.790),the SSA-RF model has higher prediction accuracy for wet year(2018)(R^(2)=0.820).This study could provide an innovative approach for remote sensing estimation of winter wheat yield.yield.

Prediction Model of Wax Deposition Rate in Waxy Crude Oil Pipelines by Elman Neural Network Based on Improved Reptile Search Algorithm

A hard problem that hinders the movement of waxy crude oil is wax deposition in oil pipelines.To ensure the safe operation of crude oil pipelines,an accurate model must be developed to predict the rate of wax deposition in crude oil pipelines.Aiming at the shortcomings of the ENN prediction model,which easily falls into the local minimum value and weak generalization ability in the implementation process,an optimized ENN prediction model based on the IRSA is proposed.The validity of the new model was confirmed by the accurate prediction of two sets of experimental data on wax deposition in crude oil pipelines.The two groups of crude oil wax deposition rate case prediction results showed that the average absolute percentage errors of IRSA-ENN prediction models is 0.5476% and 0.7831%,respectively.Additionally,it shows a higher prediction accuracy compared to the ENN prediction model.In fact,the new model established by using the IRSA to optimize ENN can optimize the initial weights and thresholds in the prediction process,which can overcome the shortcomings of the ENN prediction model,such as weak generalization ability and tendency to fall into the local minimum value,so that it has the advantages of strong implementation and high prediction accuracy.

MULTI OBJECTIVE OPTIMIZATION USING GENETIC ALGORITHM WITH LOCAL SEARCH

In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non dominated solutions of a multi objective optimization problem.The choice of the final solution is left to the decision makers preference.High search ability of the proposed algorithm is demonstrated by computer simulation.

Parameter optimization of gravity density inversion based on correlation searching and the golden section algorithm

For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved.

Parameter estimation for chaotic systems using the cuckoo search algorithm with an orthogonal learning method

We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to estimate the parameters of chaotic systems.This algorithm can combine the stochastic exploration of the cuckoo search and the exploitation capability of the orthogonal learning strategy.Experiments are conducted on the Lorenz system and the Chen system.The proposed algorithm is used to estimate the parameters for these two systems.Simulation results and comparisons demonstrate that the proposed algorithm is better or at least comparable to the particle swarm optimization and the genetic algorithm when considering the quality of the solutions obtained.

Seeker optimization algorithm:a novel stochastic search algorithm for global numerical optimization

A novel heuristic search algorithm called seeker op- timization algorithm （SOA） is proposed for the real-parameter optimization. The proposed SOA is based on simulating the act of human searching. In the SOA, search direction is based on empir- ical gradients by evaluating the response to the position changes, while step length is based on uncertainty reasoning by using a simple fuzzy rule. The effectiveness of the SOA is evaluated by using a challenging set of typically complex functions in compari- son to differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms. The simulation results show that the performance of the SOA is superior or comparable to that of the other algorithms.

Search for circular and noncircular critical slip surfaces in slope stability analysis by hybrid genetic algorithm

A local improvement procedure based on tabu search(TS) was incorporated into a basic genetic algorithm(GA) and a global optimal algorithm,i.e.,hybrid genetic algorithm(HGA) approach was used to search the circular and noncircular slip surfaces associated with their minimum safety factors.The slope safety factors of circular and noncircular critical slip surfaces were calculated by the simplified Bishop method and an improved Morgenstern-Price method which can be conveniently programmed,respectively.Comparisons with other methods were made which indicate the high efficiency and accuracy of the HGA approach.The HGA approach was used to calculate one case example and the results demonstrated its applicability to practical engineering.

Structural reliability analysis using enhanced cuckoo search algorithm and artificial neural network

The present study proposed an enhanced cuckoo search(ECS) algorithm combined with artificial neural network(ANN) as the surrogate model to solve structural reliability problems. In order to enhance the accuracy and convergence rate of the original cuckoo search(CS) algorithm, the main parameters namely, abandon probability of worst nests paand search step sizeα0 are dynamically adjusted via nonlinear control equations. In addition, a global-best guided equation incorporating the information of global best nest is introduced to the ECS to enhance its exploitation. Then, the proposed ECS is linked to the well-trained ANN model for structural reliability analysis. The computational capability of the proposed algorithm is validated using five typical structural reliability problems and an engineering application. The comparison results show the efficiency and accuracy of the proposed algorithm.

A hybrid cuckoo search algorithm with feasibility-based rule for constrained structural optimization

Constrained optimization problems are very important as they are encountered in many science and engineering applications.As a novel evolutionary computation technique,cuckoo search(CS) algorithm has attracted much attention and wide applications,owing to its easy implementation and quick convergence.A hybrid cuckoo pattern search algorithm(HCPS) with feasibility-based rule is proposed for solving constrained numerical and engineering design optimization problems.This algorithm can combine the stochastic exploration of the cuckoo search algorithm and the exploitation capability of the pattern search method.Simulation and comparisons based on several well-known benchmark test functions and structural design optimization problems demonstrate the effectiveness,efficiency and robustness of the proposed HCPS algorithm.

WFRFT modulation recognition based on HOC and optimal order searching algorithm

A hybrid carrier（HC） scheme based on weighted-type fractional Fourier transform（WFRFT） has been proposed recently.While most of the works focus on HC scheme＇s inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants（HOC）. First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_（42）. Then, a combinatorial searching algorithm is designed to minimize C_（42）.Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.

A Multi-Layered Gravitational Search Algorithm for Function Optimization and Real-World Problems

A gravitational search algorithm(GSA)uses gravitational force among individuals to evolve population.Though GSA is an effective population-based algorithm,it exhibits low search performance and premature convergence.To ameliorate these issues,this work proposes a multi-layered GSA called MLGSA.Inspired by the two-layered structure of GSA,four layers consisting of population,iteration-best,personal-best and global-best layers are constructed.Hierarchical interactions among four layers are dynamically implemented in different search stages to greatly improve both exploration and exploitation abilities of population.Performance comparison between MLGSA and nine existing GSA variants on twenty-nine CEC2017 test functions with low,medium and high dimensions demonstrates that MLGSA is the most competitive one.It is also compared with four particle swarm optimization variants to verify its excellent performance.Moreover,the analysis of hierarchical interactions is discussed to illustrate the influence of a complete hierarchy on its performance.The relationship between its population diversity and fitness diversity is analyzed to clarify its search performance.Its computational complexity is given to show its efficiency.Finally,it is applied to twenty-two CEC2011 real-world optimization problems to show its practicality.

Scheduling in a Meta Search Engine by Genetic Algorithm

The meta search engines provide service to the users by dispensing the users' requests to the existing search engines. The existing search engines selected by meta search engine determine the searching quality. Because the performance of the existing search engines and the users' requests are changed dynamically, it is not favorable for the fixed search engines to optimize the holistic performance of the meta search engine. This paper applies the genetic algorithm (GA) to realize the scheduling strategy of agent manager in our meta search engine, GSE(general search engine), which can simulate the evolution process of living things more lively and more efficiently. By using GA, the combination of search engines can be optimized and hence the holistic performance of GSE can be improved dramatically.

Wind speed forecasting based on wavelet decomposition and wavelet neural networks optimized by the Cuckoo search algorithm

Wind speed forecasting is of great importance for wind farm management and plays an important role in grid integration. Wind speed is volatile in nature and therefore it is difficult to predict with a single model. In this study, three hybrid multi-step wind speed forecasting models are developed and compared — with each other and with earlier proposed wind speed forecasting models. The three models are based on wavelet decomposition(WD), the Cuckoo search(CS) optimization algorithm, and a wavelet neural network(WNN). They are referred to as CS-WD-ANN(artificial neural network), CS-WNN, and CS-WD-WNN, respectively. Wind speed data from two wind farms located in Shandong, eastern China, are used in this study. The simulation result indicates that CS-WD-WNN outperforms the other two models, with minimum statistical errors. Comparison with earlier models shows that CS-WD-WNN still performs best, with the smallest statistical errors. The employment of the CS optimization algorithm in the models shows improvement compared with the earlier models.

A Chaos Sparrow Search Algorithm with Logarithmic Spiral and Adaptive Step for Engineering Problems

The sparrow search algorithm(SSA)is a newly proposed meta-heuristic optimization algorithm based on the sparrowforaging principle.Similar to other meta-heuristic algorithms,SSA has problems such as slowconvergence speed and difficulty in jumping out of the local optimum.In order to overcome these shortcomings,a chaotic sparrow search algorithm based on logarithmic spiral strategy and adaptive step strategy(CLSSA)is proposed in this paper.Firstly,in order to balance the exploration and exploitation ability of the algorithm,chaotic mapping is introduced to adjust the main parameters of SSA.Secondly,in order to improve the diversity of the population and enhance the search of the surrounding space,the logarithmic spiral strategy is introduced to improve the sparrow search mechanism.Finally,the adaptive step strategy is introduced to better control the process of algorithm exploitation and exploration.The best chaotic map is determined by different test functions,and the CLSSA with the best chaotic map is applied to solve 23 benchmark functions and 3 classical engineering problems.The simulation results show that the iterative map is the best chaotic map,and CLSSA is efficient and useful for engineering problems,which is better than all comparison algorithms.