Search

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at the problems that the sparrow search algorithm (SSA) is prone to fall into local optimum and the optimization accuracy is low in the optimization process, this paper proposed a hybrid strategy improved sparrow search algorithm (MSSA). Firstly, in order to enable individual sparrows to fully search in the search space and increase the accuracy of algorithm optimization, it introduced an archiving stage in the algorithm optimization process to receive the residual position information that might be captured by sparrow producers when they moved to the safe area. Secondly, in the iterative process of the algorithm, it performed an adaptive neighborhood search operation on the current optimal individual, and fully explored the location information around the high-quality individual to enhance the algorithm's ability to jump out of the local optimum. This paper used 9 benchmark functions to evaluate the MSSA with SSA, and other four improved SSA, which were chaotic sparrow search optimization algorithm (CSSOA), mixed strategy improved sparrow search algorithm (MSSSA), improved sparrow search algorithm(ISSA), and enhanced sparrow search algorithm (ESSA). Experiment result illustrates that MSSA can achieve better convergence accuracy and stability on nearly 80% of the benchmark functions, and MSSA is also ranked first in the Friedman test. This paper also applied MSSA to optimize wireless sensor network( WSN) coverage in an obstacle environment. Compared with other five compared algorithms, MSSA can increase the coverage rates of WSN up 9. 77%, 4. 25%, 6. 62%, 3. 02%, and 7. 38%, respectively. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of the basic Gravity search algorithm（GSA）, such as prone to premature maturity, easy to fall into local optimum, and lack an effective acceleration mechanism, this paper proposed a GSA（IABHGSA） based on the improved adaptive black hole mechanism. The algorithm used the improved Tent mapping to initialize the population, which makes the distribution of the initial population more random, uniform and traversal, and it enhanced the global exploration capability of the algorithm; The algorithm introduced an improved adaptive black hole mechanism and selected the position update strategy, according to the evolution of the particles, which makes the position update more reasonable, Effectively reduce the possibility of particles falling into local optima; Through the optimal and worst particle update strategy based on learning ideas, enhanced the algorithm’s ability to escape from local optima and improved the algorithm’s optimization speed; The algorithm introduced group migration to provide effective accelerated convergence mechanism for the algorithm. Finally, this paper selected 8 benchmark functions to test IABHGSA and compared with the experimental results of related algorithms, the results show that IABHGSA has better optimization performance. [ABSTRACT FROM AUTHOR]

Copyright of Journal of East China University of Science & Technology is the property of Journal of East China University of Science & Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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]

