Location:
Search - opt tsp
Search list
Description: TSP算法
1.C语言TSP算法
2.2-OPT，orOPT摄动
3.Main单独执行
Platform: |
Size: 2206 |
Author: DuDu Ch |
Hits:
Description: 求解tsp问题的局部优化算法-the local optimization algorithm
Platform: |
Size: 45056 |
Author: 曲晓威 |
Hits:
Description: 本程序实现了多城市的tsp问题（即旅行商问题）的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm
Platform: |
Size: 1171456 |
Author: 叶靥 |
Hits:
Description: TSP算法
1.C语言TSP算法
2.2-OPT，orOPT摄动
3.Main单独执行-TSP algorithm 1.C language TSP algorithm 2.2-OPT, orOPT perturbation separately 3.Main
Platform: |
Size: 2048 |
Author: DuDu Ch |
Hits:
Description: 用模拟退火算法求解TSP问题
[1]主函数tsp.m
[2]计算路径长度的子函数 route_long.m
[3]随机交换两个节点的顺序函数exchange.m-Using simulated annealing algorithm for solving TSP problems [1] the main function tsp.m [2] calculation of path length of Functions route_long.m [3] randomly exchange the order of two nodes function exchange.m
Platform: |
Size: 1024 |
Author: 齐亚超 |
Hits:
Description: 求解TSP和MTSP的混合遗传算法_英文_-Abstract:M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup
cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2
mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic
methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le
T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2
brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and
heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive.
Key words: TSP op t im izat ion genet ic algo rithm 2op t
Platform: |
Size: 217088 |
Author: Notics |
Hits:
Description: Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
Platform: |
Size: 17408 |
Author: 云祖 |
Hits:
Description: PSO求解TSP问题的参考文献，查询学校IEEE检索得到！-Particle Swarm Optimization Based on Neighborhood
Encoding for Traveling Salesman Problem
Platform: |
Size: 318464 |
Author: asdwe |
Hits:
Description: it is a matlab program for ga sa tabu sworm opt heuristics we can also use matlab here. or there can
Platform: |
Size: 9216 |
Author: virendra |
Hits:
Description: 蚁群算法结合2-opt技术解决旅行商问题（TSP）-Ant colony algorithm with 2-opt technology to solve the traveling salesman problem (TSP)
Platform: |
Size: 3737600 |
Author: newshowing |
Hits:
Description: tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
Platform: |
Size: 2048 |
Author: mm |
Hits:
Description: 蚁群算法解欧氏平面上的TSP问题。包括了2-opt、3-opt优化，经过了若干经典数据的测试。-AntColony algorithm solving the TSP problem in Euclid plane, including 2-opt and 3-opt optimization. It has been tested by authorized data.
Platform: |
Size: 13312 |
Author: sunli |
Hits:
Description: Its a C/C++ implementation of 2-opt algorithm for Solving Travelling Salesman Problem.
Platform: |
Size: 2048 |
Author: Prasenjit Nag |
Hits:
Description: 自己编写的带2-opt法的蚁群算法求解TSP，可以运行，运行环境VS2008-His writing with 2-opt method of ant colony algorithm for solving TSP, can run, run VS2008 environment
Platform: |
Size: 1044480 |
Author: she |
Hits:
Description: E:\学习\人工智能\禁忌搜索 +opt解决TSP问题\禁忌搜索+opt解决TSP问题 含测试数据-E: \ learning \ Artificial Intelligence \ tabu search \ taboo search to+opt for to solve the TSP \ taboo search to+opt for to solve the TSP
Platform: |
Size: 3072 |
Author: yang |
Hits:
Description: Nearest Neighbor for TSP with 2-opt MATLAB
Platform: |
Size: 1024 |
Author: Yener |
Hits:
Description: Fartest Insertion for TSP with 2-opt MATLAB
Platform: |
Size: 1024 |
Author: Yener |
Hits:
Description: Analyzing 2-opt for Traveling Salesman problem (TSP)
Platform: |
Size: 1024 |
Author: BB |
Hits:
Description: 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.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers-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.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers
Platform: |
Size: 2048 |
Author: ahmed |
Hits:
Description: 运用2-opt算法解决TSP（旅行商问题），满足自定义五个点及自设迭代次数，包括可视化结果。(TSP (Traveling Salesman Problem) is solved by using 2-opt algorithm, which satisfies five custom points and self-designed iteration times, including visualization results.)
Platform: |
Size: 1024 |
Author: glam |
Hits: