搜索资源列表
51个城市的tsp程序
- 这是一个用蚁群算法来解决51个城市的tsp问题，该源码是用C++编写的，是一个非常有用的源代码 const int iAntCount=34;//ant numbers 蚂蚁数量 const int iCityCount=51;//城市数量 const int iItCount=500;//循环次数 const double Q=100;//信息素总量
TSP
- 使用蚁群算法编写的C++环境下的旅行商（TSP）经典问题的解决方法-Ant colony algorithm using C++ environment, prepared under the traveling salesman (TSP) classical solution to the problem
jibenyiqunjuleisuanfa
- 该算法，解决了不收敛的问题，聚类效果非常好（效果图如附件图片所示）。改进的蚁群算法是基于遗传算法的改进，在基本遗传算法的基础之上，加入了变异因子，产生变异，从而更快的收敛。-Basic ant clustering algorithm and its improved algorithm
MATWORK
- 分别使用遗传算法、Hopfiled神经网络和蚁群算法基于MATLAB实现了TSP问题的近似求解。-COMPARATIVE STUDY AND COMPREHENSIVE EVALUATION OF SEVERAL INTELLIGENT ALGORITHMS FOR SOLVING TSP PROBLEM
TSPACO.V1.0.tar
- 蚁群算法解决TSP问题的源代码，希望站长能采用，但愿对大家有点启发！-Ant Algorithm for the Traveling Salesman Problem source code, can be used station, we hope to inspire a bit!
ACA
- matlab 写的蚁群算法，用于计算tsp问题，感觉效果不错的。-matlab aca for tsp
tsp
- 该程序是蚁群算法和遗传算法的混合算法的C语言程序在求解TSP问题时的应用，可以进行扩展到其他问题的两种算法应用-The program is ant colony algorithm and genetic algorithm hybrid algorithm in the C language program to solve the issue of the application of TSP, can be extended to other applications of the tw
ASO_DHB
- 基本蚁群算法（段海滨《蚁群算法原理及应用》附录Matlab程序）-Basic Ant Colony Algorithm for TSP
ACATSP
- 经典的用于求解TSP（旅行商问题）的自适应蚁群算法-Classic self-adaptive ACO algorithm for TSP
ant_colony_system-Solve-the-TSP-problem
- 基于蚁群算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Ant colony algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
DDAC
- 蚁群算法解决tsp问题，antsystem为核心运算类，窗体为接口程序，先生成邻接矩阵再运算-Tsp ant colony algorithm to solve the problem, this is the core classes, must have interface program
AntAlgorithm
- 一个蚁群算法求解邮递员路由问题（TSP）具体实现，本人在传统蚁群算法基础上进行改进，达到较高的效率-An ant colony algorithm for routing problem postman (TSP) concrete implementation, I am in the traditional ant colony algorithm based on the improvements to achieve higher efficiency
yqsfy
- TSP问题蚁群算法通用Matlab程序源码-Ant colony algorithm for TSP problem common Matlab source code
ant-for-tsp-pr76
- 基于蚁群算法用MATLAB求解76城市TSP问题，可得目前世界最优解，适合高手阅读使用-Using MATLAB based on ant algorithm for solving the problem of 76 cities TSP, the best solution available to the world for master read the
ACO-TSP
- 三种蚁群算法解决TSP问题
TSP-based-on-improved-pso
- 基于对粒子群优化算法原理的分析，实现了一种基于TSP的改进的粒子群优化算法：求解TSP的混合粒子群算法，结合遗传算法、蚁群算法和模拟退火算法的思想来解决TSP问题。-Particle swarm optimization based on the principle of the analysis, implemented based on TSP, improved particle swarm optimization algorithm: solving the TSP hybrid pa
29_ACO_note_35
- 基于蚁群算法tsp路径寻优，有详细说明每步的意义，做法(Based on the ant colony algorithm tsp path optimization, there is a detailed descr iption of each step of the meaning, practice)
matlab-基本蚁群算法（TSP）（多点版）
- 蚁群算法解决TSP问题的matlab源代码(Ant colony algorithm to solve the TSP problem matlab source code)
最基本的蚁群算法+2opt邻域搜索_求解TSP
- 蚁群算法，蚁群优化算法（ant colony optimization,ACO）就是一种特别成功的元启发式算法，在20年前诞生于意大利的一所最负盛名的大学——米兰理工大学。其灵感来源于真实蚂蚁的行为。(We list below 25 TSP instances taken from the World TSP. For these instances, the cost of travel between cities is specified by the Eulidean distance
蚁群算法的优化计算——旅行商问题（TSP）优化
- 蚁群算法的优化计算——旅行商问题（TSP）优化(Optimization calculation of ant colony algorithm)