搜索资源列表
001
- 蚁群算法(ant colony optimization, ACO),又称蚂蚁算法,是一种用来在图中寻找优化路径的机率型算法。-Ant colony algorithm (ant Colony optimization, ACO), also known as the ant algorithm is used to find the probability-based algorithm for optimal path in the graph.
VC
- 蚁群算法(ant colonyoptimization,ACO),又称蚂蚁算法,是一种用来在图中寻找优化路径的机率型技术。它由MarcoDorigo于1992年在他的博士论文中引入,其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。-Ant colony algorithm (ant colonyoptimization, ACO), also known as the ant algorithm is used to figure the probability of technology to
TSPPPSOPACOPHOPFIELD
- 分别用遗传算法 ,蚁群算法和hopfield算法实现的TSP算法,有界面,能把路径用不同颜色表示-TSP algorithm using genetic algorithm, ant colony algorithm and hopfield algorithm, interface, can path with different colors
The-maximum-minimum--
- 旅行商最短路径问题近似算法最大最小蚁群算法,使用vc2008版本-Maximum and minimum ant colony algorithm
ant-colony-optimization
- matlab编写的蚁群算法,即在图中寻找优化路径的机率型算法,结合遗传算法进行了改进。-ant colony algorithm matlab prepared in the graph to find the probability-based algorithm for optimal path, combined with genetic algorithm is improved.
VRP
- 该程序是用C++编写的蚁群算法程序,专门用来求解车辆路径问题(VRP)。-The program is in C++ ant colony algorithm written procedures, designed to solve the vehicle routing problem (VRP).
ant-solution
- 寻找最短路径的蚁群算法来源于蚂蚁寻食的行为.蚁群寻找食物时会派出一些蚂蚁分头在四周游荡, 如果一只蚂蚁找到食物, 它就返回巢中通知同伴并沿途留... -Ant colony algorithm for finding the shortest path from ant foraging behavior. Ant colony to find food, will send some of the ants separately wandering around an ant finds
VVRPe
- 车辆路径问题的蚁群算法VRPP-2opt-vrp -Ant colony algorithm for vehicle routing problem VRPP-2opt-vrp
ACASP
- 蚁群算法动态寻路算法 输入参数列表 G 地形图为01矩阵,如果为1表示障碍物 Tau 初始信息素矩阵(认为前面的觅食活动中有残留的信息素) K 迭代次数(指蚂蚁出动多少波) M 蚂蚁个数(每一波蚂蚁有多少个) S 起始点(最短路径的起始点) E 终止点(最短路径的目的点)-Ant colony algorithm for dynamic pathfinding algorithm input parameter list G topographic ma
antc
- 一个蚁群算法的例子,用于求解车辆路径问题-Examples of an ant colony algorithm for solving the vehicle routing problem
Ant-colony-algorithm-based-on-MATLAB
- 通过matlab仿真和验证蚁群算法在PCB板检测时路径的优化问题。附带蚁群算法代码以及仿真结果。-Through MATLAB simulation and validation of ant colony algorithm in PCB plate detection route optimization problem.thisfile include ant colony algorithm codes and simulation results.
ant
- 蚁群算法(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.
ant
- 蚁群算法的matlab实例源代码。基于蚁群算法的路径规划-Ant Colony Algorithm
123
- 基于AE的蚁群算法最短路径。C#-Shortest Path
tsp
- 使用Dijkstra进行初步路径规划,然后使用蚁群算法实现路径规划问题-Ant colony algorithm path planning problem
antinface
- 在基本蚁群算法基础上,进行优化改进,实现最短路径搜寻-Optimized to improve the basic ant colony algorithm based on shortest path search
tinyos-antbasic-algorithm
- tinyos 蚁群算法(ant colony optimization, ACO),又称蚂蚁算法,是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出,其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。蚁群算法是一种模拟进化算法,初步的研究表明该算法具有许多优良的性质.针对PID控制器参数优化设计问题,将蚁群算法设计的结果与遗传算法设计的结果进行了比较,数值仿真结果表明,蚁群算法具有一种新的模拟进化优化方法的有效性和应用价值-The tinyos
ACA_robot_path
- 基于蚁群算法的机器人路径规划matlab代码-Robot path planning based on ant colony algorithm matlab code
ACO_TSP
- 基于蚁群算法的TSP路径规划源程序,包含有一个中国国内省会城市及其他重点城市坐标的txt文件,规划对象即这些城市-Txt file, the TSP path planning based on ant colony algorithm source, contains a Chinese domestic capital cities and other major cities coordinates planning object that these cities
ant-colony-algorithm-
- 使用网格离散化的方法对带有障碍物的环境建模,使用邻接矩阵存储该环境,使得问题转化为蚁群算法寻找最短路径。-Using a grid discretization method modeling environment with obstacles, the environment, the adjacency matrix storage problem into the ant colony algorithm to find the shortest path.