搜索资源列表
AMGA-TSP
- 旅行商（TSP）问题用自适应记忆遗传算法(Adaptive Memory Genetic Algorithm, AMGA)在matlab下的实现-The traveling salesman problem (TSP), Adaptive Memory genetic algorithm (Adaptive Memory Genetic Algorithm, AMGA) in matlab
TSP-GA
- 旅行商(TSP)问题用标准遗传算法（GA）在matlab下实现的。-The traveling salesman problem (TSP) using standard genetic algorithm (GA) under Matlab.
TSP
- 模拟退火算法的tsp问题在matlab中的解决方案-The solution of the simulated annealing algorithm for the tsp problem in matlab
tsp
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm generic matlab program
TSP---Copy
- This dynamic matlab code for tsp, an optimization program-This is dynamic matlab code for tsp, an optimization program
Branch_and_bound_for_TSP_tutorial
- 该程序是用分支定界算法解决旅行商问题，所用语言为Matlab-The program is branch and bound algorithm for TSP problem
geneticTSP
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序，数模专用- TSP problem (also known as: traveling salesman problem, traveling salesman problem) common genetic algorithm matlab program, special modulus
BranchBound
- 分支定界方法，用于解决tsp问题，matlab实现。-Branch and bound method for solving the tsp problem, matlab realize.
lxs
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-The TSP problem (also known as: traveling salesman problem, traveling salesman problem) general matlab genetic algorithm
ant-colony-algorithm
- 用matlab实现蚁群算法，求解TSP以及两地最优问题，在原始的基础上改进，效果良好。-use Matlab to realize ant colony algorithm to solve TSP and optimal problem, on the basis of the original improvement, the result is good.
TSP_CE
- Cross entropy for TSP problem matlab file
TS
- tabu search for tsp by matlab
multi-tsp
- 针对多旅行商问题的tsp问题的遗传算法matlab程序-TSP problem for multi- traveling salesman problem of genetic algorithm matlab program
ACO
- Ant Colony Optimization for TSP
TSP - A Genetic Algorithm Approach
- TSP with Geenetic Algorithmn
Tabu Search TSP
- matlab code for tsp using tabu search
穷举法求解0-1整数规划的matlab程序
- 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, knapsack problem and so on. In