搜索资源列表
tinyos-antbasic-algorithm
- tinyos 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。蚁群算法是一种模拟进化算法,初步的研究表明该算法具有许多优良的性质.针对PID控制器参数优化设计问题,将蚁群算法设计的结果与遗传算法设计的结果进行了比较,数值仿真结果表明,蚁群算法具有一种新的模拟进化优化方法的有效性和应用价值-The tinyos
ACO_Demo
- 这是一个模拟蚂蚁觅食过程的蚁群算法工程包，将此包导入到myeclipse后即可看到演示结果-This is a process of simulated ants foraging ant colony algorithm works package to import this package myeclipse can see the demo results ...
ant
- 蚁群算法，c++实现的 蚁周模型 调试已通过-Ant colony algorithm, c++ achieve ants week has passed debugging model
ACO-for-three-well-known-TSP-problem
- 该程序是以蚁群系统为模型写的蚁群算法程序(强调：非蚂蚁周模型)，以三个著名的TSP问题为测试对象。通过微调参数，都可以获得较好的解-The program is based on ant colony system algorithm for the model written procedures ( emphasis : Non- ants week model ) to three well-known TSP problem for the test object. By fine-tu
NewAntProject
- 该程序是以蚁群系统为模型写的蚁群算法程序(强调：非蚂蚁周模型)，以三个著名的TSP问题为测试对象 //通过微调参数，都可以获得较好的解-A New Ant Project: the program is based on ant colony system model of ant colony algorithm program (emphasize: the ants weeks model), with three famous TSP problem for the test obj
GACOTSP
- 广义蚁群算法在TSP问题中的实现，得出蚂蚁寻找到的最优路径和收敛过程。-Generalized ant colony algorithm in TSP problems, draw ants to find the optimal path and the convergence process.
ACS_Puzzle
- 使用蚁群算法拼图的程序 把很多个小的图片智能地拼到一个大的图片上，尽可能的减少空隙，节省图片利用率。使用蚁群算法，可设置蚂蚁数量和信息素浓度等参数。-Use ant colony algorithm puzzle program put a lot of small images intelligently fight to a big picture, as far as possible to reduce the gap and save pictures utilization. U
mayisuanfa
- 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为-Ant colony algorithm (ant colony optimization, ACO), also known as ant algorithm, is a probabilistic algorithm used to find optimal
AntColonyOptimization
- This source code is about the ant colony optimization.How ants are getting food the nest to food source with shortest path route. -This source code is about the ant colony optimization.How ants are getting food the nest to food source with shortest
AntColSource
- In all Ant Colony Optimization algorithms, each ant gets a start city. Beginning this city, the ant chooses the next city according to algorithm rules. After visiting all customer cities exactly once, the ant returns to the start city. The ants might
ACOR
- Ant Colony Optimization (ACO) is an optimization metaheuristic based on the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO heuristic for cont
AntColony
- 蚁群算法是一种模仿蚁群行为的仿生优化算法，其实现机理包括两个基本阶段：适应阶段和协作阶段。在适应阶段，各可行解根据积累的信息不断调整自身结构，路径上经过的蚂蚁越多，信息量越大，则该路径越容易被选择：时间越长，信息量越小。在协作阶段，各可行解之间通过信息交流，以期望产生性能更好的解。-Ant colony algorithm is a mimic ant colony behavior of bionic optimization algorithm, its implementation mec
AntColonyClustering
- 基于蚁群聚类的图像分割方法。把聚类中心看做食物源，蚂蚁根据分泌的信息素寻找图像边缘点。-Image segmentation method based on ant colony clustering. The cluster centers seen as a food source, ants secrete pheromones to find based on the image edge points.
antcolony
- This code is for solving traveling salesman problem using ant colony algorithm.Ant Colony Optimization (ACO) is a population-based approach for solving combinatorial optimization problems that is inspired by the foraging behavior of ants and thei
ACO-TSP
- Ant Colony Optimization Algorithm (ACO) and TSP ACO algorithm mimics the behavior of real life ants and on how they interact with each other. The basic philosophy of the algorithm involves the movement of a colony of ants through the different stat
antsolve
- 蚁群算法是对自然界蚂蚁的寻径方式进行模似而得出的 一种仿生算法。蚂蚁在运动过程中，能够在它所经过的路 径上留下一种称之为外激素(pheromone)的物质进行信息 传递，而且蚂蚁在运动过程中能够感知这种物质，并以此 指导自己的运动方向，因此由大量蚂蚁组成的蚁群集体行 为便表现出一种信息正反馈现象：某一路径上走过的蚂蚁 越多，则后来者选择该路径的概率就越大。在该算法中, 可行解经过多次迭代后, 最终将以最大的概率逼近问题的最 优解。 -Ant colony a
antsMatlab
- 虽然对蚁群算法的研究时间不长, 但是初步研究已显示出它在求解复杂优化问题方面具有很大的优势, 特别是1998 年在比利时布鲁塞尔专门召开了第一届蚂蚁-Although research on ant colony algorithm is not long, but preliminary studies have shown that it has a great advantage in solving complex optimization problems, in particular
edge_ACO
- 非常实用的基于蚁群算法的边缘检测程序。该算法提供基于蚁群算法的边缘检测方法，能够建立一个表示在图像中，每个像素位置的边缘信息提交的信息素矩阵调度在图像上移动的蚂蚁数目的运动。-Very practical edge detection algorithm based on ant colony program. The algorithm provides edge detection method based on ant colony algorithm, capable of establ
ACATSP
- 蚁群算法是一种分布式内在并行算法。单个蚂蚁的搜索过程是彼此独 立的，易于局部最优，通过个体间不断的信息交流和传递有利于发现较好解；并且该算法是一种正反馈算法。路径上的信息素浓度较高，将吸引更多的蚂蚁沿这条路径运动，又使得信息素浓度增加，加快了算法的进化过程。本文通过求解TSP问题，通过在特定情况下对路径进行逐步遍历比较来降低陷入局部最优解的可能性, 找出最优解。-Ant colony algorithm is an inherent distributed parallel algorithm.
Baseedgedetection
- Ant colony optimization is a nature inspired optimization algorithm, that is motivated by the natural foraging behavior of ant species. Ant deposit pheromone on the ground to mark paths between a food source and their colony, which should be followed