搜索资源列表
03120104旅行商问题
- 这是旅行商问题的求解方法.............. 文件输入-This the Traveling Salesman Problem Solving Methods .............. file input
for TSP(Matlab)
- 模拟退火算法用于求解旅行商问题的matlab源程序-simulated annealing algorithm for solving the traveling salesman problem Matlab source
分支与界法
- 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
travelingsalesman
- 用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正-dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction
分支限界算法求解TSP问题
- 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
近邻算法求解TSP问题
- 本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
03120104旅行商问题
- 这是旅行商问题的求解方法.............. 文件输入-This the Traveling Salesman Problem Solving Methods .............. file input
GA_TSP-wrong
- 用遗传算法编写的一个程序,其目的是求解旅行商问题.-genetic algorithm a procedure for the preparation, with the aim of solving the traveling salesman problem.
luxingshang
- 用C编的遗传算法求解旅行商问题的源码-C series of the Genetic Algorithm for the Traveling Salesman Problem source 000000000000000000
TSPGACCODE
- 旅行商问题的遗传算法求解源代码，多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm
travelingsalemanproblem
- 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n betwee
MAOS_TSP
- 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation
TspGA
- 遗传算法求解旅行商问题，对４８个城市的ＴＳＰ问题进行计算，求解路径和最优路径-Genetic Algorithm for Traveling Salesman Problem, the 48 city TSP problems, the solution of the path and optimal path
TSP
- 求解旅行商问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-Solving Traveling Salesman Problem is known cities n the distance between the existing of a salesman to be visited this n c
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
mtspf_ga
- 基于遗传算法的多旅行商问题求解，有过程变化图-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Matlab多旅行商实验
- 用matlab程序求解多旅行商问题，使用蚁群算法(Solving multi traveling salesman problem)
旅行商
- matlab里使用遗传算法，这种算法可以求解一种旅行商问题(mtsp)(Matlab uses genetic algorithms, which can be used to solve a traveling salesman problem (MTSP))
改进pso可以求解城市数量大的旅行商问题
- 城市数量最大的改进的粒子群算法求解旅行商问题(Particle swarm optimization for traveling salesman problem)
tsp_ga
- GA求解旅行商问题，不仅有动态路径，还有距离变化分析(GA to solve the traveling salesman problem)