搜索资源列表
Hopfield网络解TSP的改进算法
- 这是一个旅行商问题的神经网络算法,神经网络算法有很多种,但神经网络算法还比较少见,这是本人从中国期刊网下载到的,很有用-This is a traveling salesman problem of neural network algorithms and neural network algorithm can take many forms, but the neural network algorithm is still re
演化法
- 首先介绍了当前求解TSP问题最好的演化算法之一：GT算法。文中重点设计了在NOW上求解旅行商问题GT算法的并行算法，详细描述了设计思路，设计策略。还给出了相当详细的并行算法描述。文中设计的并行算法已经在NOW上的PVM平台上实现。关键词NOW，演化计算，旅行商问题,并行计算-first briefed on the current TSP evolutionary algorithm best one : GT algorithm. T
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
GA_TSP-wrong
- 用遗传算法编写的一个程序,其目的是求解旅行商问题.-genetic algorithm a procedure for the preparation, with the aim of solving the traveling salesman problem.
MnthTsp
- 用模拟退火技术解决旅行商问题.算法中采用了人工智能中比较新的模拟退火算法.-simulated annealing technology to solve the traveling salesman problem. Algorithms used in the artificial intelligence relatively new simulated annealing algorithm.
visit
- 用贪心算法做的全国31个城市之间的旅行商问题源代码，可执行程序都在附件压缩包内。里面的data.txt city.txt分别为数据表和城市名，要和可执行程序放在同一个目录内才可执行-greedy algorithm to do with the country's 31 cities between the TSP source code, the executable in Annex compressed packet. I
ACO
- 利用C++编写蚁群优化算法解决51城市旅行商问题-prepared Ant Colony Optimization Algorithm for 51 city Traveling Salesman Problem
maxas
- 采用C++语言编写蚁群优化算法程序，解决旅行商问题-using C language ant colony optimization algorithm to solve the traveling salesman problem
TSPforMATLAB
- 这是一个c++与matlab进行混合编程利用遗传算法实现tsp的源程序，较好的解决了旅行商的问题-c Matlab mixed with the use of genetic programming algorithm tsp of the source, the better to solve the traveling salesman problem
ant1
- 利用蚂蚁算法解决TSP旅行商问题，用他能直接输出路由接点-use TSP ant algorithm to solve the traveling salesman problem, in his direct contact output routing
luxingshang
- 用C编的遗传算法求解旅行商问题的源码-C series of the Genetic Algorithm for the Traveling Salesman Problem source 000000000000000000
amerdow
- 哈密尔顿近似算法的语言实现及旅行商问题的实现-Hamilton approximation algorithm language and the achievement of Traveling Salesman Problem
travelling_saleman
- 经典算法：旅行商算法，采用爬上法和分支界限搜索-classical algorithm : traveling salesman algorithm, used to climb up and branch Boundary Search
TRA3
- 旅行商算法算出全国31外城市的最短单源路径。-traveling salesman algorithm calculates the country's 31 cities outside the single source shortest paths.
BAntTsp
- 求解旅行商问题的蚂蚁基本算法源程序 求解Oliver30问题的-solving the traveling salesman problem Ant basic algorithm source code for the Oliver30
tourzxh
- 旅行商问题,动态规划,附加说明文档,是程序竞赛的经典题-traveling salesman problem, dynamic programming, additional documentation, and procedures of the classic title race
TSP_PROBLEM
- 这是算法中有关旅行商的解决方法,希望对你有帮助,-This the algorithm of the TSP solution, and I hope to help you, thank you
iACSkroc100bingxingxiaochuangkoubianyi
- 这是在最初的蚁群算法的变异算子的基础上改进的变异算子，旅行商问题中含100个城市的程序-This is the first ant colony algorithm mutation operator on the basis of improving the mutation operator, Traveling Salesman Problem with 100 cities in the process
gatsp1
- matlab程序，遗传算法解决经典的TSP(旅行商)问题-Matlab procedures, genetic algorithm to solve the classic TSP salesman problem (TSP)