搜索资源列表
TSP_PianYi
- 图论中的经典TSP旅行商问题的“便宜”算法，C语言实现的DOC程序。-graph theory of classical TSP Traveling Salesman Problem "bargain" algorithm, C language DOC procedures.
ga_and_tsp
- 这是一个用matlab编写的，关于如何用遗传算法来解决货郎担问题的程序-using Matlab, prepared on how to use genetic algorithms to solve the traveling salesman problem procedures
toolbox-tsp
- 是全面分析旅行商问题的工具箱，包含了很多方面的测试程序-is a comprehensive analysis of the traveling salesman problem toolbox contains a lot of testing procedures
travelsale
- 利用遗传算法解决旅行商问题，以五个城市为例，给出了程序的源码和具体说明。-using genetic algorithms to solve the traveling salesman problem, and to five cities as an example, the program source and specify.
jiayouwenti
- 一个旅行家想驾驶汽车从城市A到城市B（设出发时油箱是空的）。给定两个城市之间的距离dis、汽车油箱的容量c、每升汽油能行驶的距离d、沿途油站数n、油站i离出发点的距离d[i]以及该站每升汽油的价格p[i],i=1,2,…,n。设d[1]=0<d[2]<…<d[n]。要花最少的油费从城市A到城市B，在每个加油站应加多少油，最少花费为多少？-travel home to a car driving from city A
lvxingshang
- 算法分析问题：用VC编写的旅行商程序，可以实现旅行商最短路径旅行个城市的功能-algorithm analysis : VC procedures for the preparation of the traveling salesman, TSP can achieve the shortest path of travel to the cities function
GAtsp(C++)
- 这是从其他网站下载的C#程序，用以求解旅行商的问题，采用算法为遗传算法-This is downloaded from other websites C# procedure for solving the traveling salesman problem, the algorithm used for the genetic algorithm
750
- 仍然是求解旅行商遍历若干城市的程序源代码，以文本形式给出，可以用c#平台运行-is still traveling salesman for a number of cities in the traversal of program source code, the form is given to the text. c # can run platform
分支界限法求解货郎担问题
- 研究生算法作业分支界限法求解货郎担问题-graduate algorithm operations branch line Traveling Salesman Problem Solving
GA_TSP_Matlab
- matlab遗传算法工具箱，解决TSP旅行商问题，很好用的代码。-Matlab toolbox genetic algorithm to solve TSP traveling salesman problem, easy to use code.
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He s
benchmark+for+DP
- 旅行商问题（动态规化） 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 -traveling salesman problem (dynamic regulation of) a salesman to a number of cities to s
GA_TSA
- 利用遗传算法解决TSP旅行商问题的Java原码-using genetic algorithms to solve the traveling salesman problem TSP original Java code
SA_TSA
- 利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
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
- 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane
GA_TSP
- A Genetic Algorithms and the Traveling Salesman Problem
TravelingSalesmanProblemGeneticAlgorithm
- Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
SolvingSymmetricalandDisSymmetricalTSPbaseonAntCol
- Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
TSP(TravelingSalesmanProblem)
- Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a numb