搜索资源列表
SimulatedAnnealing(TSP)CSHARP
- 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal path.
CsharpTSP
- Csharp实现蚁群算法解决TSP问题，主要是一种模拟生物的进化:用信息素来引导蚂蚁向比较好的方向前进.是学习该算法的很好的参考源码
ACO.ZIP
- ACO algorythm. This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP). The ACO algorithms implemented are Ant System, Elitist Ant System, MAX-MIN
anttsp
- 用蚁群算法解决TSP问题，其中有基本蚁群，蚁密系统，还有自己提出的改进算法，自带GUI界面。-TSP with ant colony algorithm to solve the problem, including the basic ant colony, ant density systems, as well as the improved algorithm itself, its own GUI interface.
TSP_final
- TSP程序,采用C#实现，可解决旅行商问题,参数设置可视化-TSP program, using C# to achieve, solve the traveling salesman problem, visualization parameters
DDAC
- 蚁群算法解决tsp问题，antsystem为核心运算类，窗体为接口程序，先生成邻接矩阵再运算-Tsp ant colony algorithm to solve the problem, this is the core classes, must have interface program
CSharp_TSP_GA
- C#下基于遗传算法做的TSP程序，很好用！-TSP Solution Base on GA in CSharp Language
CSharp-TSP-SA
- 基于C# 使用模拟退火算法求解旅行商问题的源码实现，解压后就可使用，方便 好用。-Based on C# using the simulated annealing algorithm for traveling salesman problem source implementation, after decompression can be used, easy to use.