当前位置：
首页 资源下载
搜索资源 - ant colony optimization path
搜索资源列表
-
1下载：
蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型技术。它由Marco Dorigo于1992年在他的博士论文中引入，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为-ant colony algorithm (ant colony optimization, ACO). also known as the ant algorithm is a map to find the optimal path of probabilit
-
-
0下载：
Ant Colony Optimization for Best Path Planning
-
-
0下载：
蚁群算法 却是一种源于自然现象的算法，即与具体问题关系不大的优化算法，也就是它是一种用来在图中寻找优化路径的机率型技术。-Ant colony algorithm Ant colony algorithm is a natural phenomenon due to the algorithm, that is, has little to do with the specific problem of the optimization algorithm, that is, it is a d
-
-
2下载：
在matlab环境中用蚁群算法寻优潜水器的三维路径，效果很好-In the matlab environment, using ant colony optimization algorithm for three-dimensional underwater vehicle path, good results
-
-
0下载：
用VB写的利用蚁群优化算法解决的20个点的TSP问题，给出了路径以及经过每个点的顺序。-Using VB to write the use of ant colony optimization algorithm to solve the 20 points of TSP problem, given the path and through each point order.
-
-
0下载：
C++ Implementation of Ant Colony Optimization Program.This uses a Cost matrix to Calculate the Shortest path from a number of Cities.
-
-
0下载：
目前，物联网备受关注。在多网关无线传感网络与物联网的异构融合中，通过网关连接是最常用的策略。本程序利用基于蚁群优化的算法，寻找每个节点至网关的最优路径。-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
-
-
0下载：
蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。 -ACO (ant colony optimization, ACO), also known as the ant algorithm is a method used to find the optimal path in the graph the probability-based algorithm.
-
-
0下载：
蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-ACO (ant colony optimization, ACO), also known as ant algorithm is a method used to find the optimal path in the graph the probability-based algorithm.
-
-
0下载：
matlab编写的蚁群算法，即在图中寻找优化路径的机率型算法，结合遗传算法进行了改进。-ant colony algorithm matlab prepared in the graph to find the probability-based algorithm for optimal path, combined with genetic algorithm is improved.
-
-
0下载：
蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-The ant colony algorithm (ant colony optimization, ACO), also known as ant algorithm the the probability type algorithm is a method for finding the optimal path in the graph.
-
-
0下载：
蚁群算法优化计算。多个路径中选择最优路径，来确定最优计算顺序-Ant colony optimization algorithm. Multiple paths, select the optimal path to determine the optimal calculation sequence
-
-
0下载：
TSP问题蚁群算法,是一种用来在图中寻找优化路径的机率型算法。-The TSP problem ant colony algorithm is used to find the probability of the optimal path algorithm in the figure.
-
-
0下载：
蚁群算法是经典的优化智能算法，能找到的最短路径。-The ant colony optimization algorithm is the classic intelligent algorithm can find the shortest path.
-
-
0下载：
基于蚁群算法的路径最优化分析程序，可求解几个城市之间的最优路径问题。-Path based on ant colony optimization analysis program can be solved in several cities between the optimal path problem.
-
-
0下载：
基于蚁群算法基本原理编写的matlab程序，寻找路径。优化的蚁群算法可以在它的基础上更改-Based on the basic principle of ant colony algorithm is written in matlab program, the search path.Optimization of the ant colony algorithm can be changed on the basis of it
-
-
1下载：
将改进的蚁群算法与路径几何优化相结合,用于解决移动机器人的全局路径规划问题.算法结合机器人的越障性能对移动机器人的环境空间进行建模.通过设置初始信息素加快蚂蚁的搜索速度,同时设置自适应信息素挥发机制,解决特定地图中初始信息素的干扰问题 设置自适应路径长度,筛选规划路径的优劣 提出由路径优劣程度决定的信息素散播策略,并从几何原理出发,对规划路径进行优化处理,加快最优解的收敛速度.仿真结果验证了该算法的有效性和普遍应用性,在随机给定的环境地图中,该算法能够迅速规划出最优路径.-The improve
-
-
1下载：
蚁群算法路径寻优，可以实现三维路径规划，可运行，得到最佳个体适应度变化趋势和寻路径过程。-Ant colony algorithm for route optimization, can achieve three-dimensional path planning, operations, get the best individual fitness trends and find the path process.
-
-
0下载：
改进传统蚁群算法，基于同一位置出发，考虑每一个城市地点之间的权重值，最终得出路径次优但是花费最少的路线-Improved traditional ant colony algorithm, based on the same starting position, considering the weight values for each location between the city and ultimately come to a suboptimal pat
-
-
0下载：
In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.
This algorithm is a member of the a
-
