搜索资源列表
yiqunsuanfa
- 蚁群算法最短路径通用Matlab程序.rar
City
- 蚁群算法,解决最短路径的NP难问题,数据采用国际通用的 eil51.tsp -Ant colony algorithm
aco1
- 蚁群算法在电缆敷设系统中的应用与在TSP中有所不同。TSP中所有节点必经过,形成闭合路径;而电缆敷设系统中只有起始设备和终端设备所在的节点是必须经过,中间路径有意选择。本文根据电厂电缆敷设的具体情况,对蚁群算法进行了相应修改,并应用于其中,得到了比较理想的结果。-Ant colony algorithm in cable laying system and in the TSP in different. After all nodes in the TSP will form a close
matlab
- 蚁群算法路径优化,MATLAB环境下的PATH 最短路径仿真代码。-MATLAB , PATH OPTIMIZATION,MAX
Route_AOC_two_Colony_based-on-VC6.0
- 本程序基于VC6.0实现双蚁群的路径规划算法,两蚁群的职责不尽相同-AOC with two partion based on VC6.0
aco
- 利用蚁群算法求解tsp(旅行商)问题,给出遍历方案,最后求出最短路径。-Ant colony algorithm for tsp (TSP) problem, given traversal solutions, and finally find the shortest path.
ACATSP
- 蚁群算法求最佳路径,特别用来路径优化很有用-Ant colony algorithm for the best path, particularly useful for route optimization
gaijinACATSP
- 该算法是改进蚁群算法,也是用来路径优化,但是收敛速度快-The algorithm is improved ant colony algorithm is used to route optimization, but the convergence speed
yiqun
- 蚁群算法求解最优路径,进行城市间最优路径的选择,用于解决tsp问题-Ant colony algorithm for optimal path
ANT
- 关于蚁群算法( 蚁群算法(ant colony optimization, ACO),又称蚂蚁算法,是一种用来在图中寻找优化 路径的机率型算法)的一些文章-Some articles on the ant colony algorithm
robot-path-planning
- 基于蚁群算法的机器人路径规划MATLAB源码-Ant colony algorithm based on MATLAB source code for robot path planning
ACO
- 基本蚁群算法,主要做的是最短路径,请大家修改后应用-Basic ant colony algorithm, the main job of the shortest path, let us apply the modified
dspceil
- 蚁群算法解决DSP问题31个城市最优化的问题的最短路径-ACA to solve the problem of DSP
ACOTSP
- 本程序用蚁群算法求解经典旅行商问题最优路径问题,效果很好-aco,tsp,best path
yiqunsuanfa
- 蚁群算法的源代码,蚁群算法又称蚂蚁算法,是一种用来在图中寻找优化路径的机率型算法。-Ant colony algorithm source code, algorithm, also known as ant colony algorithm is a method used to find the optimal path in the graph the probability-based algorithm.
ant-gateways
- 目前,物联网备受关注。在多网关无线传感网络与物联网的异构融合中,通过网关连接是最常用的策略。本程序利用基于蚁群优化的算法,寻找每个节点至网关的最优路径。-Recently, the Internet of Things is getting more and more attention.There are different approaches to integrate WSN into the Internet. The most usual one is to connect the W
ACO-dynamic-pathfinding-
- 蚁群算法动态寻路 蚂 蚁通过分泌信息素来加强较好路径上的信息素的强度, 同时按照路径上的信息素 强度来选择下一步的路径, 好的路径将会被越来越多的蚂蚁选择, 因此更多的信 息素将会覆盖较好的路径, 最终所有的蚂蚁都集中到了好的路径上. 蚂蚁的这种 基于信息素的正反馈原理正是整个算法的关键所在.-ACO dynamic pathfinding。 ants secrete pheromone enhanced by a better path pheromone strength, whil
ant
- 可以借鉴的基于蚁群算法的路径规划问题 代码-Can learn from the ant colony algorithm based path planning code
AntcolonyalgorithmforTSPproblem-
- 蚁群算法最短路径matlab程序,有详细说明-Ant colony algorithm for TSP problem matlab source code
matlab_ant_method
- 最短路径的蚁群算法,可以用于近似最优路径的解-ant calculate method of shortest road