带变异特征的捕食搜索算法及其在TSP问题的实验研究

原捕食搜索算法在TSP问题上解的质量与精度上都不高，即其具有容易陷入局部最优的缺点，本文算法引入变异特征行为以使得捕食搜索算法能够跳出局部最优，最后对四个常用TSP问题进行了仿真，结果表明，新算法在解的质量与精度上比原捕食搜索算法有了明显提高。

The predatory search algorithm based on variability and its experimental on TSP problem

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 showed that the new algorithm had been significantly increased in the solution quality and accuracy than the original predatory search algorithm.