搜索资源列表
TSP
- Solving Traveling Salesman Problem (TSP) With Ant Colony Optimization (ACO)
TSP-GA.zip
- 旅行商问题(TSP)是一个经典的优化组合问题,本个案列采用遗传算法来求解TSP问题,进行了选择、交叉、变异算子的设计,并通过MATLAB对算法进行了实现,附有详细的说明和代码。,The traveling salesman problem (TSP) is a classic combination optimization problem, in this case the column using a genetic algorithm to solve TSP problem select
Simulated-Annealing-for-TSP
- 模拟退火算法解决TSP问题,方法比较好,效果不错-Simulated Annealing
Hopfield-TSP
- Hopfield神经网络解TSP问题的算法源程序以及实例-Source code as well as examples of the Hopfield neural network algorithm for TSP
TSP
- TSP问题是经典的寻优问题 也是人工智能里一个重要的问题 我编写的程序主要是用蚁群算法来解决这个问题。蚁群算法是人工智能里用来寻优的重要算法 由于蚁群算法的优点使得TSP问题能够实现。 -The TSP problem is a classical optimization problem is also an important problem in artificial intelligence programs written in my main is to use ant colo
TSP
- 人工智能中的经典算法,TSP模拟退火算法。本程序简单实现了的用模拟退火算法实现了旅行商问题。只需在文本cities中输入各个城市之间的距离,运行程序后就可以求出旅行各个城市的最短距离。适合学习人工智能和对该算法有兴趣的同学使用。-Classic artificial intelligence algorithm, TSP simulated annealing algorithm. The program is simple to achieve with simulated annealing
GN-for-TSP
- 基于遗传算法的tsp问题的实现,可以绘制迭代过程图,供初学遗传算法者学习。-Based on the realization of the genetic algorithm tsp problem, you can draw a diagram of the iterative process, learning for beginners genetic algorithm.
tsp
- 用蚁群算法解决TSP问题,快速便捷而且很全面,比较谨慎-Ant colony algorithm to solve TSP, quick and easy and very comprehensive, more cautious
tsp
- 蚁群算法解决tsp问题 使用c++语言编写 适合初学者学习-Ant colony algorithm to solve tsp problem c++ language suitable for beginners to learn
TSP
- 基于神经网络的TSP问题,需要自建文档输入0.1 0.1 0.9 0.5 0.9 0.1 0.45 0.9 0.9 0.8 0.7 0.9 0.1 0.45 0.45 0.1-TSP problem based on neural network
TSP
- TSP实现源代码,旅行商问题的解决,希望对大家有用!-TSP source code, the solution of the traveling salesman problem, hope to be useful!
TSP
- 1 以10/30个结点的TSP问题为例,用遗传算法加以求解; 2 掌握遗传算法的基本原理、各个遗传操作和算法步骤; 3 能求出问题最优解,若得不出最优解,请分析原因; 4 要求界面显示每次迭代求出的局部最优解和最终求出的全局最优解。-For example, 1 to 10/30 junction TSP problem with a genetic algorithm to solve 2 mastered the basic principles of the gene
TSP-PSO
- TSP-PSO算法的matlab程序文件,有助于了解该算法-The produce of matlab about TSP-POS
TSP
- TSP问题是一个典型的、容易描述但是难以处理的NP完全问题,同时TSP问题也是诸多领域内出现的多种复杂问题的集中概括和简化形式。目前求解TSP问题的主要方法有启发式搜索法、模拟退火算法、遗传算法、Hopfield神经网络算法、二叉树描述算法。所以,有效解决TSP问题在计算理论上和实际应用上都有很高的价值,而且TSP问题由于其典型性已经成为各种启发式的搜索、优化算法的间接比较标准(如遗传算法、神经网络优化、列表寻优(TABU)法、模拟退火法等)。遗传算法就其本质来说,主要是解决复杂问题的一种鲁棒性
TSP(-GeneticAlgorithm)
- Graphical TSP genetic algorithm implementation with C# by mehdi akbari PhD student in QIAU Iran-Graphical TSP genetic algorithm implementation with C# by mehdi akbari PhD student in QIAU Iran
TSP
- 求解TSP问题很好的一个程序源码,原理是遗传算法来求解-The good solving TSP program source code, the principle of genetic algorithm to solve
TSP
- 遗传算法解决TSP问题 所谓TSP问题(旅行商问题)即最短路径问题就是在给定的起始点S到终止点T的通路集合中,寻求距离最小的通路,这样的通路成为S点到T点的最短路径。-Genetic algorithm to solve TSP problem called TSP problem (TSP) that the shortest path problem in a given starting point S to the end point T path collection, seeki
TSP
- MFC文件,用一种追溯法解决旅行商(TSP)问题。可以显示出行走的城市和行走的过程。-MFC file, a retrospective method to solve the traveling salesman problem (TSP). Can show the process of city walking and walking.
TSP代码
- 里面有几种算法求解TSP的源码,运行过了,对于学习相关算法的人都很有帮助
TSP-source-code
- C++环境下,用蚁群算法解决TSP旅行商问题-The TSP problem ant colony algorithm to solve the C++ environment