改进的猫群算法求解TSP问题

针对了求解TSP问题给出一种新算法，改进的猫群算法。猫群算法，作为一种群智能优化算法，有较快的收敛速度、向“他人”学习等优点，但国内目前对它的研究还处在起步阶段，所以做这方面的尝试性研究。通过引入交换子概念和改进猫的行为模式将算法用于求解TSP问题。最后通过MATLAB仿真，并将实验结果与已知最优解相比较，验证了该算法的有效性。故不仅拓宽了猫群算法的应用范围，也给求解TSP等路径优化问题提供一种新的解决办法。

Improved cat swarm optimization for solving traveling salesman problem

The paper gave a new algorithm to solve TSP problem, namely improved cat swarm optimization .As a new swarm intelligence optimization algorithm, cat swarm optimization had many advantages such as faster convergence rate and learning from "others".But the research on it was at the beginning stage.So this paper attempted to research in this field.The algorithm was used to solve the TSP problem by introducing the concept of the exchange and improving behavior pattern of the cat.The results was compared with the known optimal solution,and the effectiveness of the algorithm is verified by MATLAB simulation. Therefore this paper not only generalizes application of the cat swarm optimization,but also provides a new solution to path optimization problems such as TSP and so on.