Welcome![Sign In][Sign Up]
Location:
Search - ts Tsp

Search list

[Bio-RecognizeONE_NEW_GA_TO_SOLVE_TSP

Description: 用vc++程序编的遗传算法解决TSP问题.txt def.h TSP.cpp tsp.h -with vc procedures addendum to the genetic algorithm to solve TSP. Txt def.h TSP.cpp ts p.h
Platform: | Size: 4096 | Author: jiangyi | Hits:

[AI-NN-PRTS_TSP

Description: 解决TSP问题的TS算法MATLAB实现,其中加入了变异算法,当然也可以去掉这个步骤,调用TS_TSP(N, inStart, IsBianYi),N是城市数目,inStart是起始城市的序号,IsBianYi就是选择变异否,如果为0则不要变异,否则就是结合变异算子的TS算法。 至于下面的参数可以自己调: T:总的循环次数; tabulength:禁忌长度; Pby:变异概率; -Solve the TSP problem MATLAB realize TS algorithm, which joined the variance algorithm, of course, this step can also be removed, call TS_TSP (N, inStart, IsBianYi), N is the number of cities, inStart is the serial number of the starting cities, IsBianYi is to choose variation has, if not for the variation of 0, otherwise, it is combined with mutation of the TS algorithm. As for the following parameters can be their own tune: T: total number of the cycle tabulength: taboo length Pby: mutation probability
Platform: | Size: 5120 | Author: rty | Hits:

[AI-NN-PRTS-TSP

Description: 使用禁忌搜索算法求解TSP(旅行商问题)的JAVA源程序-The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
Platform: | Size: 3072 | Author: ann | Hits:

[matlabTS

Description: TSP问题,即旅行商问题,matlab环境下可以运行-TSP problem, that is, traveling salesman problem, matlab environment can run
Platform: | Size: 59392 | Author: 刘琴 | Hits:

[AI-NN-PRTSP

Description: 各种算法的TSP源码,包含GA、SA、TS、ANN。-TSP source of various algorithms, including GA, SA, TS, ANN.
Platform: | Size: 8192 | Author: | Hits:

[AI-NN-PRsA-TS-for-TSP

Description: 模拟退火算法及禁忌搜索算法解tsp的比较,文章及matalb源码-Simulated annealing algorithm and tabu search algorithm for solving tsp comparison, articles and matalb source
Platform: | Size: 74752 | Author: mengxiangwei | Hits:

[JSP/JavaGa

Description: GA_Traffic The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the study of vehicle routing problems adopt an offline point of view: the input is entirely known beforehand. In many applications, this is actually not the case since the instance becomes known in an online fashion, time after time. Even determining when the instance is completely given could be impossible. The need for an online model then arises naturally.-GA_Traffic The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the study of vehicle routing problems adopt an offline point of view: the input is entirely known beforehand. In many applications, this is actually not the case since the instance becomes known in an online fashion, time after time. Even determining when the instance is completely given could be impossible. The need for an online model then arises naturally.
Platform: | Size: 1024 | Author: gardenia_roses | Hits:

[matlabTsp

Description: TS算法求解TSP问题,里面包含样本数据,算法收敛较好,优化结果比较理想!-tabu search for TSP
Platform: | Size: 2048 | Author: gcz | Hits:

[Windows Developvbfrance_RESOLUTION-PROBLEME-VOYAGEUR-COMMERCE-TS

Description: TSP problem resolution VB6
Platform: | Size: 6144 | Author: HICHO | Hits:

[Data structs02666199TS-TSP

Description: 禁忌搜索算法,解决三十个城市间的旅行商问题,求最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, the shortest distance
Platform: | Size: 3072 | Author: 童言 | Hits:

[matlabTS-for-TSP

Description: 现代优化算法中的禁忌搜索算法,50城市TSP测试数据,经测试结果与最优解接近。-Tabu search algorithm, 50 cities TSP test data.
Platform: | Size: 2048 | Author: mike | Hits:

[AI-NN-PRTS-SA

Description: 禁忌搜索和模拟退火相结合的算法,解决TSP问题。注:31城市。-Tabu search and simulated annealing to a combination of algorithms to solve TSP. Note: The 31 cities.
Platform: | Size: 1024 | Author: 张闯 | Hits:

[Compress-Decompress algrithmsGA-about-Materials-TS-TS-TSP

Description: 用于工程材料计算的遗传算法,关于TSP问题的禁忌算法 模拟退火算法比较等的源程序-For engineering materials calculated genetic algorithm, tabu search algorithm simulated annealing algorithm for TSP and other source code
Platform: | Size: 44032 | Author: zhuj | Hits:

[matlabTSP

Description: 免疫克隆选择算法打求解ts问题 可直接运行 功能强大-Immune clonal selection algorithm fight solving ts problems can be directly run powerful
Platform: | Size: 58368 | Author: 孔祥宇 | Hits:

[AI-NN-PRTS

Description: 在matlab上编程,采用禁忌搜索解决TSP问题-In matlab programming, using tabu search to solve the TSP
Platform: | Size: 2048 | Author: 王深水 | Hits:

[OtherTS

Description: ts算法 tsp上的应用 最新的 不错,利用禁忌搜索算法解决城市的tsp问题,简单易懂,适合初学者-The use of tabu search algorithm to solve tsp city
Platform: | Size: 6144 | Author: hainan | Hits:

[source in ebookTS-For-Tsp

Description: tsp问题的禁忌搜索算法,matlab编程,智能计算-tabu search algorithm tsp problem, matlab programming, intelligent computing
Platform: | Size: 74752 | Author: 小坤 | Hits:

[File FormatTS

Description: 禁忌搜索算法解决TSP问题,以中国31省会城市的最短旅行路径为例来说明TS算法的优越性-TS algorithm to solve TSP problem
Platform: | Size: 6144 | Author: | Hits:

[AI-NN-PRTS-TSP

Description: 本禁忌搜索算法主要用于求解经典的TSP问题(Tabu search algorithm is used to solve the classical TSP problem)
Platform: | Size: 10240 | Author: 舒逸流风 | Hits:

[Internet-NetworkTS-TSP

Description: 用TS算法解决推销商最短路径问题,数据是中国的各个省会和直辖市(Salesman to solve the shortest path problem with TS algorithm, the data is Chinese all provincial capitals and municipalities directly under the central government)
Platform: | Size: 3072 | Author: 漆膜 | Hits:
« 12 »

CodeBus www.codebus.net