The Predatory Search Algorithm Based on Variability and its Experimental on Traveling Salesman Problem
Shen Hai-hong · Science Technology and Engineering · 2011
The quality and accuracy of solution of original predatory search algorithm is not high on the TSP problem and it is easy to fall into local optimum.So this algorithm is introduced variations to make original predatory search algorithm can jump out of local optimum,By the simulation of four commonly used TSP problem,the results show that the new algorithm are significantly increased in the solution quality and accuracy than the original predatory search algorithm.