This paper proposed curve adaptive and simulation annealing grasshopper optimization algorithm to avoid the disadvantages that the grasshopper optimization algorithm was easy to fall into local optimum, slow convergence speed and poor search accuracy. First of all, this paper introduced the adaptive curve to replace the linear adaptation of the grasshopper optimization algorithm key parameter, which improved the global search ability of the algorithm. Then, on this basis, this paper introduced the simulated annealing algorithm, which had a certain probability of receiving the inferior solution of the grasshopper algorithm to jump out of local optimization and achieve global optimization. Adaptive reduction the range of random solutions of grasshopper position in simulated annealing was beneficial to further improve the ability of grasshopper algorithm's exploitation. Through test function, the experimental results show that the improved new algorithm has higher quality and better convergence speed. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of aquila optimization algorithm（AO）, this paper proposed an aquila optimization algorithm using hybrid search strategy. Firstly, the algorithm introduced dynamic adjustment function to balance global exploration and local exploitation; Secondly, it introduced chaotic adaptive weights to enhance the global search capability of the algorithm and accelerate the convergence speed of the algorithm; Thirdly, it introduced a new individual mutation probability coefficient and an improved differential mutation strategy, and used individuals with better fitness values to lead other individuals in the population to carry out search activities, which maintained the diversity of the population and enhanced the ability of the algorithm to jump out of the local optimum. Through the numerical experiment simulation of 8 benchmark test functions, 10 CEC2019 test functions and 1 engineering application problem, The experimental results show that the algorithm has a significant improvement in global convergence speed and optimization accuracy, and has a better ability to jump out of the local optimum. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at the characteristics of the traditional cuckoo search algorithm with low convergence accuracy and large limitation of iterative step for complex problems, this paper proposed a dynamic cuckoo search strategy based on rider optimization. The algorithm combined with the idea of rider optimization algorithm, using multiple groups and optimal strategies in a single cycle . The optimal strategy could dynamically enhance the searching and improve the convergence efficiency of the algorithm for complex problems. At the same time, this algorithm adjusted the dynamic parameters of Levy flight motion to improve the early and late performance of the algorithm search. The simulation test results show that the optimization performance of the imp roved algorithm ROCS is better than the comparison algorithms for complex problems, and the optimization efficiency of the algorithm has been significantly improved. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of COA, such as slow convergence speed, low solution accuracy and being easy to fall into local optimum, this paper proposed an improved coyote optimization algorithm based on dual strategy learning mechanism and adaptive chaotic mutation strategy ( DCSCOA ). Firstly, it adopted an oscillatory decline factor to generate diverse individuals for enhancing the global search ability. Secondly, it proposed a dual strategy learning mechanism to appropriately increase the influence of the group head wolf, so as to balance the local search ability and global search ability of the algorithm, and to improve the solution accuracy and convergence speed of the algorithm. Finally,it used an adaptive chaotic mutation mechanism to generate new individuals when the algorithm stagnates, so as to make the algorithm jump out of the local optimum. Through simulation experiments on 20 basic test functions and 11 CEC2017 test functions, the results show that the improved algorithm has higher solution accuracy,faster convergence speed and stronger stability. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of normal SPBO, this paper analyzed the psychological characteristics of students ' learning, and put forward an improved student psychology based optimization algorithm ( HSSPBO) using hybrid strategy . Firstly, it took the inverse value of student ' s test scores as the fitness value of the student, and took the fitness value of the best students in the class as the benchmark, and then divided the students in the class into four categories : the best students, the good students, the ordinary students and the students who tried random improvement. Secondly, it used the dynamic switching probability of sine square and cosine square to balance global exploration and local development, so that the global exploration ability and local exploitation ability of the algorithm were improved effectively. Thirdly, by introducing Cauchy mutation strategy to change the local search step size, it improved effectively the local search ability of the algorithm and enhanced the ability of the algorithm to jump out of the local optimization. Finally, the HSSPBO algorithm used Levy flight strategy to make the individual search step length more random and flexible, which effectively enhanced the individual ' s searching ability, and further improved the optimization speed of the algorithm. Through simulation experiments of 12 benchmark functions and comparison with six optimization algorithms, the results show that HSSPBO ' s global search ability has been significantly improved, and it has faster global convergence speed, better optimization accuracy and stability in function optimization. [ABSTRACT FROM AUTHOR]

The simulated annealing algorithm with adaptive temperature rising strategy or Monte Carlo strategy has the problems of slow convergence and limited global optimal approximation ability in solving complex 'ISP respectively. On the other hand, the existing chaotic optimization algorithm has the defect of logistic mapping, which weakens its ability to jump out of local optima. Therefore, this paper designed a fusion algorithm framework, in which embedded the divided Lorenz chaotic mapping system to enhance the search efficiency of the chaotic algorithm for the neighborhood solution. It introduced the greedy strategy to construct the initial solution approaching the global optimal solution, which made the algorithm had the ability of transition to the neighborhood of the global optimal solution. In addition, it designed the complementary mechanism of oscillatory annealing to improve the sub iterative solution screening process, and enhanced the global search performance of the algorithm. After the implementation of the algorithm, using the international public 1SPLIB point set, through multiple rounds of comparative testing, it verifies that the performance of the new algorithm is better than the comparison group simulated annealing algorithm and logistic chaos optimization algorithm,and has shorter convergence time and stronger global optimal approximation ability. [ABSTRACT FROM AUTHOR]

For the capacitated vehicle routing problem(CVRP),this paper proposed an imperialist competitive algorithm which integrated a split mechanism to solve the problem.Firstly,combined with the characteristics of CVRP,this algorithm used the encoding and decoding strategies based on greedy criteria to switch from the algorithm space to the solution space.Secondly,this algorithm presented an imperialist splitting mechanism to improve the global search ability of the algorithm,and simultaneously combined with the 2-Opt algorithm to enhance the local search ability.Finally,the results of simulation experiments with 25 benchmark examples indicate that:the proposed algorithm can effectively solve CVRP,and the optimization errors of all examples are less than 1.0%.Furthermore,the proposed algorithm is more efficiently than the existing imperialist competitive algorithms,particle swarm optimization algorithm,genetic algorithm and cuckoo search algorithm. [ABSTRACT FROM AUTHOR]

In order to solve the problems of slow search speed, premature convergence and low search accuracy of standard whale optimization algorithm, this paper proposed a hybrid strategy to improve whale optimization algorithm. Firstly, it increased the population diversity by generating the initial population with chaotic map, which laid a foundation for the algorithm global search. Then, by the non-linear strategy, it improved the convergence factor and inertia weight to balance the global exploration, local development ability of the algorithm and accelerated the convergence speed. Finally, according to the variance of the group fitness, it set the threshold performing the mutation operation to avoid the premature convergence of the algorithm. By testing 12 typical benchmark functions in three aspects, the experimental results show that the improved algorithm has a remarkable enhancement in search speed and convergence accuracy. Besides, it has a strong ability to get rid of falling into local optimum. [ABSTRACT FROM AUTHOR]

Butterfly optimization algorithm is a newly natural heuristic algorithm, which simulates the butterfly's behavior of using smell to determine the location of nectar or mating object. To solve the problem that the butterfly optimization algorithm was prone to low accuracy and slow convergence, this paper proposed the crazy butterfly optimization algorithm integrating with adaptive perturbation (CIBOA). Firstly, it introduced the adaptive inertial weights to the self-cognitive flight part to balance the local and global search capabilities of the algorithm. Secondly, it introduced the perturbation strategy to the global optimal position to avoid the algorithm falling into the local optimal. Finally, it introduced the crazy operator to the nectar location to increase the population diversity and obtain better optimal solution. To compare the search performance of five algorithms in 10, 30 and 50 dimensions used eight benchmark functions. The experimental simulation results show that the comprehensive performance of the improved algorithm is better than other algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the shortages of the basic whale optimization algorithm with low optimization precision, slow convergence speed and easy to fall into local optimum, this paper proposed a new algorithm based on dynamic search and cooperative learning. Firstly, it used equivalent replacement and Faure sequences to enhance the quality of initial solution. Secondly, it improved the population diversity and enhanced the ability to jump out of local optimal solutions through the division of population. Finally, in order to improve the convergence rate and precision, it dynamically adjusted the search strategy of the algorithms according to the population evolutionary information. The experimental results show that the proposed algorithm is much better than basic whale optimization algorithm and its several improved algorithms in optimization performance. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve the disadvantage of the traditional whale optimization algorithm, which is slow convergence and easy to fall into local optimum, this paper proposed a mixed strategy based whale optimization algorithm. Firstly, it introduced the nonlinear adjustment strategy to modify the convergence factor, balanced the exploration and exploitation capability and accelerated the convergence speed. Then, it introduced an adaptive weighted coefficient into the position update formula of whales to improve the search precision of the algorithm. Finally, it combined the limit threshold idea of artificial bee colony algorithm to effectively jump out of the local optimum and prevent premature convergence. The results show that the proposed algorithm has better search precision and convergence speed through experiments on different dimensions of 14 benchmark functions. [ABSTRACT FROM AUTHOR]