搜索资源列表
ACATSP
- 基于遗传算法的TSP问题求解，采用三个不同规模的城市模型，分别为att48、Berlin52和rd1-TSP problem based on genetic algorithms, the use of three different scale model of the city, were att48, Berlin52 and rd100
china45
- C++实现TSP问题求解,带有图形界面，程序比较全面发展，界面美观-TSP Problem
tsp
- 遗传算法求解中国旅行商的问题包含45个中国城市的相对坐标-Genetic Algorithm for Traveling Salesman problem in China in 45 Chinese cities including the relative coordinates
演化法
- 首先介绍了当前求解TSP问题最好的演化算法之一：GT算法。文中重点设计了在NOW上求解旅行商问题GT算法的并行算法，详细描述了设计思路，设计策略。还给出了相当详细的并行算法描述。文中设计的并行算法已经在NOW上的PVM平台上实现。关键词NOW，演化计算，旅行商问题,并行计算-first briefed on the current TSP evolutionary algorithm best one : GT algorithm. The article focused on the desi
hopfiledTsp
- 模拟Hopfield网络求解TSP问题 旅行商问题-Analog Hopfield network to solve TSP problems traveling salesman problem
yiqunsuanfa
- 基本蚁群算法求解TSP问题 该程序是运行过的没有问题的-Basic Ant Colony Algorithm for TSP problem is to run the program had no problem
antTSP
- 一个一群算法求解TSP问题的很好的粒子，很适合初学者。-A group of algorithm for solving the problem TSP good particle, it is suitable for beginners.
1111
- 这是一个粒子群算法求解TSP问题的算法，用matlab来实现。-This is a PSO algorithm for solving TSP problems, using matlab to achieve.
PSO
- 一个求解TSP问题的粒子群算法，用matlab仿真实现。-A solution of TSP problem PSO with matlab simulation.
acs
- 利用蚂蚁算法求解TSP问题的matlab源程序，适合初学蚂蚁算法的朋友学习，同时又利于理解TSP问题。-The use of ant algorithm matlab source TSP problem, suitable for beginners to learn ant algorithm friends, but also conducive to understanding the problem TSP.
sa_tsp
- 模拟退火求解TSP问题,代码用MATLAB编写的-Simulated Annealing to solve TSP problems, code written with MATLAB
tsp_applet
- 一个非常好的，用 Java 实现ACO算法对TSP问题进行求解的 applet，界面可调参数-A very good, using Java to achieve ACO algorithm for solving TSP problems applet, the interface adjustable parameters
tsp_GA
- 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题。-In Visual C++ compiler environment, the genetic algorithm procedure, and use them to solve a 48 cities TSP problem.
tsp
- ,描述了实验中群体规模、联赛规模参数 对TSP 问题计算时间复杂性及求解质量的影响.-, Described the scale of the experiment groups, the league scale TSP problem parameters on the complexity of computing time and solution quality.
tsp--yichuangsuanfa
- 程序对48个城市的TSP问题（城市坐标文件对应于48.txt）进行计算，求解路径和最优路径图如下。 48个城市结果，大的红*表示路径开始城市，途经城市依次用蓝色方块和红色*标示。 -Procedures of the 48 cities TSP problem (document coordinates corresponding to the city 48.txt) to calculate the optimal solution of the path and road map
GA
- 基于佳点集的遗传算法求解tsp问题 用java开发，-Based on good point set genetic algorithm tsp problem with java development,
GA_TSP
- 用VC写的遗传算法求解TSP问题程序，研一时候的作业，有多种变异和交叉方法，可以对比各中组合的计算结果-Written by VC genetic algorithm procedure TSP problem, a study of the operation time, there are several variations and cross-method comparison of the results of portfolio
tspyouhua
- 将局部优化算子引入遗传算法求解TSP问题，以求提高算法的性能。具体措施是在标准遗传算法的最后阶段增加步，即对每代的最优个体进行一定次数的局部搜索，以求改善该最优个体。首先提出将反序一杂交法引入局部优化过程中。 同几种‘常用的局部优化力一法相比，反序一杂交法的性能最为突出。实验结果表明，该优化力一法能有效求解300个城市以内的 TSP问题。 -Will introduce a local optimization operator TSP problem genetic algorit
Multi-travelingsalesmanproblem
- 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提 出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题, 并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of pra
GPSOtsp
- 采用遗传微粒群算法（GPSO）求解旅行商问题（TSP）的源代码。内附多个算例，本算法对于中小规模问题求解效率很高，对于大规模问题则效率略低。如有任何疑问，请于http://2shi.phphubei.com.cn/index.php发帖询问。-Genetic Particle Swarm Optimization (GPSO) for Traveling Salesman Problem (TSP) of the source code. Containing a number of examp