搜索资源列表
ACOforTSP
- 用基本蚁群算法解决tsp即旅行商问题用vc环境的
TSP
- 使用蚁群算法编写的C++环境下的旅行商（TSP）经典问题的解决方法-Ant colony algorithm using C++ environment, prepared under the traveling salesman (TSP) classical solution to the problem
ant_colony_algorithm_TSP
- 在大学生或者研究生数学建模竞赛中旅行商优化问题是一个很重要而又难解决的问题，本人自编程蚁群算法智能程序很好的解决此问题。-University students or graduate students in the Mathematical Contest in Modeling in the traveling salesman optimization problem is a very important and difficult to resolve the problem, I s
ant_colony_system
- 蚁群算法解决旅行商问题的程序，希望对大家有用-Ant colony algorithm to solve traveling salesman problem of the procedure, in the hope that useful
080502
- 基于MATLAB的蚁群算法仿真研究 ：介绍了基于MATLAB的蚁群算法仿真研究。对佛罗里达州六城市旅行商问题进行了MATLAB仿真，计算结果显示，作为新型 进化算法，蚁群算法能够解决复杂组合优化问题。-Ant colony algorithm based on MATLAB Simulation: This paper introduces the ant colony algorithm based on the MATLAB simulation. Six Cities of Flo
ant-colony
- 比较详细的蚁群算法matlab程序，主要功能解决旅行商问题-Ant colony algorithm in more detail matlab program, the main function of Traveling Salesman Problem
c-tsp
- 实现旅行商问题的解决（微粒群算法或者蚁群算法）-To achieve resolution of the traveling salesman problem (or ant colony optimization Particle swarm optimization)
aco-FashionXuBlog
- 蚁群算法解决旅行商问题的C++源码,开发环境VS。-ACO for TSP problem
ACO-PSO
- 蚁群算法（ACO）和粒子群算法（PSO）的混合算法解决旅行商问题（TSP）的matlab代码-Ant colony optimization (ACO) and particle swarm optimization (PSO) of the hybrid algorithm to solve traveling salesman problem (TSP) in matlab code
ant_tsp
- 用蚁群算法解决旅行商问题，有详细的注释，写成了函数，可修改部分参数后使用-Ant colony algorithm to solve traveling salesman problem, detailed notes, written in a function, some parameters can be modified to use
ant
- 用C语言编程的蚁群算法，很好的解决了旅行商的问题。-C language programming with ant colony algorithm, a good solution to the traveling salesman problem.
ACO
- 用改进的蚁群算法来解决旅行商问题，以寻求最优解！-Improved ant colony algorithm used to solve the traveling salesman problem, to find the optimal solution!
ANTS
- 利用蚁群算法解决TSP（旅行商）问题的程序-Ant colony algorithm to solve TSP (traveling salesman problem)
yiqunlvxing
- 蚁群优化是一种元启发式的随机搜索技术,是目前解决组合优化问题最有效的工具之一.将信 息素更新和随机搜索机制的改进相结合,提出一种快速求解旅行商问题的蚁群算法-Ant colony optimization is a kind of meta heuristic random search technique, is one of the most effective tool to solve combinatorial optimization problem. The letter
ACATSP
- 基于MATLAB的蚁群算法解决旅行商问题(Used to calculate the distance between two points)
22
- 解决多个点之间的简易连接问题,里面都有注释，方便初学者分步骤操作(for solving the shortest way in multiple points)
蚁群算法（路径规划程序）
- 蚁群算法是一种群智能算法，也是启发式算法。基本原理来源于自然界蚂蚁觅食的最短路径原理。蚁群算法根据模拟蚂蚁寻找食物的最短路径行为来设计的仿生算法，因此一般而言，蚁群算法用来解决最短路径问题，并真的在旅行商问题（TSP，一个寻找最短路径的问题）上取得了比较好的成效。目前，也已渐渐应用到其他领域中去，在图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类分析等方面都有所应用。(Ant colony algorithm is a population intelligent algorithm,
TSP_aco
- 利用蚁群算法解决10、30、75城市的旅行商问题(Solve the traveling salesman problem)
acatsp
- 利用蚁群算法仿真解决旅行商问题，找出最短路径(Ant colony algorithm to solve traveling salesman)
ACOTSPtw
- 使用蚁群算法解决带时间窗的旅行商问题，注释详细(Ant colony algorithm is used to solve traveling salesman problem with time windows. Detailed annotations are given.)