搜索资源列表
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
trp
- SA-TSP 模拟退火算法求解旅行商问题-SA - TSP simulated annealing algorithm for the traveling salesman problem
quanguowei
- 这是自己编写的matlab程序设计。 用来解决旅行商问题优化 。-This is, the preparation of the Matlab programming. To solve the traveling salesman problem optimization.
anneal_travel
- 用模拟退火算法求解旅行商问题，其中用STL中的Vector来实现路径的存放 -simulated annealing algorithm for the traveling salesman problem, which use the STL Vector to achieve the storage path
hopfield_for_tsp
- Hopfield网络解决旅行商问题（TSP），迭代过程中采用保优方法，并计算最优解和次优解的个数。-Hopfield network Traveling Salesman Problem (TSP), iterative process used method for ensuring quality, and calculating the optimal solution and sub-optimal number of solutions.
ant1
- 利用蚂蚁算法解决TSP旅行商问题，用他能直接输出路由接点-use TSP ant algorithm to solve the traveling salesman problem, in his direct contact output routing
tsplib1
- 旅行商蚁群算法的VC++实现，简单有效，结果可靠-TSP Ant Algorithm VC, simple, effective and reliable.
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
SimulatedAnnealing(TSP)CSHARP
- 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal path.
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)
TSPGACCODE
- 旅行商问题的遗传算法求解源代码，多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm