搜索资源列表
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
MnthTsp
- 用模拟退火技术解决旅行商问题.算法中采用了人工智能中比较新的模拟退火算法.-simulated annealing technology to solve the traveling salesman problem. Algorithms used in the artificial intelligence relatively new simulated annealing algorithm.
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
amerdow
- 哈密尔顿近似算法的语言实现及旅行商问题的实现-Hamilton approximation algorithm language and the achievement of Traveling Salesman Problem
BAntTsp
- 求解旅行商问题的蚂蚁基本算法源程序 求解Oliver30问题的-solving the traveling salesman problem Ant basic algorithm source code for the Oliver30
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
HopfieldExperiment
- 采用Hopfield网络解决旅行商问题，收敛速度快。-using Hopfield network to solve the traveling salesman problem, and fast convergence.
TSP(travel)
- 该程序是模拟退火算法应用中旅行商问题得MATLAB实现-that the procedure was simulated annealing applications traveling salesman problem in MATLAB
hopfieldTSP
- 利用hopfield神经网络解决TSP(旅行商)问题-use hopfield neural network to solve TSP salesman problem (TSP)
expr2
- 旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commo
TSP_PSO
- 用粒子群方法解决TSP（旅行商）问题，按照TSP1.m中的格式输入程序参数即可-Using Particle Swarm solution to TSP (traveling salesman) problems, in accordance with the format in TSP1.m parameter input program
tspsa
- 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem)
TspSA
- 模拟退火优化旅行商问题,付城市坐标!vC++代码!-Simulated annealing optimization of traveling salesman problem, to pay the city coordinates! VC++ Code!
tsp
- 用C语言实现旅行商问题。该算法简单精悍，效率也不低，是实现TSP问题的很好的算法。-Using C language realize traveling salesman problem. The algorithm is simple and lean, efficiency is not low, the problem is to achieve a good TSP algorithms.
tspGA
- 采用遗传算法解决ＴＳＰ旅行商问题 对初学遗传算法者很不错-The use of genetic algorithm to solve traveling salesman problem TSP to the beginner who is pretty good genetic algorithm
AntTsp
- 解决旅行商问题的C++代码，可以欣赏以下-Solve the Traveling Salesman Problem C++ Code, you can enjoy the following
SATSP
- 用模拟退火算法求解旅行商问题 T(t+1)＝k×T(t) 式中k为正的略小于1.00的常数，t为降温的次数 -Using Simulated Annealing Algorithm for Solving Traveling Salesman Problem T (t+ 1) = k × T (t) where k is slightly less than 1.00 are constants, t is the numbe
FISHTSP
- 人工鱼群算法解决旅行商问题,这是在当前互联网上唯一的一个,这个是我自己编的,保证通过-Artificial fish-swarm algorithm to solve traveling salesman problem, which is in the current Internet, the only one, this is my own, and to ensure through
1
- 蚂蚁TSP算法--用蚁群算法解决旅行商问题-TSP algorithm ant ant colony algorithm to solve traveling salesman problem