Search

Targeting to the deficiency of sparrow search algorithm solved the multi-objective problems, and the problems can easily enter the partial optimization and inferior convergence in the counting process, this paper came up with a kind of improved multi-objective sparrow search algorithm. First of all, this paper used a new-type non-dominated sorting to find the Pareto front. Next, it integrated the polynomial mutation and cosine algorithm into species evolution strategy to strengthen its searching ability. It used the species selection method of competition mechanism to decrease the differentiation caused by partial optimized particle and overall optimized particle in the searching process. Finally, this paper compared the improved algorithm and various kinds of multi-objective algorithm in standard test function. The simulation results show that, the convergence and searching ability of the improved algorithm are all superior than other algorithm. Therefore, this algorithm can effectively address the multiple target optimization problem. [ABSTRACT FROM AUTHOR]

In order to improve the safety and smoothness of flight, and solve the problems of excessive turning angle and too many search path nodes in the traditional A• algorithm, this paper proposed a synchronous bi-directional A• search algorithm based on sector field expansion. Firstly, this paper extended the hazardous area boundaries based on the raster map method. Secondly, it designed the A• algorithm based on synchronous bi-directional search, which dynamically defined the target nodes for forward and reverse search. Aiming at the problem of limiting search angles, this paper proposed a sector expansion strategy in 5 x 5 domain, and designed an evaluation function with double weight parameters to reduce the generation of redundant points. Finally, in order to verify the effectiveness of the improved algorithm, this paper selected square and irregular shape hazard areas for simulation. The results show that the improved algorithm searches for a smoother path. Compared with the results of the traditional bi-directional A• algorithm, the length of its search path reduce by 1. 65% and 13. 16%, and the number of its search path nodes reduce by 42. 6% and 46. 81 %, respectively, under different shapes of hazard areas, which has a strong search efficiency. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the original sparrow search algorithm (Sparrow Search Algorithm, SSA) has reduced population diversity and the weak local development ability makes it difficult to jump out of the local optimum under the condition of approaching the global optimum. This paper proposes a sparrow search algorithm based on tangential flight (tangent flight Sparrow Search Algorithm, tanSSA). First of all, using adaptive t-distribution strategy to improve the finder location update formula can improve the individual sparrow’s optimization ability and prevent the algorithm from maturing. Then, the tangent flight strategy in the tangent search algorithm can enhance the search space ability of the algorithm, and can make the algorithm jump out of the advantage of the local optimal solution. In original sparrow search algorithm, using the tangent flight disturbance strategy to disturb the optimal solution. The combination of these two strategies can effectively improve the exploration and development performance of tanSSA algorithm. Finally, using 12 standard benchmark functions to test and verify the optimization performance of tanSSA algorithm combined with Wilcoxon rank sum test, and compared with the original SSA algorithm, whale optimization algorithm, particle swarm optimization algorithm and adaptive t-distribution SSA algorithm. The experimental results show that the optimization ability and convergence speed of the sparrow search algorithm based on tangent flight have a significant improvement. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of Harris eagle algorithm (HHO) in solving Job-Shop scheduling problem (JSP), such as poor optimization ability and easy to fall into local optimization, this paper proposed a hybrid Harris eagle algorithm (HHHO). Firstly, the algorithm used chaos theory to increase population diversity in the population initialization stage. Secondly, in the early stage of HHO search, the algorithm used nonlinear energy decline and quantum computing to enhance the global exploration ability of the algorithm. In the later stage of search, the algorithm adopted neighborhood search algorithm to enhance the local development ability of the algorithm. Finally, the algorithm selected FT and LA basic examples to test the performance of the algorithm, and compared with other advanced meta heuristic algorithms to verify the effectiveness and superiority of HHHO in solving JSP. [ABSTRACT FROM AUTHOR]

The traditional immune network optimization algorithm had the shortcomings of weak local searching ability, low precision and premature convergence. Inorder to improve the algorithm performance, this paper proposed an artificial-immune-network-based memetic algorithm for dynamic optimization problems. Based on the framework of memetic algorithm, an artificial immune network algorithm served as the global search algorithm, and a tabu search algorithm served as the local search operator. At the same time, the algorithm introduced the Cauchy variation to improve global searching ability and prevent premature convergence . The experimental results show that the improved algorithm has better search precision and convergence speed compared with other algorithms. [ABSTRACT FROM AUTHOR]