搜索资源列表
ACO-TSP
- Ant Colony for Traveling salesman problem
ACO
- TSP旅行商问题，解决城市旅行距离最短的问题，基于蚁群算法求解。-TSP traveling salesman problem, solve the problem of urban travel the shortest distance, based on ant colony algorithm.
ACO
- aco code in matlab for tsp
ACO-tsp
- 利用蚁群算法解决旅行商问题，文件包含数据集为各城市的坐标-Ant colony algorithm to solve the traveling salesman problem, the file containing the data set for the coordinates of each city
ACO-to-solve-TSP-problem
- 算法使用蚁群算法求解TSP问题，使得最终所需时间短，效率高。-Algorithm using ant colony algorithm for TSP problem, so that the final time is short, high efficiency.
aco
- 描述蚁群算法的功能及应用，及其在TSP中的实现-Function and Application of ant colony algorithm is described, and its implementation in the TSP
ACO
- TSP问题的人工蚁群算法中，假设m只蚂蚁在图的相邻节点间移动，从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定：1、信息素质，也称信息素痕迹。2、可见度，即先验值。-Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem
aco
- 蚁群算法是现代优化算法，这个是直接可以编译通过的蚁群算法求解51城市的TSP问题的MATLAB源代码 -Ant colony algorithm is a modern optimization algorithm, which is directly compiled by the ant colony algorithm to solve the 51 cities of the TSP problem MATLAB source code
TSP问题代码
- 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawing function.)
Solve TSP using Ant Colony Optimization
- Solve Travelling Salesman Problem Using Ant Colony Optimization
ACO
- Ant Colony Optimization for TSP
ACO
- matlab code Ant colony optimization for solve Travelling salesman problem
最基本的蚁群算法+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问题的各种蚁群优化程序ACOTSP-1.03
- 针对TSP问题的各种ACO蚁群优化算法的程序，C++语言实现， 对研究蚁群优化的小伙伴有所帮助(ACO ant colony optimization algorithm The program of various ACO ant colony optimization algorithms for the TSP problem and the implementation of the C++ language are helpful to the small partners stu
TPS ANT
- 使用蚁群算法解决TSP问题，python2.7(solve TSP with ACO algorithm)
ACO
- 蚁群算法是一种新型的模拟进化算法，鉴于目前国内尚缺乏这一方面的研究，其研究刚刚开始，远未像遗传算法、模拟退火算法等算法那样行程系统的分析方法和坚实的数学基础，有许多问题有待进一步研究，如算法的收敛性、理论依据等更多细致的工作还有待于进一步展开。(The ant colony algorithm is a novel simulated evolutionary algorithm, given the current lack of the research on this aspect, th
79419092ACO---pso-MTSP-
- ACO-PSO结合的解决TSP问题的一种方法(The ACO-PSO combines a solution to the TSP problem and the algorithm is very reliable.)
ACO for TSP
- 蚁群算法解决旅行商问题，能够成功运行并且有结果(Ant colony algorithm can solve the traveling salesman problem and run successfully.)
desktop
- aco算法尝试解小范围tsp问题，但误差挺大(ACO algorithm tries to solve small range TSP)
code
- 基于蚁群算法的 TSP 求解，分别采用蚁群算法和蚁群算法-粒子群混合算法进行优化求解，使用不同的交叉和变异适应度函数更新粒子，从而实现 TSP问题的优化求解，更加逼近实际问题。(Based on the TSP solution of ant colony algorithm, ant colony algorithm and hybrid algorithm of ant colony algorithm particle swarm optimization are used to solv