计算机应用研究2017，Vol.34Issue(12)：3607-3610,4.DOI:10.3969/j.issn.1001-3695.2017.12.020
改进的猫群算法求解TSP
Improved cat swarm optimization for solving traveling salesman problem
摘要
Abstract
This paper gave a new algorithm to solve TSP,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 by introducing the concept of the exchange and improving behavior pattern of the cat.The results was compared with the known optimal solution,and verified the effectiveness of the algorithm 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.关键词
旅行商问题/猫群算法/路径优化Key words
traveling salesman problem(TSP)/cat swarm optimization(CSO)/path optimization分类
信息技术与安全科学引用本文复制引用
杨进,郑允,马良..改进的猫群算法求解TSP[J].计算机应用研究,2017,34(12):3607-3610,4.基金项目
国家自然科学基金资助项目(71401106) （71401106）
国家教育部人文社科规划基金项目(16YJA630037) （16YJA630037）
上海市一流学科建设项目(51201YLXK) （51201YLXK）
沪江基金资助项目(B14006) （B14006）
