搜索资源列表
Branch_and_bound_for_TSP_tutorial
- 该程序是用分支定界算法解决旅行商问题，所用语言为Matlab-The program is branch and bound algorithm for TSP problem
tsp
- 著名的旅行商问题解法，非常精简，带有注释！！提供给大家学习，-The famous traveling salesman problem solution, very streamlined, with a comment! ! Available to everyone to learn! ! !
ant-algorithms-of-vrp
- 采用蚁群算法能够解决31个城市的旅行商问题，相对于遗传算法，模拟退火算法和其他的算法，蚁群算法有其自身的优势-Ant colony algorithm to solve the traveling salesman problem 31 cities, with respect to genetic algorithms, simulated annealing algorithm and other algorithms, ant c
Genetic-algorithm-c-source-code-
- 基于遗传算法写的关于旅行商问题的代码，功能可以解决基本的问题，希望能帮助大家！下载吧-Genetic Algorithms write code based on the traveling salesman problem, the function can solve fundamental problems, hoping to help you! Download it
genetic-code
- 基于遗传算法写的关于旅行商问题的代码，功能可以解决基本的问题，希望能帮助大家！下载吧-Genetic Algorithms write code based on the traveling salesman problem, the function can solve fundamental problems, hoping to help you! Download it
ant-vrp
- 基于蚁群算法写的关于旅行商问题的代码，功能可以解决基本的问题，希望能帮助大家！下载吧-Ant colony algorithm based on code written by the traveling salesman problem, the function can solve the basic problem, hoping to help you! Download it
tsp
- 基于遗传算法写的关于旅行商问题的代码，功能可以解决基本的问题，希望能帮助大家！下载吧-Genetic Algorithms write code based on the traveling salesman problem, the function can solve fundamental problems, hoping to help you! Download it
TSP
- 遗传算法求解TSP（旅行商问题）。算法设计作业自己做的答案-Genetic Algorithm for TSP
tsp_g
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-Using the principle of the convex hull of the traveling salesman problem 70 cities. Implemented in Matlab
cSharp
- 蚁群算法解决TSP旅行商问题 C#( 蚁群算法解决TSP旅行商问题 C#( 蚁群算法解决TSP旅行商问题 C#( 蚁群算法解决TSP旅行商问题 C#(-ant colony algorithm C#ant colony algorithm C#ant colony algorithm C#ant colony algorithm C#ant colony algorithm C#ant colony algorithm C#ant co
qw
- 利用动态规划算法求解旅行商问题的代码，VC开发-Dynamic Traveling Salesman Problem Solver
lvxingshangwenti
- 计算旅行商问题，已经调试过可以使用。根据自己的实际情况赋初值-i think this program is very useful.
lvxingshangwenti
- 人工智能技术试验-旅行商问题的实现，该程序利用A*算法实现了旅行商问题-Traveling Salesman Problem
SA_Tsp
- 模拟退火旅行商问题用C#语言编写的，有界面计算城市之间旅行最短行程问题-Simulated annealing traveling salesman problem written in C# language, the interface to calculate the shortest path problem traveling between cities
yiqun
- 关于蚁群算法的TSP旅行商问题，有最优路线的图-About TSP TSP ant colony algorithm, the optimal route diagram there
tsp
- 关于旅行商问题求解最短路径的程序设计，本程序很好解决TSP问题的算法-About Traveling Salesman Problem solving the shortest path programming, this program is a good algorithm to solve TSP problem
sa
- 本程序是运用模拟退火算法解决旅行商问题，求解最短路径，C语言程序-This procedure is to use simulated annealing algorithm to solve the traveling salesman problem, solving the shortest path, C language program
ACATSP
- 蚁群优化算法解决旅行商问题仿真程序源代码，可以进行仿真-Ant colony optimization algorithm to solve the traveling salesman problem simulation program source code, can be simulated
PSOLSp
- 10个粒子群算法的旅行商问题，内容详尽 ，可以此类推n个城市的算法-greedy algorithm to do with the country s 31 cities between the TSP source code, the executable in Annex compressed packet. Inside data.txt city.txt of data tables and urban name, and th
tsp_ga2
- 中国34个省会城市的旅行商问题最优求解方案，数据都已给出--traveling salesman algorithm calculates the country s 34 cities outside the single source shortest paths.