搜索资源列表
ant-tsp-elimcross
- 蚁群算法求解tsp问题后去交叉.数据为att48，48个城市的tsp -Ant Algorithm tsp problems to cross. Att48 data, the 48 cities tsp
TSP-ant-algorithm
- 用于解决TSP问题的蚁群算法，里面有详细注释-TSP solution for the ant algorithm, which detailed Notes
TSP
- TSP双种群蚁群算法。还包括了“30城市TSP问题数据与最优解.mat”，“75城市TSP问题数据.mat”，和“442TSP问题数据与算法对比.mat”-TSP-Stocks ant colony algorithm. Also include "30 cities TSP data and the optimal solution. Mat, " "75 cities TSP data. mat, &q
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
tsp
- TSP的智能算法，里面包含最大最小蚁群算法，蚂蚁系统，蚁群系统
TSP
- TSP问题的matlab实现程序,该程序在机器上可以正常运行,现提供给大家参考-TSP issues realize matlab program on the machine can function properly, is now available to U.S. reference
tsp
- tsp问题俗称旅行商问题，一个商人从一个城市出发，经过所有的城市一次且仅一次回到出发的城市，问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的，只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the
GA-TSP
- 该程序用遗传算法求解TSP问题，得到了比较优的解，初学者可以参考。-The procedure for solving TSP using genetic algorithms problems, have been relatively superior solutions, beginners can refer to.
TSP(lvxingshangwenti)
- 模拟退火求解TSP旅行商问题，有全部的matlab源代码。并且有帮助文件。-Simulated Annealing for Solving Traveling Salesman Problem TSP, has all of matlab source code. And have help files.
TSP-ACE2
- VC下的蚁群算法，处理问题为TSP中国邮递员问题。另含一个日志处理类。-VC under the ant colony algorithm for TSP deal with the issue of Chinese postman problem. Another type of treatment with a log.
TSP-baoli
- 暴力破解TSP中国邮递员问题的程序。使用数据为Oliver30.tsp，从其中的蚂蚁算法和暴力破解算法可知智能算法的重要性。-Violence to break Chinese postman problem TSP procedures. Use of data for Oliver30.tsp, from which the ant algorithm and violent crack algorithm, we can see
tsp
- 這是一個利用模擬退火來計算TSP旅行家的問題-This is a use of simulated annealing to calculate the TSP problem of travelers
TSP
- 商务旅行问题TSP用Hopfield人工神经网络实现-Business Travel TSP problem with Hopfield artificial neural network
TSP
- 包括蚁群，模拟退火，遗传，神经网络，禁忌搜索等智能优化算法对TSP问题的解决。-Including ant colony, simulated annealing, genetic, neural networks, tabu search, such as intelligent optimization algorithm to TSP problem.
TSP
- 在Visual C++ 编译环境下，模拟退火算法程序，并利用它们求解了48个城市的TSP问题。-In the Visual C++ Compiler environment, the simulated annealing algorithm procedures and use them to solve a 48 cities TSP problem.
TSP
- 这是一个用遗传算法来求解旅行商问题（TSP问题：Travelling Salesman Problem）的源代码，学习遗传算法，演化计算的很值得一看！-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic al
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
TSP
- 本程序是10个城市的TSP神经网络程序，采用C＋＋ builder编译，在运行结束后，可通过图形显示路径。-This procedure is the 10 cities TSP neural network procedures, the use of C builder compiler, running after the end of the path through the graphical display.
Tsp
- 用java实现的利用蚁群算法实现的tsp问题，有图形输出-Java achieved with the use of ant colony algorithm to achieve the tsp problem graphics output
tsp
- c语言实现，遗传算法求解TSP问题，基本遗传算法，未经过优化-c language, genetic algorithm for solving TSP problems, the basic genetic algorithm, has not been optimized