搜索资源列表
-
0下载：
用遗传算法解决旅行商问题的简单实现．word格式，简单，易懂
-using genetic algorithms to solve the traveling salesman problem simple realization. Word format, a simple, understandable
-
-
0下载：
旅行商问题 算法中经典的算法 实验报告
内附代码-Traveling Salesman Problem Algorithm classic algorithm Experimental Report
-
-
0下载：
have recently become very interested in the area of genetic algorithms and Ant Colony Optimization techniques. I was determined to write a complete program demonstrating these two techniques. In particular I wanted to compare the efficiency of these
-
-
0下载：
老外写的论述TSP问题的各种算法及相关论述，可作研究用。-Written by foreigners of various algorithms discussed in TSP problem and the related discussion, can be used for research.
-
-
0下载：
这是关于基础模型——旅行商问题经典解法C语言编程-This is about the base model- the classic traveling salesman problem solution of C language programming
-
-
0下载：
状态图实际上是一类问题的抽象表示。事实上，有许多智力问题(如梵塔问题、旅行商问题、八皇后问题、农夫过河问题等)和实际问题（如路径规划、定理证明、演绎推理、机器人行动规划等）都可以归结为在某一状态图中寻找目标或路径的问题。因此，研究状态图搜索具有普遍意义。
-State diagram is actually a class of abstract representation of the problem. In fact, there are many mental problems (s
-
-
0下载：
用分支与界法解决旅行商问题，c++源代码。十分快速。-With the branch and bound algorithm to solve traveling salesman problem, c++ source code. Very fast.
-
-
0下载：
Traveling Salesman Problem Based on Genetic Algorithm
-
-
0下载：
Traveling Salesman Problem Based on Genetic Algorithm
-
-
0下载：
用matlab解决TSP旅行商问题,针对30个城市最短路径进行优化-Using matlab to solve the traveling salesman problem TSP for 30 cities to optimize the shortest path
-
-
0下载：
Traveling Salesman Problem using GA
-
-
0下载：
货郎担问题： 求解货郎担问题的分枝限界算法-Traveling Salesman Problem
-
-
0下载：
货郎担问题：求解货郎担问题的分枝限界算法-Traveling Salesman Problem: Solving the branch and bound algorithm for Traveling Salesman Problem
-
-
0下载：
关于利用蜂群算法（bca）解决旅行商问题（Tsp）的几篇中文文章，可帮助入门了解。-On the use of colony algorithm (bca) Traveling Salesman Problem (Tsp) of several Chinese language articles that can help started to understand.
-
-
1下载：
利用改进的粒子群算法解决旅行商问题，即g改进的PSO解决TSP,在调用程序时，直接输入pso（c,n），c为距离矩阵，请自己给出，n为粒子群个数-Improved particle swarm algorithm to solve the traveling salesman problem, ie g Improved PSO to solve the TSP
-
-
0下载：
Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network
design problem. These problems are very common to back bone network design
problem. In all these three problems, the main difference is the degree of the node
whic
-
-
0下载：
子群优化算法，并把次算法用于求解旅行商问题．为了增强算法的局部搜索能力，在改进的算法中加入倒置，局部搜索等方法，同时利用遗传算法的全局搜索能力强的特点对求到的解再进行优化，同时，对于搜索全局最优路径方面，通过应用消除交叉路径的方法进行了优化．-Sub swarm optimization algorithm, and the second algorithm is used to solve the traveling salesman problem. In order to enhance
-
-
0下载：
禁忌搜索算法程序，完全解决了旅行商最短路径问题-Tabu search algorithm, completely solve the traveling salesman problem shortest path
-
-
0下载：
总结的混合粒子群算法、蚁群算法、遗传算法求TSP（旅行商问题）,值得看一看-Summary hybrid particle swarm optimization, ant colony algorithm, genetic algorithm for TSP (traveling salesman problem), it is worth a look
-
-
0下载：
Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
-
