搜索资源列表
1
- 使用蚁群算法解决TSP问题得出最佳的城市循环路径-An Approach for TSP problem based on Ant Colony Algorithms
ant-colony-optimization
- TSP问题蚁群算法,是一种用来在图中寻找优化路径的机率型算法。-The TSP problem ant colony algorithm is used to find the probability of the optimal path algorithm in the figure.
ant
- ant 蚁群算法,能模拟蚂蚁觅食最短路径-ant
ACATSP
- 蚁群算法函数实现,用于寻找最短路径 主要符号说明 C n个城市的坐标,n×2的矩阵 NC_max 最大迭代次数 m 蚂蚁个数 Alpha 表征信息素重要程度的参数 Beta 表征启发式因子重要程度的参数 Rho 信息素蒸发系数 Q 信息素增加强度系数 R_best 各代最佳路线 L_best 各代最佳路线的长度-Ant colony algorithm
An-ant-colony-algorithm-
- 这是一个基于蚁群算法路径的最优化方案,它使得工作效率大大提高-failed to translate
ant
- 蚁群算法解决二维路径规划算法,比传统算法更具有鲁棒性。-failed to translate
aco
- 蚁群算法的最优路径求解,很有用,可以下载看看哦。-Optimal routing, very useful, you can download Oh.
Ant-Colony-Algorithm-Based
- 提出一种基于启发式变异的蚁群算法,结合传统蚁群算法和遗传变异算法的优点,利用蚁群算法找到一条全局近优解,采用启发式变异进行路径优化,并将优化信息以信息素的方式传递给下一代,从而快速得到全局最优解-】This paper proposes an Ant Colony Algorithm based on Heuristic Mutation(ACAHM), combining with the advantage of the traditionalAnt Colony Algorithm(ACA
ACATSP3.m
- 基于蚁群算法的路径规划改进方法,适合各种机器人路径规划-Improved method for path planning based on ant colony algorithm, suitable for a variety of robot path planning
ant
- 蚁群算法是经典的优化智能算法,能找到的最短路径。-The ant colony optimization algorithm is the classic intelligent algorithm can find the shortest path.
ACO-for-MCM
- 蚁群算法用于MCM基板互连测试的单探针路径优化研究-Path optimization study of ant colony algorithm is used to the MCM substrate interconnect test probe
AntAlgorithm-
- 改进蚁群算法控制参数测试TSP问题,同时使用matlab引擎画出路径图和收敛曲线-Improved ant colony algorithm control parameters test TSP problem while using Matlab engine to draw the road map and the convergence curve
Ant-colony-algorithm-procedures
- 这是一个老师编写的程序,关于蚁群算法求解最短路径的-the program about the ant colony algorithm to solve the shortest path is written by a teacher
yiqun
- 文件中的程序是蚁群算法在最短路中的应用,稍加扩展即可应用于机器人路径规划。-File in is the procedure ant colony algorithm in most short-circuit the application of, a little expansion can be applied to robot path planning.
aco
- 一个简单的蚁群算法示例,实现tsp问题的路径选择。用了ant 和project两个类,实现简单-Ant Colony Algorithm
PSO
- 蚁群算法 用java语言编写的配送物品最优路径-Ant colony algorithm using java language Distribution optimal path items
Ant-Colony-Optimization-(ACO)
- 基于蚁群算法的路径最优化分析程序,可求解几个城市之间的最优路径问题。-Path based on ant colony optimization analysis program can be solved in several cities between the optimal path problem.
pso-for-shenjingwangluo
- 神经网络蚁群算法,主要可用于搜索最优路径 即求某一个函数的最值问题-Neural Networks ant colony algorithm, can mainly be used to search for the optimal path that is seeking a particular function' s value problems
dis
- matlab编写的用于二维的巡航路径规划问题,采用的蚁群算法-matlab prepared for the two-dimensional cruise path planning problem, the use of ant colony algorithm. .
ACO
- 基于蚁群算法的机器人的路径规划问题蚁群算法,一种与传统的数学规划原理截然不同的,模拟自然生态系统以求解复杂优化问题(如NPC(NP Complete)类问题,典型的有TSP(Traveling Saleman Problem)问题)的仿生优化算法,因其较强分布式计算机制、鲁棒性、易于与其他方法相结合等优点,使得蚁群算法具有较广泛应用领域,为那些最优化技术难以解决的组合优化问题提供了一类新的切实可行的解决方案。从最初的一维的静态优化问题扩展到多维的动态组合优化问题,包括车辆路径规划,工程设计,电力