基于蚁群算法的TSP问题求解策略研究.docVIP

基于蚁群算法的TSP问题求解策略研究 摘要 TSP问题是计算机网络、路由规划中的经典问题。而蚁群优化算法作为高效的计算智能的方法，在离散优化领域有着十分广泛的应用，其中最为经典的是最优回路求解问题。因此，本文在分析蚁群算法发展现状的基础上，针对TSP问题的求解策略，来深入分析蚁群基数的设置对收敛效率的影响。最后通过MATlAB编程工具运行相关代码，并得到相应的TSP问题解。实验结果表明：随着蚁群基数的增加，TSP问题求解的时间也会线性增加；当蚁群基数大于等于TSP问题的结点个数的时候，TSP问题的解才会保持稳定且趋近于蚁群基数与节点个数相等时的TSP问题的解。 关键字 蚁群算法 蚁群基数 TSP Research on the TSP Solution based on Ant Colony Optimization [Abstract] The TSP problem is a classic problem in computer network, route planning. And the ant colony optimization algorithm as an efficient method of computational intelligence, has the extremely widespread application in the field of discrete optimization, the most classic is the optimal circuit to solve the problem. Therefore, this article on the basis of analyzing the current situation of the development of ant colony algorithm, TSP problem solving strategy, to analyze ant colony base Settings affect the convergence efficiency. Finally through MATlAB programming tools run the code, and get the corresponding TSP problem solution. The experimental results show that with the increase of base of ant colony, TSP problem solving linear time will also grow; when ant colony cardinality is greater than or equal to the node number of the TSP problem, the solution of the TSP problem will keep stable and tend to base of ant colony and TSP problem solution of node number is equal. [Key Words] Ant colony optimization The base of ant colony TSP 目录 1 引言.............................................................1 1.1 TSP问题简述及其历史........................................1 1.2 TSP问题的意义及求解方法....................................1 1.3 蚁群算法的前景和意义........................................2 1.4 蚁群算法的产生与发展........................................2 1.5 蚁群算法的现状..............................................3 1.6 本文的研究内容..............................................3 1.7 本文的组织结构..............................................4 2 蚁群算法.........................................................5 2.1 蚁群算法的基本原理..............................