搜索资源列表
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
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
lvxingshang
- 旅行商问题 c++源程序-Traveling salesman problem c++ source ~~~~
lvxingshang
- 给予免疫与遗传算和蚁群算法 接旅行商问题 很好的论文-Provide the immune genetic algorithm and ant colony algorithm and then a very good paper traveling salesman problem
lvxingshang
- 有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来-N cities, a salesman from which a city departure, each city can only traverse requirements went through all of the city, and then returned to the
lvxingshang
- 一个经典的旅行商问题源码，不是最优解，只是一种 思路-A classic traveling salesman problem source is not the optimal solution, just a thought
lvxingshang.java
- 用java语言开发基于遗传算法理论的旅行商最短路径问题，包含遗传算法的常用基本理论。-The basic theory of common java language development based on the traveling salesman problem based on genetic theory shortest path algorithms, including genetic algorithm.
yichuan-lvxingshang
- 自己编写的商人旅行问题,使用的是遗传算法-base on C++,and I used data and C,businessman journal question
lvxingshang
- JAVA实现旅行商问题，有简单的可视化界面 有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface There are N cities, which to ask a question, the only way to
tuihuo
- 用模拟退火算法求旅行商问题。自数字数字数字梳子梳(lvxingshang wenti moni tuihuo suanfa)