搜索资源列表
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 solu
ant1
- 利用蚂蚁算法解决TSP旅行商问题，用他能直接输出路由接点-use TSP ant algorithm to solve the traveling salesman problem, in his direct contact output routing
HuoLangDanProblem
- 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
TSPprogrammatlab
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, f
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
traverller
- 产生式系统中旅行商问题的求解-Production System Traveling Salesman Problem Solving
hldan
- 模拟退火算法求解货郎担问题（用C#实现）-simulated annealing algorithm for traveling salesman problem (with C#)
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.
JSPzzj
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市 只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其 旅行路线的总长度最短？ -known cities between the distance from the existing one must salesman n visited this city, every city and can only be visit
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
evolver
- This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <city file> <config file
TSPNEW
- 经典的货郎担问题解决办法，采用了模拟退火算法，结构非常清楚，速度很快！-classic traveling salesman problem solution, using simulated annealing, the structure is very clear, very fast!
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest short
countlong
- 数据录入，远程连接的数据录入，可以记录业务员跟踪的客户，锁定自己的客户-data entry, remote connectivity to data entry, record salesman tracking customers, lock their customers
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
traveljinshi
- 旅行售货员问题的近似算法 数据结构 算法 NP完全问题-traveling salesman problem approximation algorithm data structure algorithms NP-complete problem