In view of complex optimization problems with high nonlinearity and multiple extremums,harmony search algorithm has problems of slow convergence speed,being easy to be stalled and difficult to combine global search wi...In view of complex optimization problems with high nonlinearity and multiple extremums,harmony search algorithm has problems of slow convergence speed,being easy to be stalled and difficult to combine global search with local search.Therefore,a global competitive harmonic search algorithm based on stochastic attraction is proposed.Firstly,by introducing the stochastic attraction model to adjust the harmonic vector,the harmonic search algorithm was greatly improved and prone to fall into the local optimum.Secondly,the competitive search strategy was made to generate two harmony vectors for each iteration and make competitive selection.The adaptive global adjustment and local search strategy were designed to effectively balance the global and local search capabilities of the algorithm.The typical test function was used to test the algorithm.The experimental results show that the algorithm has high precision and the ability to find the global optimum compared with the existing algorithms.The overall accuracy is increased by more than 50%.展开更多
文摘In view of complex optimization problems with high nonlinearity and multiple extremums,harmony search algorithm has problems of slow convergence speed,being easy to be stalled and difficult to combine global search with local search.Therefore,a global competitive harmonic search algorithm based on stochastic attraction is proposed.Firstly,by introducing the stochastic attraction model to adjust the harmonic vector,the harmonic search algorithm was greatly improved and prone to fall into the local optimum.Secondly,the competitive search strategy was made to generate two harmony vectors for each iteration and make competitive selection.The adaptive global adjustment and local search strategy were designed to effectively balance the global and local search capabilities of the algorithm.The typical test function was used to test the algorithm.The experimental results show that the algorithm has high precision and the ability to find the global optimum compared with the existing algorithms.The overall accuracy is increased by more than 50%.