1,569
个编辑
更改
跳到导航
跳到搜索
小第1行：
第1行： − 此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。+ 第5行：
第5行： − + 第27行：
第27行： − + − 当一群蚂蚁面临选择通过两条不同的路径获取食物时，其中一条路径比另一条路径短得多，它们的选择完全是随机的。然而，那些使用较短的路线到达食物更快，因此往返于蚁丘和食物之间的频率更高。+ 第35行：
第35行： − 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. Artificial Ants stand for multi-agent methods inspired by the behavior of real ants. + − 在计算机科学和运筹学中，蚁群优化算法(ACO)是一种用于解决计算问题的概率技术，它可以简化为通过图寻找好的路径。人工蚂蚁代表受真蚂蚁行为启发的多智能体方法。+ − The pheromone-based communication of biological [[ant]]s is often the predominant paradigm used.<ref>{{cite book |last = Monmarché Nicolas, Guinand Frédéric and Siarry Patrick |title = Artificial Ants |publisher = Wiley-ISTE |year = 2010 |isbn = 978-1-84821-194-0}}</ref> Combinations of Artificial Ants and [[local search (optimization)|local search]] algorithms have become a method of choice for numerous optimization tasks involving some sort of [[Graph (discrete mathematics)|graph]], e.g., [[vehicle routing problem|vehicle routing]] and internet [[routing]]. The burgeoning activity in this field has led to conferences dedicated solely to Artificial Ants, and to numerous commercial applications by specialized companies such as [[AntOptima]].+ − The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of Artificial Ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing. The burgeoning activity in this field has led to conferences dedicated solely to Artificial Ants, and to numerous commercial applications by specialized companies such as AntOptima. − 基于信息素的生物蚂蚁通信往往是主要的范例使用。人工蚁群算法和局部搜索算法的结合已经成为许多优化任务的选择方法，这些优化任务涉及到一些图形，如车辆路径和互联网路由。这一领域蓬勃发展的活动导致了专门讨论人工蚂蚁的会议，以及诸如 AntOptima 等专业公司的大量商业应用。 + + − As an example, Ant colony optimization is a class of optimization algorithms modeled on the actions of an ant colony. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a parameter space representing all possible solutions. Real ants lay down pheromones directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions. One variation on this approach is the bees algorithm, which is more analogous to the foraging patterns of the honey bee, another social insect. − 以蚁群算法为例，提出了一类以蚁群行为为模型的优化算法。人造「蚂蚁」(例如:。模拟代理)通过移动一个代表所有可能解的参数空间来找到最优解。真正的蚂蚁在探索自己的环境时，会产生信息素，互相指引对方寻找资源。模拟的“蚂蚁”类似地记录它们的位置和解决方案的质量，这样在随后的模拟迭代中，更多的蚂蚁找到更好的解决方案。这种方法的一个变种是蜜蜂算法，它更类似于另一种社会昆虫---- 蜜蜂的觅食模式。 + + + + − This algorithm is a member of the '''ant colony algorithms''' family, in [[swarm intelligence]] methods, and it constitutes some [[metaheuristic]] optimizations. Initially proposed by [[Marco Dorigo]] in 1992 in his PhD thesis,<ref>A. Colorni, M. Dorigo et V. Maniezzo, ''Distributed Optimization by Ant Colonies'', actes de la première conférence européenne sur la vie artificielle, Paris, France, Elsevier Publishing, 134-142, 1991.</ref><ref name="M. Dorigo, Optimization, Learning and Natural Algorithms">M. Dorigo, ''Optimization, Learning and Natural Algorithms'', PhD thesis, Politecnico di Milano, Italy, 1992.</ref> the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of [[ants]] seeking a path between their [[ant colony|colony]] and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants. From a broader perspective, ACO performs a model-based search<ref>{{cite journal|last1=Zlochin|first1=Mark|last2=Birattari|first2=Mauro|last3=Meuleau|first3=Nicolas|last4=Dorigo|first4=Marco|title=Model-Based Search for Combinatorial Optimization: A Critical Survey|journal=Annals of Operations Research|date=1 October 2004|volume=131|issue=1–4|pages=373–395|doi=10.1023/B:ANOR.0000039526.52305.af|language=en|issn=0254-5330|citeseerx=10.1.1.3.427}}</ref> and shares some similarities with [[estimation of distribution algorithm]]s. − This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their colony and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants. From a broader perspective, ACO performs a model-based search and shares some similarities with estimation of distribution algorithms. − 这个算法是蚁群算法家族的一员，在群体智能方法中，它构成了一些元启发式优化。最初由 Marco Dorigo 在1992年他的博士论文中提出，第一个算法的目的是在图中寻找一条最佳路径，基于蚂蚁寻找它们的群体和食物来源之间的路径的行为。最初的想法已经多样化，以解决更广泛的数值问题，结果，出现了几个问题，借鉴了蚂蚁行为的各个方面。从更广泛的角度来看，蚁群算法实现了基于模型的搜索，并与分布估计算法具有一定的相似性。+ + + − ==Overview== + + + − In the natural world, ants of some species (initially) wander randomly, and upon finding food return to their colony while laying down pheromone trails. If other ants find such a path, they are likely not to keep travelling at random, but instead to follow the trail, returning and reinforcing it if they eventually find food (see Ant communication). − 在自然世界中，一些物种的蚂蚁(最初)随机徘徊，当发现食物回到它们的群落，同时产生信息素的踪迹。如果其他蚂蚁找到了这样一条路径，它们很可能不会继续随机行走，而是沿着这条路径前进，如果它们最终找到了食物，就会返回并加固这条路径(参见蚂蚁通讯)。 + + − Over time, however, the pheromone trail starts to evaporate, thus reducing its attractive strength. The more time it takes for an ant to travel down the path and back again, the more time the pheromones have to evaporate. A short path, by comparison, gets marched over more frequently, and thus the pheromone density becomes higher on shorter paths than longer ones. Pheromone evaporation also has the advantage of avoiding the convergence to a locally optimal solution. If there were no evaporation at all, the paths chosen by the first ants would tend to be excessively attractive to the following ones. In that case, the exploration of the solution space would be constrained. The influence of pheromone evaporation in real ant systems is unclear, but it is very important in artificial systems. − 然而，随着时间的推移，信息素的踪迹开始蒸发，从而减少了它的吸引力。蚂蚁沿着路径往返需要的时间越长，信息素蒸发的时间就越长。相比之下，短路径更频繁地穿越，因此短路径上的信息素密度比长路径上的高。信息素蒸发还具有避免收敛到局部最优解的优点。如果根本没有蒸发，那么第一批蚂蚁选择的路径对于后面的蚂蚁来说就会非常有吸引力。在这种情况下，对解空间的探索将受到限制。信息素蒸发对实际蚂蚁系统的影响尚不清楚，但在人工系统中具有重要意义。 + + − The overall result is that when one ant finds a good (i.e., short) path from the colony to a food source, other ants are more likely to follow that path, and positive feedback eventually leads to many ants following a single path. The idea of the ant colony algorithm is to mimic this behavior with "simulated ants" walking around the graph representing the problem to solve.+ − 总的结果是，当一只蚂蚁找到一条从蚁群到食物来源的好的(即短的)路径时，其他蚂蚁更有可能遵循这条路径，正反馈最终导致许多蚂蚁走同一条路径。蚁群算法的思想是通过“模拟蚂蚁”在代表要解决问题的图上走来模拟这种行为。+ + + + + − New concepts are required since “intelligence” is no longer centralized but can be found throughout all minuscule objects. Anthropocentric concepts have been known to lead to the production of IT systems in which data processing, control units and calculating forces are centralized. These centralized units have continually increased their performance and can be compared to the human brain. The model of the brain has become the ultimate vision of computers. Ambient networks of intelligent objects and, sooner or later, a new generation of information systems which are even more diffused and based on nanotechnology, will profoundly change this concept. Small devices that can be compared to insects do not dispose of a high intelligence on their own. Indeed, their intelligence can be classed as fairly limited. It is, for example, impossible to integrate a high performance calculator with the power to solve any kind of mathematical problem into a biochip that is implanted into the human body or integrated in an intelligent tag which is designed to trace commercial articles. However, once those objects are interconnected they dispose of a form of intelligence that can be compared to a colony of ants or bees. In the case of certain problems, this type of intelligence can be superior to the reasoning of a centralized system similar to the brain.+ − 需要新的概念，因为“智能”不再是集中的，而是可以在所有微小的物体中找到。以人为中心的概念已经被认识到导致 IT 系统的生产，其中数据处理，控制单元和计算力量是集中的。这些集中的单位不断地提高他们的表现，可以与人类的大脑相比较。大脑模型已经成为计算机的终极愿景。由智能物体构成的环境网络，以及基于纳米技术的新一代信息系统，迟早会深刻地改变这一概念。可以与昆虫相比较的小型设备本身并不具备高智能。事实上，他们的智力可以归类为相当有限。例如，不可能将一个有能力解决任何数学问题的高性能计算器集成到植入人体的生物芯片中，或者集成到一个用于跟踪商业文章的智能标签中。然而，一旦这些物体互相连接起来，它们就拥有了一种可以与一群蚂蚁或蜜蜂相提并论的智慧。在某些问题的情况下，这种类型的智能可能优于类似于大脑的集中式系统的推理。+ + + + + − Nature offers several examples of how minuscule organisms, if they all follow the same basic rule, can create a form of collective intelligence on the macroscopic level. Colonies of social insects perfectly illustrate this model which greatly differs from human societies. This model is based on the co-operation of independent units with simple and unpredictable behavior. They move through their surrounding area to carry out certain tasks and only possess a very limited amount of information to do so. A colony of ants, for example, represents numerous qualities that can also be applied to a network of ambient objects. Colonies of ants have a very high capacity to adapt themselves to changes in the environment as well as an enormous strength in dealing with situations where one individual fails to carry out a given task. This kind of flexibility would also be very useful for mobile networks of objects which are perpetually developing. Parcels of information that move from a computer to a digital object behave in the same way as ants would do. They move through the network and pass from one knot to the next with the objective of arriving at their final destination as quickly as possible.+ − 大自然提供了几个例子，说明如果微小的生物体都遵循相同的基本规则，它们是如何在宏观层面上创造出一种集体智慧的。社会性昆虫的群落完美地说明了这个模型，它与人类社会有很大的不同。该模型基于具有简单和不可预测行为的独立单元之间的合作。他们穿过周围地区执行某些任务，但只掌握非常有限的信息。例如，一群蚂蚁代表了许多特性，这些特性也可以应用到环境对象网络中。蚂蚁群体具有非常高的适应环境变化的能力，并且在处理个人未能完成某项任务的情况方面具有巨大的力量。这种灵活性对于不断发展的移动对象网络也是非常有用的。从计算机到数字物体的信息包和蚂蚁的行为一样。它们穿过网络，从一个节点传到下一个节点，目的是尽快到达最终目的地。+ + + + + − Pheromone-based communication is one of the most effective ways of communication which is widely observed in nature. Pheromone is used by social insects such as+ − 基于信息素的通信是自然界中普遍存在的最有效的通信方式之一。信息素是用于社会昆虫，如+ − bees, ants and termites; both for inter-agent and agent-swarm communications. Due to its feasibility, artificial pheromones have been adopted in multi-robot and swarm robotic systems. Pheromone-based communication was implemented by different means such as chemical or physical (RFID tags, light, sound) ways. However, those implementations were not able to replicate all the aspects of pheromones as seen in nature.+ − 蜜蜂、蚂蚁和白蚁; 都用于内部代理和代理群通信。由于其可行性，人工信息素已被应用于多机器人和群机器人系统中。基于信息素的通信是通过化学或物理(RFID 标签、光、声)等不同方式实现的。然而，这些实现不能复制信息素的所有方面。+ + + + + − Using projected light was presented in an 2007 IEEE paper by Garnier, Simon, et al. as an experimental setup to study pheromone-based communication with micro autonomous robots. Another study that proposed a novel pheromone communication method, COSΦ, for a swarm robotic system is based on precise and fast visual localization. + − 在2007年 IEEE 的一篇论文中，Garnier，Simon 等人提出了使用投射光。作为研究信息素与微型自主机器人通信的实验装置。另一项研究提出了一种新的信息素通信方法，cos，为一个群机器人系统是基于精确和快速的视觉定位。+ − The system allows simulation of a virtually unlimited number of different pheromones and provides the result of their interaction as a gray-scale image on a horizontal LCD screen that the robots move on. In order to demonstrate the pheromone communication method, Colias autonomous micro robot was deployed as the swarm robotic platform.+ + + − 该系统可以模拟几乎无限数量的不同信息素，并在机器人移动的水平 LCD 屏幕上以灰度图像的形式提供它们相互作用的结果。为了演示信息素通信方法，以大肠杆菌自主微型机器人为群体机器人平台。 + + + + + + + − In the ant colony optimization algorithms, an artificial ant is a simple computational agent that searches for good solutions to a given optimization problem. To apply an ant colony algorithm, the optimization problem needs to be converted into the problem of finding the shortest path on a weighted graph. In the first step of each iteration, each ant stochastically constructs a solution, i.e. the order in which the edges in the graph should be followed. In the second step, the paths found by the different ants are compared. The last step consists of updating the pheromone levels on each edge.+ − 在蚁群算法中，人工蚂蚁是一种简单的计算代理，可以为给定的最佳化问题寻找好的解决方案。为了应用蚁群算法，需要将最佳化问题问题转化为在加权图上寻找最短路径的问题。在每个迭代的第一步，每个随机构造一个解，即。图中的边应该遵循的顺序。在第二步中，比较了不同蚂蚁发现的路径。最后一步是更新每个边上的信息素水平。+ + + + + − procedure ACO_MetaHeuristic is+ − 过程 ACO 元启发式是+ − while not_termination do+ − − 而不是终止 − generateSolutions()+ − − 概要解答() − daemonActions()+ − Daemonactions ()+ − − pheromoneUpdate() − − 信息素更新() − repeat+ − 重复+ − end procedure − 结束过程 + + − ===Edge selection===+ − − Each ant needs to construct a solution to move through the graph. To select the next edge in its tour, an ant will consider the length of each edge available from its current position, as well as the corresponding pheromone level. At each step of the algorithm, each ant moves from a state <math>x</math> to state <math>y</math>, corresponding to a more complete intermediate solution. Thus, each ant <math>k</math> computes a set <math>A_k(x)</math> of feasible expansions to its current state in each iteration, and moves to one of these in probability. For ant <math>k</math>, the probability <math>p_{xy}^k</math> of moving from state <math>x</math> to state <math>y</math> depends on the combination of two values, the attractiveness <math>\eta_{xy}</math> of the move, as computed by some heuristic indicating the a priori desirability of that move and the trail level <math>\tau_{xy}</math> of the move, indicating how proficient it has been in the past to make that particular move. The trail level represents a posteriori indication of the desirability of that move. − − 每只蚂蚁都需要构造一个解来在图中移动。为了在它的旅行中选择下一条边，蚂蚁会考虑每条边从它当前位置可以获得的长度，以及相应的信息素水平。在算法的每个步骤中，每个蚂蚁从状态数学 x / math 移动到状态数学 y / math，对应于一个更完整的中间解。因此，每个蚂蚁数学 k / math 计算一个集合数学 a k (x) / 可行展开式的数学到它在每次迭代中的当前状态，并移动到其中一个概率上。对于蚂蚁数学 k / math 来说，从状态数学 x / math 到状态数学 y / math 的概率数学 p { xy } ^ k / math 取决于两个值的组合，即移动的吸引力数学 eta / math，正如某些启发式算法所计算的那样，表明移动的先验渴望和移动的拖尾级数学 tau，表明过去它在移动这一特定动作方面有多么精通。试验水平代表了一个后验指示的愿望，这一举动。 − − In general, the <math>k</math>th ant moves from state <math>x</math> to state <math>y</math> with probability − − 一般来说，蚂蚁的数学 k / math 从状态数学 x / math 移动到状态数学 y / math 和概率 − − <math> − − 数学 − − p_{xy}^k = − − P { xy } ^ k − − \frac − − 压裂 − − { (\tau_{xy}^{\alpha}) (\eta_{xy}^{\beta}) } − − {( tau { xy } ^ { alpha })( eta { xy } ^ { beta })} − − { \sum_{z\in \mathrm{allowed}_x} (\tau_{xz}^{\alpha}) (\eta_{xz}^{\beta}) } − − ( tau { xz } ^ alpha }( eta { xz } ^ beta }) − − </math> − − 数学 − − where − − 在哪里 − − <math>\tau_{xy}</math> is the amount of pheromone deposited for transition from state <math>x</math> to <math>y</math>, 0 ≤ <math>\alpha</math> is a parameter to control the influence of <math>\tau_{xy}</math>, <math>\eta_{xy}</math> is the desirability of state transition <math>xy</math> (a priori knowledge, typically <math>1/d_{xy}</math>, where <math>d</math> is the distance) and <math>\beta</math> ≥ 1 is a parameter to control the influence of <math>\eta_{xy}</math>. <math>\tau_{xz}</math> and <math>\eta_{xz}</math> represent the trail level and attractiveness for the other possible state transitions. − − Math 是从状态数学 x / math 到数学 y / math 的信息素沉积量，0≤ math alpha / math 是控制数学 tau / math 影响的参数, math 是状态转换数学 xy / math (先验知识，通常是数学1 / d { xy } / math，其中数学 d / math 是距离)的可取性，math beta / math ≥1是控制数学影响的参数。Math 和 math 表示其他可能状态转换的轨迹级别和吸引力。 第270行：
第254行： − − Trails are usually updated when all ants have completed their solution, increasing or decreasing the level of trails corresponding to moves that were part of "good" or "bad" solutions, respectively. An example of a global pheromone updating rule is − − 当所有的蚂蚁都完成了他们的解决方案，路径通常更新，增加或减少路径的水平对应的移动，是“好”或“坏”的解决方案的一部分，分别。全局信息素更新规则的一个例子是 − − <math> − − 数学 − − \tau_{xy} \leftarrow − − 左塔罗 − − (1-\rho)\tau_{xy} + \sum_{k}\Delta \tau^{k}_{xy} − − (1- rho) tau { xy } + sum { k } Delta tau ^ { k } − − </math> − − 数学 − − where <math>\tau_{xy}</math> is the amount of pheromone deposited for a state transition <math>xy</math>, <math>\rho</math> is the pheromone evaporation coefficient and <math>\Delta \tau^{k}_{xy}</math> is the amount of pheromone deposited by <math>k</math>th ant, typically given for a TSP problem (with moves corresponding to arcs of the graph) by − − 其中 math 是状态转换数学 xy / math 的信息素沉积量，math 是信息素蒸发系数，math 是 Delta tau ^ xy / math 是数学 k / math 蚂蚁沉积的信息素沉积量，通常用于 TSP 问题(与图的弧线相对应) − − <math> − − 数学 − − \Delta \tau^{k}_{xy} = − − Delta tau ^ { k } − − \begin{cases} − − Begin { cases } − − Q/L_k & \mbox{if ant }k\mbox{ uses curve }xy\mbox{ in its tour} \\ − − Q / l k & mbox { if ant } k mbox {在其行程中使用曲线} xy mbox { − − 0 & \mbox{otherwise} − − 0 & mbox { otherwise } − − \end{cases} − − End { cases } − − </math> − − 数学 − − where <math>L_k</math> is the cost of the <math>k</math>th ant's tour (typically length) and <math>Q</math> is a constant. − − 其中数学 l k / math 是蚂蚁旅行的数学 k / math 的成本(通常是长度) ，数学 q / math 是一个常数。 第366行：
第294行： − − Here are some of the most popular variations of ACO algorithms. − − 下面是一些最流行的 ACO 算法变体。 第376行：
第300行： − − The Ant System is the first ACO algorithm. This algorithm corresponds to the one presented above. It was developed by Dorigo. − − 蚁群算法是第一种蚁群算法。此算法与上述算法相对应。它是由 Dorigo 开发的。 第387行：
第307行： − In the Ant Colony System algorithm, the original Ant System was modified in three aspects: (i) the edge selection is biased towards exploitation (i.e. favoring the probability of selecting the shortest edges with a large amount of pheromone); (ii) while building a solution, ants change the pheromone level of the edges they are selecting by applying a local pheromone updating rule; (iii) at the end of each iteration, only the best ant is allowed to update the trails by applying a modified global pheromone updating rule. − − 在蚁群算法中，对原有的蚁群算法进行了三方面的改进: (i)边缘选择偏向于挖掘(即边缘选择偏向于挖掘边缘)。在求解过程中，蚂蚁通过应用局部信息素更新规则来改变所选边缘的信息素水平; 在每次迭代结束时，只允许最优的蚂蚁通过应用一个改进的全局信息素更新规则来更新路径。 − − − − ===Elitist Ant System=== − − In this algorithm, the global best solution deposits pheromone on its trail after every iteration (even if this trial has not been revisited), along with all the other ants. − − In this algorithm, the global best solution deposits pheromone on its trail after every iteration (even if this trial has not been revisited), along with all the other ants. − − 在这种算法中，全局最优解在每次迭代之后(即使这次试验没有被重新审视)和其他所有蚂蚁一起将信息素存放在它的轨迹上。 − − − − ===Max-Min Ant System (MMAS)=== − − This algorithm controls the maximum and minimum pheromone amounts on each trail. Only the global best tour or the iteration best tour are allowed to add pheromone to its trail. To avoid stagnation of the search algorithm, the range of possible pheromone amounts on each trail is limited to an interval [τ<sub>max</sub>,τ<sub>min</sub>]. All edges are initialized to τ<sub>max</sub> to force a higher exploration of solutions. The trails are reinitialized to τ<sub>max</sub> when nearing stagnation.<ref name="T. Stützle et H.H. Hoos">T. Stützle et H.H. Hoos, ''MAX MIN Ant System'', Future Generation Computer Systems, volume 16, pages 889-914, 2000</ref> − − This algorithm controls the maximum and minimum pheromone amounts on each trail. Only the global best tour or the iteration best tour are allowed to add pheromone to its trail. To avoid stagnation of the search algorithm, the range of possible pheromone amounts on each trail is limited to an interval [τ<sub>max</sub>,τ<sub>min</sub>]. All edges are initialized to τ<sub>max</sub> to force a higher exploration of solutions. The trails are reinitialized to τ<sub>max</sub> when nearing stagnation. − − 该算法控制每条路线上信息素的最大值和最小值。只有全局最优旅行或迭代最优旅行才允许在其轨迹中添加信息素。为了避免搜索算法的停滞，每条路径上可能的信息素数量范围被限制在一个区间[次最大 / 次，次最小 / 次]。所有边都被初始化为子 max / sub，以强制进行更高层次的解决方案探索。当接近停滞状态时，轨迹被重新初始化为次最大 / 次。 − − − − ===Rank-based Ant System (ASrank)=== − − All solutions are ranked according to their length. Only a fixed number of the best ants in this iteration are allowed to update their trials. The amount of pheromone deposited is weighted for each solution, such that solutions with shorter paths deposit more pheromone than the solutions with longer paths. − − All solutions are ranked according to their length. Only a fixed number of the best ants in this iteration are allowed to update their trials. The amount of pheromone deposited is weighted for each solution, such that solutions with shorter paths deposit more pheromone than the solutions with longer paths. − − 所有的解决方案都是根据它们的长度来排序的。在这个迭代中，只有一定数量的最优秀的蚂蚁被允许更新它们的试验。信息素沉积量的权重每个解决方案，使解决方案更短的路径比解决方案更多的信息素沉积长路径。 − − − − ===Continuous Orthogonal Ant Colony (COAC)=== − − The pheromone deposit mechanism of COAC is to enable ants to search for solutions collaboratively and effectively. By using an orthogonal design method, ants in the feasible domain can explore their chosen regions rapidly and efficiently, with enhanced global search capability and accuracy. The orthogonal design method and the adaptive radius adjustment method can also be extended to other optimization algorithms for delivering wider advantages in solving practical problems.<ref>[http://eprints.gla.ac.uk/3894/ X Hu, J Zhang, and Y Li (2008). Orthogonal methods based ant colony search for solving continuous optimization problems. ''Journal of Computer Science and Technology'', 23(1), pp.2-18.]</ref> − − The pheromone deposit mechanism of COAC is to enable ants to search for solutions collaboratively and effectively. By using an orthogonal design method, ants in the feasible domain can explore their chosen regions rapidly and efficiently, with enhanced global search capability and accuracy. The orthogonal design method and the adaptive radius adjustment method can also be extended to other optimization algorithms for delivering wider advantages in solving practical problems. − − Coac 的信息素存储机制是使蚂蚁能够协同有效地寻找解决方案。利用正交设计方法，可行域中的蚂蚁可以快速有效地搜索所选区域，提高了全局搜索能力和准确性。正交设计法和自适应半径调整法也可以推广到其他优化算法中，在解决实际问题时具有更广泛的优势。 − − − − ===Recursive Ant Colony Optimization=== − − It is a recursive form of ant system which divides the whole search domain into several sub-domains and solves the objective on these subdomains.<ref>Gupta, D.K.; Arora, Y.; Singh, U.K.; Gupta, J.P., "Recursive Ant Colony Optimization for estimation of parameters of a function," Recent Advances in Information Technology (RAIT), 2012 1st International Conference on , vol., no., pp.448-454, 15–17 March 2012</ref> The results from all the subdomains are compared and the best few of them are promoted for the next level. The subdomains corresponding to the selected results are further subdivided and the process is repeated until an output of desired precision is obtained. This method has been tested on ill-posed geophysical inversion problems and works well.<ref>Gupta, D.K.; Gupta, J.P.; Arora, Y.; Shankar, U., "[http://nsg.eage.org/publication/download/?publication=68286 Recursive ant colony optimization: a new technique for the estimation of function parameters from geophysical field data]," Near Surface Geophysics , vol. 11, no. 3, pp.325-339</ref> − − It is a recursive form of ant system which divides the whole search domain into several sub-domains and solves the objective on these subdomains. The results from all the subdomains are compared and the best few of them are promoted for the next level. The subdomains corresponding to the selected results are further subdivided and the process is repeated until an output of desired precision is obtained. This method has been tested on ill-posed geophysical inversion problems and works well. − − 它是蚂蚁系统的一种递归形式，将整个搜索域划分为若干子域，并在这些子域上求解目标。对所有子域的结果进行比较，并将其中最好的几个子域提升到下一个级别。与所选结果相对应的子区域被进一步细分，并重复这一过程，直到获得所需精度的输出。该方法已在不适定地球物理反演问题中得到验证，效果良好。 − − − − ==Convergence== − − For some versions of the algorithm, it is possible to prove that it is convergent (i.e., it is able to find the global optimum in finite time). The first evidence of convergence for an ant colony algorithm was made in 2000, the graph-based ant system algorithm, and later on for the ACS and MMAS algorithms. Like most [[metaheuristic]]s, it is very difficult to estimate the theoretical speed of convergence. A performance analysis of a continuous ant colony algorithm with respect to its various parameters (edge selection strategy, distance measure metric, and pheromone evaporation rate) showed that its performance and rate of convergence are sensitive to the chosen parameter values, and especially to the value of the pheromone evaporation rate.<ref>V.K.Ojha, A. Abraham and V. Snasel, [https://arxiv.org/pdf/1707.01812 ACO for Continuous Function Optimization: A Performance Analysis], 14th International Conference on Intelligent Systems Design and Applications (ISDA), Japan, Page 145 - 150, 2017, 978-1-4799-7938-7/14 2014 IEEE.</ref> In 2004, Zlochin and his colleagues<ref name="Zlochin model-based search">M. Zlochin, M. Birattari, N. Meuleau, et M. Dorigo, ''Model-based search for combinatorial optimization: A critical survey'', Annals of Operations Research, vol. 131, pp. 373-395, 2004.</ref> showed that COAC-type algorithms could be assimilated methods of [[stochastic gradient descent]], on the [[cross-entropy]] and [[estimation of distribution algorithm]]. They proposed these [[metaheuristic]]s as a "[[research-based model]]". − − For some versions of the algorithm, it is possible to prove that it is convergent (i.e., it is able to find the global optimum in finite time). The first evidence of convergence for an ant colony algorithm was made in 2000, the graph-based ant system algorithm, and later on for the ACS and MMAS algorithms. Like most metaheuristics, it is very difficult to estimate the theoretical speed of convergence. A performance analysis of a continuous ant colony algorithm with respect to its various parameters (edge selection strategy, distance measure metric, and pheromone evaporation rate) showed that its performance and rate of convergence are sensitive to the chosen parameter values, and especially to the value of the pheromone evaporation rate. In 2004, Zlochin and his colleagues showed that COAC-type algorithms could be assimilated methods of stochastic gradient descent, on the cross-entropy and estimation of distribution algorithm. They proposed these metaheuristics as a "research-based model". − − 对于某些版本的算法，可以证明它是收敛的(也就是说，它能在有限时间内找到全局最优解)。蚁群算法的收敛性在2000年首次得到证实，基于图的蚂蚁系统算法，以及后来的 ACS 和 MMAS 算法。和大多数启发式算法一样，很难估计理论上的收敛速度。通过对连续蚁群算法各参数(边缘选择策略、距离测度和信息素蒸发速率)的性能分析表明，蚁群算法的性能和收敛速度对参数选择，特别是信息素蒸发速率的选择非常敏感。在2004年，Zlochin 和他的同事们展示了 coac 类型的算法可以同化随机梯度下降的方法，比如交叉熵和分布估计算法。他们提出这些元启发式作为一个“基于研究的模型”。 − − − − ==Applications== − − [[File:Knapsack ants.svg|thumb|[[Knapsack problem]]: The ants prefer the smaller drop of honey over the more abundant, but less nutritious, sugar]] − − [[Knapsack problem: The ants prefer the smaller drop of honey over the more abundant, but less nutritious, sugar]] − − [背包问题: 相对于数量更多但营养更少的糖，蚂蚁更喜欢小滴的蜂蜜] − − Ant colony optimization algorithms have been applied to many [[combinatorial optimization]] problems, ranging from quadratic assignment to [[protein]] folding or [[Vehicle routing problem|routing vehicles]] and a lot of derived methods have been adapted to dynamic problems in real variables, stochastic problems, multi-targets and [[parallel computing|parallel]] implementations. − − Ant colony optimization algorithms have been applied to many combinatorial optimization problems, ranging from quadratic assignment to protein folding or routing vehicles and a lot of derived methods have been adapted to dynamic problems in real variables, stochastic problems, multi-targets and parallel implementations. − − 蚁群算法已经应用于许多组合优化问题，从二次赋值到蛋白质折叠或路径选择车辆，许多派生方法已经适用于实际变量、随机问题、多目标和并行实现的动态问题。 − − It has also been used to produce near-optimal solutions to the [[travelling salesman problem]]. They have an advantage over [[simulated annealing]] and [[genetic algorithm]] approaches of similar problems when the graph may change dynamically; the ant colony algorithm can be run continuously and adapt to changes in real time. This is of interest in [[network routing]] and urban transportation systems. − − It has also been used to produce near-optimal solutions to the travelling salesman problem. They have an advantage over simulated annealing and genetic algorithm approaches of similar problems when the graph may change dynamically; the ant colony algorithm can be run continuously and adapt to changes in real time. This is of interest in network routing and urban transportation systems. − − 它也被用来产生接近最佳的解决方案的旅行推销员问题。当图形可能发生动态变化时，它们比模拟退火算法和遗传算法具有优势; 蚁群算法可以连续运行并实时适应变化。这是在网络路由和城市交通系统的兴趣。 − − − − The first ACO algorithm was called the ant system<ref name="Ant system">M. Dorigo, V. Maniezzo, et A. Colorni, ''[http://www.cs.unibo.it/babaoglu/courses/cas05-06/tutorials/Ant_Colony_Optimization.pdf Ant system: optimization by a colony of cooperating agents]'', IEEE Transactions on Systems, Man, and Cybernetics--Part B , volume 26, numéro 1, pages 29-41, 1996.</ref> and it was aimed to solve the travelling salesman problem, in which the goal is to find the shortest round-trip to link a series of cities. The general algorithm is relatively simple and based on a set of ants, each making one of the possible round-trips along the cities. At each stage, the ant chooses to move from one city to another according to some rules: − − The first ACO algorithm was called the ant system and it was aimed to solve the travelling salesman problem, in which the goal is to find the shortest round-trip to link a series of cities. The general algorithm is relatively simple and based on a set of ants, each making one of the possible round-trips along the cities. At each stage, the ant chooses to move from one city to another according to some rules: − − 第一个蚁群算法被称为蚂蚁系统，它的目标是解决旅行推销员问题，其中的目标是找到最短的往返连接一系列城市。一般的算法相对简单，基于一组蚂蚁，每个蚂蚁沿着城市进行一次可能的往返旅行。在每个阶段，蚂蚁都会根据一些规则从一个城市迁移到另一个城市: − − # It must visit each city exactly once; − − It must visit each city exactly once; − − 它必须每个城市只参观一次; − − # A distant city has less chance of being chosen (the visibility); − − A distant city has less chance of being chosen (the visibility); − − 一个遥远的城市被选中的可能性较小(能见度) ; − − # The more intense the pheromone trail laid out on an edge between two cities, the greater the probability that that edge will be chosen; − − The more intense the pheromone trail laid out on an edge between two cities, the greater the probability that that edge will be chosen; − − 在两个城市之间的边缘布置的信息素踪迹越强烈，选择这条边缘的概率就越大; − − # Having completed its journey, the ant deposits more pheromones on all edges it traversed, if the journey is short; − − Having completed its journey, the ant deposits more pheromones on all edges it traversed, if the journey is short; − − 旅程结束后，如果旅程很短，蚂蚁会在所经过的所有边缘释放更多的信息素; − − # After each iteration, trails of pheromones evaporate. − − After each iteration, trails of pheromones evaporate. − − 每次迭代后，信息素的踪迹蒸发。 − − − − [[File:Aco TSP.svg|thumb|600px|center]] − − center − − 中心 − − − − ===Scheduling problem=== − − *[[Sequential Ordering Problem]] (SOP) <ref> L.M. Gambardella, M. Dorigo, "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem", INFORMS Journal on Computing, vol.12(3), pp. 237-255, 2000.</ref> − − *[[Job-shop scheduling]] problem (JSP)<ref>D. Martens, M. De Backer, R. Haesen, J. Vanthienen, M. Snoeck, B. Baesens, ''[https://ieeexplore.ieee.org/abstract/document/4336122/ Classification with Ant Colony Optimization]'', IEEE Transactions on Evolutionary Computation, volume 11, number 5, pages 651—665, 2007. − − </ref> − − </ref> − − / 参考 − − *[[Open-shop scheduling]] problem (OSP)<ref>B. Pfahring, "Multi-agent search for open scheduling: adapting the Ant-Q formalism," Technical report TR-96-09, 1996.</ref><ref>C. Blem, "[http://lia.disi.unibo.it/Courses/SistInt/articoli/beam-aco.pdf Beam-ACO, Hybridizing ant colony optimization with beam search. An application to open shop scheduling]," Technical report TR/IRIDIA/2003-17, 2003.</ref> − − *Permutation flow shop problem (PFSP)<ref>T. Stützle, "An ant approach to the flow shop problem," Technical report AIDA-97-07, 1997.</ref> − − *Single machine total tardiness problem (SMTTP)<ref>A. Bauer, B. Bullnheimer, R. F. Hartl and C. Strauss, "Minimizing total tardiness on a single machine using ant colony optimization," Central European Journal for Operations Research and Economics, vol.8, no.2, pp.125-141, 2000.</ref> − − *Single machine total weighted tardiness problem (SMTWTP)<ref>M. den Besten, "Ants for the single machine total weighted tardiness problem," Master's thesis, University of Amsterdam, 2000.</ref><ref>M, den Bseten, T. Stützle and M. Dorigo, "Ant colony optimization for the total weighted tardiness problem," Proceedings of PPSN-VI, Sixth International Conference on Parallel Problem Solving from Nature, vol. 1917 of [[Lecture Notes in Computer Science]], pp.611-620, 2000.</ref><ref>D. Merkle and M. Middendorf, "[http://www.ccas.ru/orsot/library/An%20Ant%20Algorithm%20with%20a%20New%20Pheromone%20Evaluation%20Rule%20for%20Total%20Tardiness%20Problems.pdf An ant algorithm with a new pheromone evaluation rule for total tardiness problems]," Real World Applications of Evolutionary Computing, vol. 1803 of Lecture Notes in Computer Science, pp.287-296, 2000.</ref> − − *Resource-constrained project scheduling problem (RCPSP)<ref>D. Merkle, M. Middendorf and H. Schmeck, "Ant colony optimization for resource-constrained project scheduling," Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), pp.893-900, 2000.</ref> − − *Group-shop scheduling problem (GSP)<ref>C. Blum, "[ftp://nozdr.ru/biblio/kolxo3/Cs/CsLn/Ant%20Algorithms,%203%20conf.,%20ANTS%202002(LNCS2463,%20Springer,%202002)(ISBN%203540441468)(318s).pdf#page=28 ACO applied to group shop scheduling: a case study on intensification and diversification]," Proceedings of ANTS 2002, vol. 2463 of Lecture Notes in Computer Science, pp.14-27, 2002.</ref> − − *Single-machine total tardiness problem with sequence dependent setup times (SMTTPDST)<ref>C. Gagné, W. L. Price and M. Gravel, "[https://link.springer.com/article/10.1057/palgrave.jors.2601390 Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times]," Journal of the Operational Research Society, vol.53, pp.895-906, 2002.</ref> − − *Multistage flowshop scheduling problem (MFSP) with sequence dependent setup/changeover times<ref>A. V. Donati, V. Darley, B. Ramachandran, "An Ant-Bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions", book chapter in Advances in Metaheuristics for Hard Optimization, Springer, {{ISBN|978-3-540-72959-4}}, pp.111-138, 2008.</ref> − − − − ===Vehicle routing problem=== − − *Capacitated vehicle routing problem (CVRP)<ref>{{Cite journal |doi = 10.1016/S0166-218X(01)00351-1|title = Models, relaxations and exact approaches for the capacitated vehicle routing problem|journal = Discrete Applied Mathematics|volume = 123|issue = 1–3|pages = 487–512|year = 2002|last1 = Toth|first1 = Paolo|last2 = Vigo|first2 = Daniele}}</ref><ref>J. M. Belenguer, and E. Benavent, "A cutting plane algorithm for capacitated arc routing problem," Computers & Operations Research, vol.30, no.5, pp.705-728, 2003.</ref><ref>T. K. Ralphs, "Parallel branch and cut for capacitated vehicle routing," Parallel Computing, vol.29, pp.607-629, 2003.</ref> − − *Multi-depot vehicle routing problem (MDVRP)<ref>{{Cite journal |doi = 10.1016/S0377-2217(96)00253-6|title = A multi-level composite heuristic for the multi-depot vehicle fleet mix problem|journal = European Journal of Operational Research|volume = 103|pages = 95–112|year = 1997|last1 = Salhi|first1 = S.|last2 = Sari|first2 = M.}}</ref> − − *Period vehicle routing problem (PVRP)<ref>{{Cite journal |doi = 10.1016/S0377-2217(01)00206-5|title = The periodic vehicle routing problem with intermediate facilities|journal = European Journal of Operational Research|volume = 137|issue = 2|pages = 233–247|year = 2002|last1 = Angelelli|first1 = Enrico|last2 = Speranza|first2 = Maria Grazia|author2-link= M. Grazia Speranza}}</ref> − − *Split delivery vehicle routing problem (SDVRP)<ref>{{Cite journal |citeseerx = 10.1.1.8.7096|title = A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries|journal = Computers and Operations Research|volume = 31|issue = 12|pages = 1947–1964|year = 2002|last1 = Ho|first1 = Sin C.|last2 = Haugland|first2 = Dag|doi = 10.1016/S0305-0548(03)00155-2}}</ref> − − *Stochastic vehicle routing problem (SVRP)<ref>{{Cite journal |citeseerx = 10.1.1.392.4034|title = Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands|journal = Computers & Operations Research|pages = 2000|last1 = Secomandi|first1 = Nicola}}</ref> − − *Vehicle routing problem with pick-up and delivery (VRPPD)<ref>W. P. Nanry and J. W. Barnes, "[https://pdfs.semanticscholar.org/f5a3/fffdfb26ead53680a5f9d3334e556181317b.pdf Solving the pickup and delivery problem with time windows using reactive tabu search]," Transportation Research Part B, vol.34, no. 2, pp.107-121, 2000.</ref><ref>R. Bent and P.V. Hentenryck, "[https://pdfs.semanticscholar.org/3952/105ddd7477f04ab1225cf2821021fefeab50.pdf A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows]," Computers & Operations Research, vol.33, no.4, pp.875-893, 2003.</ref> − − *Vehicle routing problem with time windows (VRPTW)<ref> L.M. Gambardella, E. Taillard, G. Agazzi, "MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows", In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, McGraw-Hill, London, UK, pp. 63-76, 1999.</ref><ref>{{Cite journal |doi = 10.1016/0166-218X(95)00027-O|title = The simulated trading heuristic for solving vehicle routing problems|journal = Discrete Applied Mathematics|volume = 65|issue = 1–3|pages = 47–72|year = 1996|last1 = Bachem|first1 = A.|last2 = Hochstättler|first2 = W.|last3 = Malich|first3 = M.}}</ref><ref>{{Cite journal |doi = 10.1016/S0925-5273(98)00250-3|title = A heuristic for bi-objective vehicle routing with time window constraints|journal = International Journal of Production Economics|volume = 62|issue = 3|pages = 249–258|year = 1999|last1 = Hong|first1 = Sung-Chul|last2 = Park|first2 = Yang-Byung}}</ref><ref>{{Cite journal |doi = 10.1016/j.ejor.2004.08.018|title = Scatter search for the vehicle routing problem with time windows|journal = European Journal of Operational Research|volume = 169|issue = 2|pages = 606–622|year = 2006|last1 = Russell|first1 = Robert A.|last2 = Chiang|first2 = Wen-Chyuan}}</ref> − − *Time dependent vehicle routing problem with time windows (TDVRPTW)<ref>A. V. Donati, R. Montemanni, N. Casagrande, A. E. Rizzoli, L. M. Gambardella, "[ftp://ftp.idsia.ch/pub/andrea/ASP_Aprile07/EJOR2007.pdf Time Dependent Vehicle Routing Problem with a Multi Ant Colony System]", European Journal of Operational Research, vol.185, no.3, pp.1174–1191, 2008.</ref> − − *Vehicle routing problem with time windows and multiple service workers (VRPTWMS) − − − − ===Assignment problem=== − − *[[Quadratic assignment problem]] (QAP)<ref>{{Cite journal |citeseerx = 10.1.1.47.5167|title = MAX-MIN Ant System for Quadratic Assignment Problems|year = 1997}}</ref> − − *[[Generalized assignment problem]] (GAP)<ref>R. Lourenço and D. Serra "[https://upcommons.upc.edu/bitstream/handle/2099/3627/4-ramalhinho.pdf Adaptive search heuristics for the generalized assignment problem]," Mathware & soft computing, vol.9, no.2-3, 2002.</ref><ref>M. Yagiura, T. Ibaraki and F. Glover, "[http://leeds-faculty.colorado.edu/glover/Publications/TS%20-%20PR%20-%20GAP%20in%20INFORMS%20JOC.pdf An ejection chain approach for the generalized assignment problem]," INFORMS Journal on Computing, vol. 16, no. 2, pp. 133–151, 2004.</ref> − − *[[Frequency assignment problem]] (FAP)<ref>K. I. Aardal, [[S. P. M. van Hoesel]], A. M. C. A. Koster, C. Mannino and Antonio. Sassano, "Models and solution techniques for the frequency assignment problem," A Quarterly Journal of Operations Research, vol.1, no.4, pp.261-317, 2001.</ref> − − *[[Redundancy allocation problem]] (RAP)<ref>Y. C. Liang and A. E. Smith, "[http://www.eng.auburn.edu/sites/personal/aesmith/files/antcolonyIEEETrRel%20paper.pdf An ant colony optimization algorithm for the redundancy allocation problem (RAP)]{{Dead link|date=September 2019 |bot=InternetArchiveBot |fix-attempted=yes }}," IEEE Transactions on Reliability, vol.53, no.3, pp.417-423, 2004.</ref> − − − − ===Set problem=== − − *[[Set cover problem]] (SCP)<ref>G. Leguizamon and Z. Michalewicz, "[https://cs.adelaide.edu.au/users/zbyszek/Papers/as4.pdf A new version of ant system for subset problems]," Proceedings of the 1999 Congress on Evolutionary Computation(CEC 99), vol.2, pp.1458-1464, 1999.</ref><ref>R. Hadji, M. Rahoual, E. Talbi and V. Bachelet "Ant colonies for the set covering problem," Abstract proceedings of ANTS2000, pp.63-66, 2000.</ref> − − *[[Partition problem]] (SPP)<ref>V Maniezzo and M Milandri, "[https://link.springer.com/chapter/10.1007/3-540-45724-0_19 An ant-based framework for very strongly constrained problems]," Proceedings of ANTS2000, pp.222-227, 2002.</ref> − − *Weight constrained graph tree partition problem (WCGTPP)<ref>R. Cordone and F. Maffioli,"[ftp://nozdr.ru/biblio/kolxo3/Cs/CsLn/A/Applications%20of%20Evolutionary%20Computing,%20EvoWorkshops%202001..%20EvoCOP(LNCS2037,%20Springer,%202001)(ISBN%203540419209)(529s)_CsLn_.pdf#page=74 Colored Ant System and local search to design local telecommunication networks]," Applications of Evolutionary Computing: Proceedings of Evo Workshops, vol.2037, pp.60-69, 2001.</ref> − − *Arc-weighted l-cardinality tree problem (AWlCTP)<ref>C. Blum and M.J. Blesa, "[https://upcommons.upc.edu/bitstream/handle/2117/97393/R03-1.ps Metaheuristics for the edge-weighted k-cardinality tree problem]," Technical Report TR/IRIDIA/2003-02, IRIDIA, 2003.</ref> − − *Multiple knapsack problem (MKP)<ref>[http://parallel.bas.bg/~stefka/heuristic.ps S. Fidanova, "ACO algorithm for MKP using various heuristic information"], Numerical Methods and Applications, vol.2542, pp.438-444, 2003.</ref> − − *Maximum independent set problem (MIS)<ref>G. Leguizamon, Z. Michalewicz and Martin Schutz, "[http://sedici.unlp.edu.ar/bitstream/handle/10915/23384/Documento_completo.pdf?sequence=1 An ant system for the maximum independent set problem]," Proceedings of the 2001 Argentinian Congress on Computer Science, vol.2, pp.1027-1040, 2001.</ref> − − − − ===Device sizing problem in nanoelectronics physical design=== − − * Ant colony optimization (ACO) based optimization of 45 nm CMOS-based sense amplifier circuit could converge to optimal solutions in very minimal time.<ref>O. Okobiah, S. P. Mohanty, and E. Kougianos, "[http://www.cse.unt.edu/~smohanty/Publications_Conferences/2012/Mohanty_ISQED2012_Kriging-ACO.pdf Ordinary Kriging Metamodel-Assisted Ant Colony Algorithm for Fast Analog Design Optimization] {{webarchive |url=https://web.archive.org/web/20160304110324/http://www.cse.unt.edu/~smohanty/Publications_Conferences/2012/Mohanty_ISQED2012_Kriging-ACO.pdf |date=March 4, 2016 }}", in Proceedings of the 13th IEEE International Symposium on Quality Electronic Design (ISQED), pp. 458--463, 2012.</ref> − − * Ant colony optimization (ACO) based reversible circuit synthesis could improve efficiency significantly.<ref>M. Sarkar, P. Ghosal, and S. P. Mohanty, "[http://www.cse.unt.edu/~smohanty/Publications_Conferences/2013/Mohanty_MWSCAS2013_Reversible-Circuit.pdf Reversible Circuit Synthesis Using ACO and SA based Quinne-McCluskey Method] {{webarchive |url=https://web.archive.org/web/20140729081848/http://www.cse.unt.edu/~smohanty/Publications_Conferences/2013/Mohanty_MWSCAS2013_Reversible-Circuit.pdf |date=July 29, 2014 }}", in Proceedings of the 56th IEEE International Midwest Symposium on Circuits & Systems (MWSCAS), 2013, pp. 416--419.</ref> − − − − ===Antennas optimization and synthesis=== − − [[File:ANT Antenna 1.jpg|thumb|Loopback vibrators 10×10, synthesized by means of ACO algorithm<ref name=slyusarant1>Ermolaev S.Y., Slyusar V.I. Antenna synthesis based on the ant colony optimization algorithm.// Proc. ICATT’2009, Lviv, Ukraine 6 - 9 Octobre, 2009. - Pages 298 - 300 [http://slyusar.kiev.ua/298_300_ICATT_2009.pdf]</ref>]] − − Loopback vibrators 10×10, synthesized by means of ACO algorithm − − 回路振子1010，采用蚁群算法合成 − − [[File:ANT antenna 2.jpg|thumb|Unloopback vibrators 10×10, synthesized by means of ACO algorithm<ref name=slyusarant1/>]] − − Unloopback vibrators 10×10, synthesized by means of ACO algorithm − − 采用蚁群算法合成无回路振子1010 − − To optimize the form of antennas, ant colony algorithms can be used. As example can be considered antennas RFID-tags based on ant colony algorithms (ACO).,<ref>Marcus Randall, Andrew Lewis, Amir Galehdar, David Thiel. Using Ant Colony Optimisation to Improve the Efficiency of Small Meander Line RFID Antennas.// In 3rd IEEE International e-Science and Grid Computing Conference [http://www98.griffith.edu.au/dspace/bitstream/10072/17063/1/47523_1.pdf], 2007</ref> loopback and unloopback vibrators 10×10<ref name=slyusarant1/> − − To optimize the form of antennas, ant colony algorithms can be used. As example can be considered antennas RFID-tags based on ant colony algorithms (ACO)., loopback and unloopback vibrators 10×10 − − 为了优化天线的形状，可以采用蚁群算法。作为例子，可以考虑天线射频识别标签基于蚁群算法(ACO) ，环回和非环回振动器1010 − − − − ===Image processing=== − − The ACO algorithm is used in image processing for image edge detection and edge linking.<ref>S. Meshoul and M Batouche, "[https://pdfs.semanticscholar.org/bdd2/61ab1f5a0c90009c6d84dbe4121a87dd4d31.pdf Ant colony system with extremal dynamics for point matching and pose estimation]," Proceedings of the 16th International Conference on Pattern Recognition, vol.3, pp.823-826, 2002.</ref><ref>H. Nezamabadi-pour, S. Saryazdi, and E. Rashedi, "[https://www.researchgate.net/profile/Esmat_Rashedi/publication/220176122_Edge_detection_using_ant_algorithms/links/5743d1ab08ae9ace841b4063.pdf Edge detection using ant algorithms]", Soft Computing, vol. 10, no.7, pp. 623-628, 2006.</ref> − − The ACO algorithm is used in image processing for image edge detection and edge linking. − − 将蚁群算法应用于图像处理，实现了图像的边缘检测和边缘连接。 − − * '''Edge detection:''' − − The graph here is the 2-D image and the ants traverse from one pixel depositing pheromone.The movement of ants from one pixel to another is directed by the local variation of the image's intensity values. This movement causes the highest density of the pheromone to be deposited at the edges. − − The graph here is the 2-D image and the ants traverse from one pixel depositing pheromone.The movement of ants from one pixel to another is directed by the local variation of the image's intensity values. This movement causes the highest density of the pheromone to be deposited at the edges. − − 这里的图形是二维图像和蚂蚁遍历从一个像素沉积信息素。 蚂蚁从一个像素移动到另一个像素是由图像灰度值的局部变化引导的。这一运动导致最高密度的信息素沉积在边缘。 − − − − The following are the steps involved in edge detection using ACO:<ref>{{cite book|last1=Tian|first1=Jing|title=2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)|pages=751–756|last2=Yu|first2=Weiyu|last3=Xie|first3=Shengli|doi=10.1109/CEC.2008.4630880|year=2008|isbn=978-1-4244-1822-0}}</ref><ref>{{cite web|last1=Gupta|first1=Charu|last2=Gupta|first2=Sunanda|title=Edge Detection of an Image based on Ant ColonyOptimization Technique|url=https://www.academia.edu/4688002}}</ref><ref>{{Cite book|title = Edge detection using ant colony search algorithm and multiscale contrast enhancement|journal = IEEE International Conference on Systems, Man and Cybernetics, 2009. SMC 2009|pages = 2193–2198|doi = 10.1109/ICSMC.2009.5345922|first = A.|last = Jevtić|first2 = J.|last2 = Quintanilla-Dominguez|first3 = M.G.|last3 = Cortina-Januchs|first4 = D.|last4 = Andina|year = 2009|isbn = 978-1-4244-2793-2}}</ref> − − The following are the steps involved in edge detection using ACO: − − 以下是使用 ACO 进行边缘检测的步骤: − − − − ''Step1: Initialization:<br />''Randomly place <math>K</math> ants on the image <math>I_{M_1 M_2}</math> where <math>K= (M_1*M_2)^\tfrac{1}{2}</math> . Pheromone matrix <math>\tau_{(i,j)}</math> are initialized with a random value. The major challenge in the initialization process is determining the heuristic matrix. − − Step1: Initialization:<br />Randomly place <math>K</math> ants on the image <math>I_{M_1 M_2}</math> where <math>K= (M_1*M_2)^\tfrac{1}{2}</math> . Pheromone matrix <math>\tau_{(i,j)}</math> are initialized with a random value. The major challenge in the initialization process is determining the heuristic matrix. − − Step1: 初始化: br / 随机放置数学 k / math 蚂蚁在图像数学 i { m 1 m 2} / math where math k (m 1 * m 2) ^ tfrac {1} / math。用一个随机值初始化信息素矩阵 math tau {(i，j)} / math。在初始化过程中的主要挑战是确定启发式矩阵。 − − − − There are various methods to determine the heuristic matrix. For the below example the heuristic matrix was calculated based on the local statistics: − − There are various methods to determine the heuristic matrix. For the below example the heuristic matrix was calculated based on the local statistics: − − 确定启发式矩阵的方法有多种。对于下面的例子，启发式矩阵是根据当地统计数据计算出来的: − − the local statistics at the pixel position (i,j). − − the local statistics at the pixel position (i,j). − − 像素位置(i，j)的局部统计。 − − − − <math>\eta_{(i,j)}= \tfrac{1}{Z}*Vc*I_{(i,j)}</math> − − <math>\eta_{(i,j)}= \tfrac{1}{Z}*Vc*I_{(i,j)}</math> − − 数学{(i，j)} tfrac {1}{ z } * Vc {(i，j)} / math − − − − Where <math>I</math> is the image of size <math>M_1*M_2</math><br /> − − Where <math>I</math> is the image of size <math>M_1*M_2</math><br /> − − 数学 i / math 是大小数学 m1 * m2 / math br / 的图像 − − <math>Z =\sum_{i=1:M_1} \sum_{j=1:M_2} Vc(I_{i,j})</math>,which is a normalization factor − − <math>Z =\sum_{i=1:M_1} \sum_{j=1:M_2} Vc(I_{i,j})</math>,which is a normalization factor − − 数学 zsum { i: m1} sum { j 1: m2} Vc (i { i，j }) / math，这是一个标准化因子 − − − − <math>\begin{align}Vc(I_{i,j}) = &f \left( \left\vert I_{(i-2,j-1)} - I_{(i+2,j+1)} \right\vert + \left\vert I_{(i-2,j+1)} - I_{(i+2,j-1)} \right\vert \right. \\ − − <math>\begin{align}Vc(I_{i,j}) = &f \left( \left\vert I_{(i-2,j-1)} - I_{(i+2,j+1)} \right\vert + \left\vert I_{(i-2,j+1)} - I_{(i+2,j-1)} \right\vert \right. \\ − − 数学开始{ align } Vc (i，j }) & f 左(左-垂直 i {(i-2，j-1)}-i {(i + 2，j + 1)}右-垂直-垂直-i {(i + 2，j + 1)}-i {(i + 2，j-1)}右。\\ − − & +\left\vert I_{(i-1,j-2)} - I_{(i+1,j+2)} \right\vert + \left\vert I_{(i-1,j-1)} - I_{(i+1,j+1)} \right\vert\\ − − & +\left\vert I_{(i-1,j-2)} - I_{(i+1,j+2)} \right\vert + \left\vert I_{(i-1,j-1)} - I_{(i+1,j+1)} \right\vert\\ − − & +\left\vert I_{(i-1,j-2)} - I_{(i+1,j+2)} \right\vert + \left\vert I_{(i-1,j-1)} - I_{(i+1,j+1)} \right\vert\\ − − & +\left\vert I_{(i-1,j)} - I_{(i+1,j)} \right\vert + \left\vert I_{(i-1,j+1)} - I_{(i-1,j-1)} \right\vert\\ − − & +\left\vert I_{(i-1,j)} - I_{(i+1,j)} \right\vert + \left\vert I_{(i-1,j+1)} - I_{(i-1,j-1)} \right\vert\\ − − & +\left\vert I_{(i-1,j)} - I_{(i+1,j)} \right\vert + \left\vert I_{(i-1,j+1)} - I_{(i-1,j-1)} \right\vert\\ − − & + \left. \left\vert I_{(i-1,j+2)} - I_{(i-1,j-2)} \right\vert + \left\vert I_{(i,j-1)} - I_{(i,j+1)} \right\vert \right) \end{align}</math> − − & + \left. \left\vert I_{(i-1,j+2)} - I_{(i-1,j-2)} \right\vert + \left\vert I_{(i,j-1)} - I_{(i,j+1)} \right\vert \right) \end{align}</math> − − 左边。{(i-1，j + 2)}-i {(i-1，j-2)}右 vert + 左 i{(i，j-1)}-i {(i，j + 1)}右右 vert 右) end { align } / math − − − − <math>f(\cdot)</math> can be calculated using the following functions:<br /><math>f(x) = \lambda x, \quad \text{for x ≥ 0; (1)} </math><br /><math>f(x) = \lambda x^2, \quad \text{for x ≥ 0; (2)} </math><br /><math>f(x) = − − <math>f(\cdot)</math> can be calculated using the following functions:<br /><math>f(x) = \lambda x, \quad \text{for x ≥ 0; (1)} </math><br /><math>f(x) = \lambda x^2, \quad \text{for x ≥ 0; (2)} </math><br /><math>f(x) = − − 数学 f ( cdot) / math 可以用以下函数计算: br / math f (x) lambda x，quad text { for x ≥0; (1)} / math br / math f (x) lambda x ^ 2， text { for x ≥0; (2)} / math br / math f (x) − − \begin{cases} − − \begin{cases} − − Begin { cases } − − \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (3)} \\ − − \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (3)} \\ − − Sin ( frac { pi {2 lambda }) ，& text { for 0≤ x ≤} lambda text { ; (3)} − − 0, & \text{else} − − 0, & \text{else} − − 0，& text { else } − − \end{cases}</math><br /><math>f(x) = − − \end{cases}</math><br /><math>f(x) = − − End { cases } / math br / math f (x) − − \begin{cases} − − \begin{cases} − − Begin { cases } − − \pi x \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (4)} \\ − − \pi x \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (4)} \\ − − \pi x \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (4)} \\ − − 0, & \text{else} − − 0, & \text{else} − − 0，& text { else } − − \end{cases}</math><br />The parameter <math>\lambda</math> in each of above functions adjusts the functions’ respective shapes.<br />''Step 2 Construction process:<br />''The ant's movement is based on [[4-connected neighborhood|4-connected]] [[pixel]]s or [[8-connected]] [[pixel]]s. The probability with which the ant moves is given by the probability equation <math>P_{x,y}</math><br />''Step 3 and Step 5 Update process:<br />''The pheromone matrix is updated twice. in step 3 the trail of the ant (given by <math>\tau_{(x,y)}</math> ) is updated where as in step 5 the evaporation rate of the trail is updated which is given by the below equation.<br /><math> − − \end{cases}</math><br />The parameter <math>\lambda</math> in each of above functions adjusts the functions’ respective shapes.<br />Step 2 Construction process:<br />The ant's movement is based on 4-connected pixels or 8-connected pixels. The probability with which the ant moves is given by the probability equation <math>P_{x,y}</math><br />Step 3 and Step 5 Update process:<br />The pheromone matrix is updated twice. in step 3 the trail of the ant (given by <math>\tau_{(x,y)}</math> ) is updated where as in step 5 the evaporation rate of the trail is updated which is given by the below equation.<br /><math> − − { cases } / math br / 上述每个函数中的 math lambda / math 参数调整函数各自的形状。 构建过程: 蚂蚁的移动是基于4个连接的像素或8个连接的像素。利用概率方程 p { x，y } / math br / Step 3和 Step 5更新过程，给出蚂蚁移动的概率: br / 信息素矩阵更新两次。在步骤3中，蚂蚁的踪迹(由 math tau {(x，y)} / math 给出)被更新，在步骤5中，蚂蚁的踪迹蒸发率被更新，该更新由下面的方程给出。 Br / math − − \tau_{new} \leftarrow − − \tau_{new} \leftarrow − − 左塔罗 − − (1-\psi)\tau_{old} + \psi \tau_{0} − − (1-\psi)\tau_{old} + \psi \tau_{0} − − (1- psi) tau { old } + psi tau {0} − − </math>, where <math>\psi</math> is the pheromone decay coefficient <math>0< \tau <1</math> − − </math>, where <math>\psi</math> is the pheromone decay coefficient <math>0< \tau <1</math> − − 数学，数学是信息素衰变系数，数学是数学 − − − − ''Step 7 Decision Process:<br />''Once the K ants have moved a fixed distance L for N iteration, the decision whether it is an edge or not is based on the threshold T on the pheromone matrixτ. Threshold for the below example is calculated based on [[Otsu's method]]. − − Step 7 Decision Process:<br />Once the K ants have moved a fixed distance L for N iteration, the decision whether it is an edge or not is based on the threshold T on the pheromone matrixτ. Threshold for the below example is calculated based on Otsu's method. − − 步骤7决策过程: 一旦 k 蚂蚁在 n 次迭代中移动了一个固定的距离 l，根据信息素矩阵上的阈值 t 来决定它是边还是边。下面例子的阈值是根据 Otsu 的方法计算出来的。 − − − − Image Edge detected using ACO:<br />The images below are generated using different functions given by the equation (1) to (4).<ref>{{cite web|title=File Exchange {{ndash}} Ant Colony Optimization (ACO)|website=[[MATLAB]] Central|url=http://www.mathworks.com/matlabcentral/fileexchange/32009-ant-colony-optimization--aco-}}</ref> − − Image Edge detected using ACO:<br />The images below are generated using different functions given by the equation (1) to (4). − − 图像边缘检测使用 ACO: br / 下面的图像生成使用不同的函数给出的方程(1)至(4)。 − − [[File:(a)Original Image (b)Image Generated using equation(1) (c)Image generated using equation(2) (d) Image generated using equation(3) (e)Image generated using equation(4).jpg|none|thumb]] − − thumb − − 拇指 − − − − * '''Edge linking:'''<ref>{{cite book|last1 = Jevtić|first1 = A.|title = 2009 35th Annual Conference of IEEE Industrial Electronics|last2 = Melgar|first2 = I.|last3 = Andina|first3 = D.|pages = 3353–3358|year = 2009|location = 35th Annual Conference of IEEE Industrial Electronics, 2009. IECON '09.|doi = 10.1109/IECON.2009.5415195|isbn = 978-1-4244-4648-3}}</ref> ACO has also been proven effective in edge linking algorithms too. − − − − === Other applications === − − − − * [[Bankruptcy prediction]]<ref>{{cite journal|last1=Zhang|first1=Y.|title=A Rule-Based Model for Bankruptcy Prediction Based on an Improved Genetic Ant Colony Algorithm|journal=Mathematical Problems in Engineering|date=2013|volume=2013|page=753251|doi=10.1155/2013/753251|doi-access=free}}</ref> − − * [[Classification]]<ref name="D. Martens, M pages 651">D. Martens, M. De Backer, R. Haesen, J. Vanthienen, M. Snoeck, B. Baesens, "[https://ieeexplore.ieee.org/abstract/document/4336122/ Classification with Ant Colony Optimization]", IEEE Transactions on Evolutionary Computation, volume 11, number 5, pages 651—665, 2007.</ref> − − * Connection-oriented [[network routing]]<ref>G. D. Caro and M. Dorigo, "Extending AntNet for best-effort quality-of-service routing," Proceedings of the First International Workshop on Ant Colony Optimization (ANTS’98), 1998.</ref> − − * Connectionless network routing<ref>G.D. Caro and M. Dorigo "[http://www.idsia.ch/~gianni/Papers/tech-rep-iridia-97-12.pdf AntNet: a mobile agents approach to adaptive routing]," Proceedings of the Thirty-First Hawaii International Conference on System Science, vol.7, pp.74-83, 1998.</ref><ref>G. D. Caro and M. Dorigo, "[https://www.researchgate.net/profile/Gianni_Di_Caro/publication/2328604_Two_Ant_Colony_Algorithms_For_Best-Effort_Routing_In_Datagram_Networks/links/0deec52909f32c7e6d000000/Two-Ant-Colony-Algorithms-For-Best-Effort-Routing-In-Datagram-Networks.pdf Two ant colony algorithms for best-effort routing in datagram networks]," Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’98), pp.541-546, 1998.</ref> − − * [[Data mining]]<ref name="D. Martens, M pages 651"/><ref>D. Martens, B. Baesens, T. Fawcett "[https://link.springer.com/content/pdf/10.1007/s10994-010-5216-5.pdf Editorial Survey: Swarm Intelligence for Data Mining]," Machine Learning, volume 82, number 1, pp. 1-42, 2011</ref><ref>R. S. Parpinelli, H. S. Lopes and A. A Freitas, "[http://neuro.bstu.by/ai/To-dom/My_research/Paper-0-again/For-courses/Ants/heuristic-dm-bk.pdf An ant colony algorithm for classification rule discovery]," Data Mining: A heuristic Approach, pp.191-209, 2002.</ref><ref>R. S. Parpinelli, H. S. Lopes and A. A Freitas, "[https://www.academia.edu/download/31181466/datamining070.pdf Data mining with an ant colony optimization algorithm]," IEEE Transactions on Evolutionary Computation, vol.6, no.4, pp.321-332, 2002.</ref> − − * Discounted cash flows in project scheduling<ref>W. N. Chen, J. ZHANG and H. Chung, "[http://webdelprofesor.ula.ve/economia/gsfran/Asignaturas/EvaluacionFinEconProyec/2%20OptimizingDiscounted.pdf Optimizing Discounted Cash Flows in Project Scheduling--An Ant Colony Optimization Approach]", IEEE Transactions on Systems, Man, and Cybernetics--Part C: Applications and Reviews Vol.40 No.5 pp.64-77, Jan. 2010.</ref> − − * [[distributed computing|Distributed]] [[information retrieval]]<ref>D. Picard, A. Revel, M. Cord, "An Application of Swarm Intelligence to Distributed Image Retrieval", Information Sciences, 2010</ref><ref>D. Picard, M. Cord, A. Revel, "[http://hal.upmc.fr/docs/00/65/63/63/PDF/manuscript.pdf Image Retrieval over Networks : Active Learning using Ant Algorithm]", IEEE Transactions on Multimedia, vol. 10, no. 7, pp. 1356--1365 - nov 2008</ref> − − * Energy and electricity network design<ref name="warner-and-vogel-2008"> − − {{cite conference − − {{cite conference − − {引用会议 − − | last1 = Warner | first1 = Lars − − | last1 = Warner | first1 = Lars − − | 最后1华纳 | 最初1佬司 − − | last2 = Vogel | first2 = Ute − − | last2 = Vogel | first2 = Ute − − 2 Vogel | first2 Ute − − | title = Optimization of energy supply networks using ant colony optimization − − | title = Optimization of energy supply networks using ant colony optimization − − 基于蚁群算法的能源供应网络优化 − − | date = 2008 − − | date = 2008 − − 2008年 − − | conference = Environmental Informatics and Industrial Ecology — 22th International Conference on Informatics for Environmental Protection − − | conference = Environmental Informatics and Industrial Ecology — 22th International Conference on Informatics for Environmental Protection − − 第22届环境保护信息学国际会议---- 环境信息学与工业生态学研究会议 − − | publisher = Shaker Verlag − − | publisher = Shaker Verlag − − | publisher = Shaker Verlag − − | location = Aachen, Germany − − | location = Aachen, Germany − − | 地点: 亚琛 − − | isbn = 978-3-8322-7313-2 − − | isbn = 978-3-8322-7313-2 − − [国际标准图书编号978-3-8322-7313-2] − − | url = http://enviroinfo.eu/sites/default/files/pdfs/vol119/0327.pdf − − | url = http://enviroinfo.eu/sites/default/files/pdfs/vol119/0327.pdf − − Http://enviroinfo.eu/sites/default/files/pdfs/vol119/0327.pdf − − | access-date = 2018-10-09 − − | access-date = 2018-10-09 − − 2018-10-09 − }} − − }} − − }} − − </ref> − − </ref> − − / 参考 − − * Grid workflow scheduling problem<ref>W. N. Chen and J. ZHANG "Ant Colony Optimization Approach to Grid Workflow Scheduling Problem with Various QoS Requirements", IEEE Transactions on Systems, Man, and Cybernetics--Part C: Applications and Reviews, Vol. 31, No. 1,pp.29-43,Jan 2009.</ref> − − * Inhibitory peptide design for [[protein protein interaction]]s<ref name=":0">{{Cite journal|last=Zaidman|first=Daniel|last2=Wolfson|first2=Haim J.|date=2016-08-01|title=PinaColada: peptide–inhibitor ant colony ad-hoc design algorithm|journal=Bioinformatics|volume=32|issue=15|pages=2289–2296|doi=10.1093/bioinformatics/btw133|pmid=27153578|issn=1367-4803|doi-access=free}}</ref> − − * Intelligent testing system<ref>Xiao. M.Hu, J. ZHANG, and H. Chung, "[https://ieeexplore.ieee.org/abstract/document/5061647/ An Intelligent Testing System Embedded with an Ant Colony Optimization Based Test Composition Method]", IEEE Transactions on Systems, Man, and Cybernetics--Part C: Applications and Reviews, Vol. 39, No. 6, pp. 659-669, Dec 2009.</ref> − − * Power [[electronic circuit design]]<ref>J. ZHANG, H. Chung, W. L. Lo, and T. Huang, "[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.140.4340&rep=rep1&type=pdf Extended Ant Colony Optimization Algorithm for Power Electronic Circuit Design]", IEEE Transactions on Power Electronic. Vol.24,No.1, pp.147-162, Jan 2009.</ref> − − * [[Protein folding]]<ref>X. M. Hu, J. ZHANG，J. Xiao and Y. Li, "[http://eprints.gla.ac.uk/5306/1/5306.pdf Protein Folding in Hydrophobic-Polar Lattice Model: A Flexible Ant- Colony Optimization Approach] ", Protein and Peptide Letters, Volume 15, Number 5, 2008, Pp. 469-477.</ref><ref>A. Shmygelska, R. A. Hernández and H. H. Hoos, "[ftp://nozdr.ru/biblio/kolxo3/Cs/CsLn/Ant%20Algorithms,%203%20conf.,%20ANTS%202002(LNCS2463,%20Springer,%202002)(ISBN%203540441468)(318s).pdf#page=54 An ant colony optimization algorithm for the 2D HP protein folding problem]," Proceedings of the 3rd International Workshop on Ant Algorithms/ANTS 2002, Lecture Notes in Computer Science, vol.2463, pp.40-52, 2002.</ref><ref>{{cite book |author1=M. Nardelli |author2=L. Tedesco |author3=A. Bechini |title= Cross-lattice behavior of general ACO folding for proteins in the HP model |journal= Proc. Of ACM SAC 2013|year=2013|pages=1320–1327 |doi= 10.1145/2480362.2480611|isbn=9781450316569 |url=https://zenodo.org/record/3445092 }}</ref> − − * System identification<ref>L. Wang and Q. D. Wu, "Linear system parameters identification based on ant system algorithm," Proceedings of the IEEE Conference on Control Applications, pp. 401-406, 2001.</ref><ref>K. C. Abbaspour, R. Schulin, M. T. Van Genuchten, "[https://www.ars.usda.gov/arsuserfiles/20360500/pdf_pubs/P1797.pdf Estimating unsaturated soil hydraulic parameters using ant colony optimization]," Advances In Water Resources, vol. 24, no. 8, pp. 827-841, 2001.</ref> − − − − ==Definition difficulty== − − [[File:Aco shortpath.svg|thumb]] − − thumb − − 拇指 − − With an ACO algorithm, the shortest path in a graph, between two points A and B, is built from a combination of several paths.<ref>{{Cite journal | doi=10.1186/1471-2105-6-30| pmid=15710037| pmc=555464|year = 2005|last1 = Shmygelska|first1 = Alena| title=An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem| journal=BMC Bioinformatics| volume=6| pages=30| last2=Hoos| first2=Holger H.}}</ref> It is not easy to give a precise definition of what algorithm is or is not an ant colony, because the definition may vary according to the authors and uses. Broadly speaking, ant colony algorithms are regarded as [[people|populated]] [[metaheuristics]] with each solution represented by an ant moving in the search space.<ref>Fred W. Glover,Gary A. Kochenberger, ''Handbook of Metaheuristics'', [https://books.google.com/books?id=P-HpBwAAQBAJ&pg=PA276&lpg=PA276&dq=aco+algorithms+with+guaranteed+convergence+to+the+optimal+solution+metaheuristics&source=bl&ots=4kyU_bZLpg&sig=zSrzu89MRED00H8QWjixBMkw11k&hl=fr&sa=X&ved=0ahUKEwjm4_2ysurTAhUHZ1AKHabGAZIQ6AEIODAE#v=onepage&q=aco%20algorithms%20with%20guaranteed%20convergence%20to%20the%20optimal%20solution%20metaheuristics&f=false], Springer (2003)</ref> Ants mark the best solutions and take account of previous markings to optimize their search. They can be seen as [[probabilistic]] [[multi-agent]] algorithms using a [[probability distribution]] to make the transition between each [[iteration]].<ref>http://www.multiagent.fr/extensions/ICAPManager/pdf/LauriCharpillet2006.pdf</ref> In their versions for combinatorial problems, they use an iterative construction of solutions.<ref>WJ Gutjahr , ''ACO algorithms with guaranteed convergence to the optimal solution'', [https://homes.di.unimi.it/cordone/courses/2016-ae/Lez07-Materiali/ACOAlgoithmsWithGuaranteedConvergenceToTheOptimalSolution.pdf], (2002)</ref> According to some authors, the thing which distinguishes ACO algorithms from other relatives (such as algorithms to estimate the distribution or particle swarm optimization) is precisely their constructive aspect. In combinatorial problems, it is possible that the best solution eventually be found, even though no ant would prove effective. Thus, in the example of the Travelling salesman problem, it is not necessary that an ant actually travels the shortest route: the shortest route can be built from the strongest segments of the best solutions. However, this definition can be problematic in the case of problems in real variables, where no structure of 'neighbours' exists. The collective behaviour of [[social insects]] remains a source of inspiration for researchers. The wide variety of algorithms (for optimization or not) seeking self-organization in biological systems has led to the concept of "[[swarm intelligence]]",<ref name="Waldner 2008 214"/> which is a very general framework in which ant colony algorithms fit. − − With an ACO algorithm, the shortest path in a graph, between two points A and B, is built from a combination of several paths. It is not easy to give a precise definition of what algorithm is or is not an ant colony, because the definition may vary according to the authors and uses. Broadly speaking, ant colony algorithms are regarded as populated metaheuristics with each solution represented by an ant moving in the search space. Ants mark the best solutions and take account of previous markings to optimize their search. They can be seen as probabilistic multi-agent algorithms using a probability distribution to make the transition between each iteration. In their versions for combinatorial problems, they use an iterative construction of solutions. According to some authors, the thing which distinguishes ACO algorithms from other relatives (such as algorithms to estimate the distribution or particle swarm optimization) is precisely their constructive aspect. In combinatorial problems, it is possible that the best solution eventually be found, even though no ant would prove effective. Thus, in the example of the Travelling salesman problem, it is not necessary that an ant actually travels the shortest route: the shortest route can be built from the strongest segments of the best solutions. However, this definition can be problematic in the case of problems in real variables, where no structure of 'neighbours' exists. The collective behaviour of social insects remains a source of inspiration for researchers. The wide variety of algorithms (for optimization or not) seeking self-organization in biological systems has led to the concept of "swarm intelligence", which is a very general framework in which ant colony algorithms fit. − − 采用蚁群优化算法，由多条路径组合构造图中两点 a 和 b 之间的最短路径。要准确定义什么算法是蚁群算法，什么算法不是蚁群算法并不容易，因为定义可能会因作者和用途的不同而有所不同。广义地说，蚁群算法被看作是一种填充的元启发式算法，每个解都由一个在搜索空间中移动的蚂蚁表示。蚂蚁标记最好的解决方案，并考虑到以前的标记，以优化他们的搜索。它们可以被看作是概率多智能体算法，使用概率分布进行每次迭代之间的转换。在他们解决组合问题的版本中，他们使用了迭代构造的解决方案。根据一些作者的观点，蚁群算法区别于其他相关算法(比如估计分布或粒子群优化的算法)正是蚁群算法的建设性方面。在组合问题中，最终可能找到最好的解决方案，即使没有蚂蚁证明是有效的。因此，在旅行推销员问题的例子中，蚂蚁实际上并不需要走最短的路线: 最短的路线可以从最好的解决方案中最强的部分建立起来。然而，这一定义在实变量问题的情况下可能是有问题的，在实变量中没有”邻居”的结构存在。群居昆虫的集体行为仍然是研究人员的灵感来源。在生物系统中寻找自我组织的算法种类繁多(无论是优化还是非优化)已经导致了“群体智能”的概念，这是一个非常通用的框架，适合蚁群算法。 − − − − ==Stigmergy algorithms== − − There is in practice a large number of algorithms claiming to be "ant colonies", without always sharing the general framework of optimization by canonical ant colonies.<ref>Santpal Singh Dhillon , ''Ant Routing, Searching and Topology Estimation Algorithms for Ad Hoc Networks'', [https://books.google.com/books?id=j5fOJqhwcJoC&pg=PA33&dq=Stigmergy+algorithms&hl=fr&sa=X&ved=0ahUKEwjwjfaAtOrTAhWnLsAKHVPkCjYQ6AEIKTAB#v=onepage&q=Stigmergy%20algorithms&f=false], IOS Press, (2008)</ref> In practice, the use of an exchange of information between ants via the environment (a principle called "[[stigmergy]]") is deemed enough for an algorithm to belong to the class of ant colony algorithms. This principle has led some authors to create the term "value" to organize methods and behavior based on search of food, sorting larvae, division of labour and cooperative transportation.<ref>A. Ajith; G. Crina; R. Vitorino (éditeurs), ''Stigmergic Optimization'', Studies in Computational Intelligence , volume 31, 299 pages, 2006. {{ISBN|978-3-540-34689-0}}</ref> − − There is in practice a large number of algorithms claiming to be "ant colonies", without always sharing the general framework of optimization by canonical ant colonies. In practice, the use of an exchange of information between ants via the environment (a principle called "stigmergy") is deemed enough for an algorithm to belong to the class of ant colony algorithms. This principle has led some authors to create the term "value" to organize methods and behavior based on search of food, sorting larvae, division of labour and cooperative transportation. − − 在实践中，有大量的算法声称是“蚁群” ，并不总是共享规范的蚁群优化的一般框架。在实践中，蚂蚁之间通过环境交换信息(一个原则称为“ stigmergy”)被认为足以使算法属于蚁群算法的类别。这个原则促使一些作者创造了“价值”这个词来组织方法和行为，基于寻找食物，分类幼虫，分工和合作运输。 − − − − ==Related methods== − − *[[Genetic algorithm]]s (GA) maintain a pool of solutions rather than just one. The process of finding superior solutions mimics that of evolution, with solutions being combined or mutated to alter the pool of solutions, with solutions of inferior quality being discarded. − − * An [[estimation of distribution algorithm]] (EDA) is an [[evolutionary algorithm]] that substitutes traditional reproduction operators by model-guided operators. Such models are learned from the population by employing machine learning techniques and represented as probabilistic graphical models, from which new solutions can be sampled<ref>{{cite book|last1=Pelikan|first1=Martin|last2=Goldberg|first2=David E.|last3=Cantú-Paz|first3=Erick|title=BOA: The Bayesian Optimization Algorithm|journal=Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - Volume 1|date=1 January 1999|pages=525–532|url=http://dl.acm.org/citation.cfm?id=2933973|isbn=9781558606111|series=Gecco'99}}</ref><ref>{{cite book|last1=Pelikan|first1=Martin|title=Hierarchical Bayesian optimization algorithm : toward a new generation of evolutionary algorithms|date=2005|publisher=Springer|location=Berlin [u.a.]|isbn=978-3-540-23774-7|edition=1st}}</ref> or generated from guided-crossover.<ref>{{cite book|last1=Thierens|first1=Dirk|title=The Linkage Tree Genetic Algorithm|journal=Parallel Problem Solving from Nature, PPSN XI|date=11 September 2010|pages=264–273|doi=10.1007/978-3-642-15844-5_27|language=en|isbn=978-3-642-15843-8|url=https://semanticscholar.org/paper/bdab50f163fb72270314d6ed5a5de73671e6a86c}}</ref><ref>{{cite journal|last1=Martins|first1=Jean P.|last2=Fonseca|first2=Carlos M.|last3=Delbem|first3=Alexandre C. B.|title=On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem|journal=Neurocomputing|date=25 December 2014|volume=146|pages=17–29|doi=10.1016/j.neucom.2014.04.069}}</ref> − − *[[Simulated annealing]] (SA) is a related global optimization technique which traverses the search space by generating neighboring solutions of the current solution. A superior neighbor is always accepted. An inferior neighbor is accepted probabilistically based on the difference in quality and a temperature parameter. The temperature parameter is modified as the algorithm progresses to alter the nature of the search. − − * Reactive search optimization focuses on combining machine learning with optimization, by adding an internal feedback loop to self-tune the free parameters of an algorithm to the characteristics of the problem, of the instance, and of the local situation around the current solution. − − *[[Tabu search]] (TS) is similar to simulated annealing in that both traverse the solution space by testing mutations of an individual solution. While simulated annealing generates only one mutated solution, tabu search generates many mutated solutions and moves to the solution with the lowest fitness of those generated. To prevent cycling and encourage greater movement through the solution space, a tabu list is maintained of partial or complete solutions. It is forbidden to move to a solution that contains elements of the tabu list, which is updated as the solution traverses the solution space. − − *[[Artificial immune system]] (AIS) algorithms are modeled on vertebrate immune systems. − − *[[Particle swarm optimization]] (PSO), a [[swarm intelligence]] method − − *[[Intelligent Water Drops|Intelligent water drops]] (IWD), a swarm-based optimization algorithm based on natural water drops flowing in rivers − − *Gravitational search algorithm (GSA), a [[swarm intelligence]] method − − *Ant colony clustering method (ACCM), a method that make use of clustering approach, extending the ACO. − − * [[Stochastic diffusion search]] (SDS), an agent-based probabilistic global search and optimization technique best suited to problems where the objective function can be decomposed into multiple independent partial-functions − − − − ==History== − − The inventors are [[Frans Moyson]] and [[Bernard Manderick]]. Pioneers of the field include [[Marco Dorigo]], [[Luca Maria Gambardella]].<ref>{{cite journal|last = Manderick, Moyson |first = Bernard, Frans |authorlink = Manderick, Bernard, and Moyson, Frans |title = The collective behavior of ants: An example of self-organization in massive parallelism. |publisher = Proceedings of the AAAI Spring Symposium on Parallel Models of Intelligence |place = Stanford |year = 1988}}</ref> − − The inventors are Frans Moyson and Bernard Manderick. Pioneers of the field include Marco Dorigo, Luca Maria Gambardella. − − 发明者是 Frans Moyson 和 Bernard Manderick。这一领域的先驱包括马可 · 多里戈、卢卡 · 玛利亚 · 甘巴德拉。 − − − − {{image frame|content= − − {{image frame|content= − − {图片框架 | 内容 − − <timeline> − − <timeline> − − 时间线 − − ImageSize = width:210 height:300 − − ImageSize = width:210 height:300 − − 图像宽度: 210高度: 300 − − PlotArea = width:170 height:280 left:40 bottom:10 − − PlotArea = width:170 height:280 left:40 bottom:10 − − 170 height: 280 left: 40 bottom: 10 − − − − DateFormat = yyyy − − DateFormat = yyyy − − 日期格式 yyy − − Period = from:1985 till:2005 − − Period = from:1985 till:2005 − − 时间: 1985年至2005年 − − TimeAxis = orientation:vertical − − TimeAxis = orientation:vertical − − 时轴方向: 垂直 − − ScaleMajor = unit:year increment:5 start:1985 − − ScaleMajor = unit:year increment:5 start:1985 − − 单元: year increment: 5 start: 1985 − − − − Colors= − − Colors= − − 颜色 − − id:fond value:white #rgb(0.95,0.95,0.98) − − id:fond value:white #rgb(0.95,0.95,0.98) − − Id: fond value: white # rgb (0.95,0.95,0.98) − − id:marque value:rgb(1,0,0) − − id:marque value:rgb(1,0,0) − − Id: marque value: rgb (1,0,0) − − id:marque_fond value:rgb(1,0.9,0.9) − − id:marque_fond value:rgb(1,0.9,0.9) − − Id: marque fond value: rgb (1,0.9,0.9) − − BackgroundColors = canvas:fond − − BackgroundColors = canvas:fond − − 背景颜色画布: 喜欢 − − − − Define $dx = 7 # décalage du texte à droite de la barre − − Define $dx = 7 # décalage du texte à droite de la barre − − Define $dx = 7 # décalage du texte à droite de la barre − − Define $dy = -3 # décalage vertical − − Define $dy = -3 # décalage vertical − − Define $dy = -3 # décalage vertical − − Define $dy2 = 6 # décalage vertical pour double texte − − Define $dy2 = 6 # décalage vertical pour double texte − − Define $dy2 = 6 # décalage vertical pour double texte − − − − PlotData= − − PlotData= − − Plotdata − − bar:Leaders color:marque_fond width:5 mark:(line,marque) align:left fontsize:S − − bar:Leaders color:marque_fond width:5 mark:(line,marque) align:left fontsize:S − − 条: 领袖颜色: 标志宽度: 5马克: (线，标志)对齐: 左方块大小: s − − − − from:1989 till:1989 shift:($dx,$dy) text:studies of collective behavior − − from:1989 till:1989 shift:($dx,$dy) text:studies of collective behavior − − 1989-1989 shift: ($dx，$dy) text: studies of collective behavior − − from:1991 till:1992 shift:($dx,$dy) text:ant system (AS) − − from:1991 till:1992 shift:($dx,$dy) text:ant system (AS) − − 从: 1991到: 1992 shift: ($dx，$dy) text: ant system (AS) − − from:1995 till:1995 shift:($dx,$dy) text:continuous problem (CACO) − − from:1995 till:1995 shift:($dx,$dy) text:continuous problem (CACO) − − 从: 1995到: 1995 shift: ($dx，$dy) text: continuous problem (CACO) − − from:1996 till:1996 shift:($dx,$dy) text:ant colony system (ACS) − − from:1996 till:1996 shift:($dx,$dy) text:ant colony system (ACS) − − 从: 1996到: 1996 shift: ($dx，$dy) text: ant colony system (ACS) − − from:1996 till:1996 shift:($dx,$dy2) text:max-min ant system (MMAS) − − from:1996 till:1996 shift:($dx,$dy2) text:max-min ant system (MMAS) − − 从: 1996到: 1996 shift: ($dx，$dy2) text: max-min ant system (MMAS) − − from:2000 till:2000 shift:($dx,$dy) text:proof to convergence (GBAS) − − from:2000 till:2000 shift:($dx,$dy) text:proof to convergence (GBAS) − − 从: 2000到: 2000 shift: ($dx，$dy) text: proof to convergence (GBAS) − − from:2001 till:2001 shift:($dx,$dy) text:multi-objective algorithm − − from:2001 till:2001 shift:($dx,$dy) text:multi-objective algorithm − − 2001-2001 shift: ($dx，$dy) text: multi-objective algorithm − − − − </timeline>|caption=Chronology of COA algorithms − − </timeline>|caption=Chronology of COA algorithms − − / timeline | COA 算法年表 − − }} − − }} − − }} − − − − Chronology of ant colony optimization algorithms. − − Chronology of ant colony optimization algorithms. − − 蚁群算法年表。 − − * 1959, [[Pierre-Paul Grassé]] invented the theory of [[stigmergy]] to explain the behavior of nest building in [[termites]];<ref>P.-P. Grassé, ''La reconstruction du nid et les coordinations inter-individuelles chez Belicositermes natalensis et Cubitermes sp. La théorie de la Stigmergie : Essai d’interprétation du comportement des termites constructeurs'', Insectes Sociaux, numéro 6, p. 41-80, 1959.</ref> − − * 1983, Deneubourg and his colleagues studied the [[collective behavior]] of [[ants]];<ref>J.L. Denebourg, J.M. Pasteels et J.C. Verhaeghe, ''[https://pdfs.semanticscholar.org/caac/71608a5e6b0907a8a99bba30d72d9a304152.pdf Probabilistic Behaviour in Ants : a Strategy of Errors?]'', Journal of Theoretical Biology, numéro 105, 1983.</ref> − − * 1988, and Moyson Manderick have an article on '''self-organization''' among ants;<ref name="F. Moyson, B. Manderick">F. Moyson, B. Manderick, ''The collective behaviour of Ants : an Example of Self-Organization in Massive Parallelism'', Actes de AAAI Spring Symposium on Parallel Models of Intelligence, Stanford, Californie, 1988.</ref> − − * 1989, the work of Goss, Aron, Deneubourg and Pasteels on the '''collective behavior of Argentine ants''', which will give the idea of ant colony optimization algorithms;<ref name="S. Goss">S. Goss, S. Aron, J.-L. Deneubourg et J.-M. Pasteels, ''[https://www.researchgate.net/profile/Serge_Aron/publication/301232811_Self-Organized_Shortcuts_in_the_Argentine_Ant/links/59967b5daca27283b11d9070/Self-Organized-Shortcuts-in-the-Argentine-Ant.pdf Self-organized shortcuts in the Argentine ant]'', Naturwissenschaften, volume 76, pages 579-581, 1989</ref> − − * 1989, implementation of a model of behavior for food by Ebling and his colleagues;<ref>M. Ebling, M. Di Loreto, M. Presley, F. Wieland, et D. Jefferson,''An Ant Foraging Model Implemented on the Time Warp Operating System'', Proceedings of the SCS Multiconference on Distributed Simulation, 1989</ref> − − * 1991, M. Dorigo proposed the '''ant system''' in his doctoral thesis (which was published in 1992<ref name="M. Dorigo, Optimization, Learning and Natural Algorithms" />). A technical report extracted from the thesis and co-authored by V. Maniezzo and A. Colorni<ref>Dorigo M., V. Maniezzo et A. Colorni, ''Positive feedback as a search strategy'', rapport technique numéro 91-016, Dip. Elettronica, Politecnico di Milano, Italy, 1991</ref> was published five years later;<ref name="Ant system" /> − − * 1994, Appleby and Steward of British Telecommunications Plc published the first application to [[telecommunications]] networks<ref>Appleby, S. & Steward, S. Mobile software agents for control in telecommunications networks, BT Technol. J., 12(2):104–113, April 1994</ref> − − * 1995, Gambardella and Dorigo proposed '''ant-q''', <ref> L.M. Gambardella and M. Dorigo, "Ant-Q: a reinforcement learning approach to the traveling salesman problem", Proceedings of ML-95, Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, pp. 252–260, 1995 </ref> the preliminary version of ant colony system as first estension of ant system; <ref name="Ant system" />. − − * 1996, Gambardella and Dorigo proposed '''ant colony system''' <ref> L.M. Gambardella and M. Dorigo, "Solving Symmetric and Asymmetric TSPs by Ant Colonies", Proceedings of the IEEE Conference on Evolutionary Computation, ICEC96, Nagoya, Japan, May 20-22, pp. 622-627, 1996; </ref> − − * 1996, publication of the article on ant system;<ref name="Ant system" /> − − * 1996, Hoos and Stützle invent the '''max-min ant system''';<ref name="T. Stützle et H.H. Hoos" /> − − * 1997, Dorigo and Gambardella proposed ant colony system hybrized with local search;<ref name="M. Dorigo et L.M. Gambardella" /> − − * 1997, Schoonderwoerd and his colleagues published an improved application to [[telecommunication]] networks;<ref>R. Schoonderwoerd, O. Holland, J. Bruten et L. Rothkrantz, ''[https://pdfs.semanticscholar.org/f09e/03c5d759c7ca04e443d496e23c981f1b4a5d.pdf Ant-based load balancing in telecommunication networks]'', Adaptive Behaviour, volume 5, numéro 2, pages 169-207, 1997</ref> − − * 1998, Dorigo launches first conference dedicated to the ACO algorithms;<ref>M. Dorigo, ''ANTS’ 98, From Ant Colonies to Artificial Ants : First International Workshop on Ant Colony Optimization, ANTS 98'', Bruxelles, Belgique, octobre 1998.</ref> − − * 1998, Stützle proposes initial '''parallel implementations''';<ref>T. Stützle, ''Parallelization Strategies for Ant Colony Optimization'', Proceedings of PPSN-V, Fifth International Conference on Parallel Problem Solving from Nature, Springer-Verlag, volume 1498, pages 722-731, 1998.</ref> − − *1999, Gambardella, Taillard and Agazzi proposed ''' macs-vrptw''', first multi ant colony system applied to vehicle routing problems with time windows, <ref> L.M. Gambardella, E. Taillard, G. Agazzi, "MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows", In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, McGraw-Hill, London, UK, pp. 63-76, 1999.</ref> − − * 1999, Bonabeau, Dorigo and Theraulaz publish a book dealing mainly with artificial ants<ref>É. Bonabeau, M. Dorigo et G. Theraulaz, ''Swarm intelligence'', Oxford University Press, 1999.</ref> − − * 2000, special issue of the Future Generation Computer Systems journal on ant algorithms<ref>M. Dorigo , G. Di Caro et T. Stützle, ''[https://www.academia.edu/download/30765111/FGCS-Editorial-final.pdf Special issue on "Ant Algorithms]"'', Future Generation Computer Systems, volume 16, numéro 8, 2000</ref> − − * 2000, first applications to the [[Scheduling algorithm|scheduling]], scheduling sequence and the [[constraint satisfaction|satisfaction of constraints]]; − − * 2000, Gutjahr provides the first evidence of [[limit of a sequence|convergence]] for an algorithm of ant colonies<ref>W.J. Gutjahr, ''[http://iridia.ulb.ac.be/~mdorigo/ACO/downloads/ants5.pdf A graph-based Ant System and its convergence]'', Future Generation Computer Systems, volume 16, pages 873-888, 2000.</ref> − − * 2001, the first use of COA algorithms by companies ([http://www.eurobios.com/ Eurobios] and [http://www.antoptima.com/ AntOptima]); − − * 2001, Iredi and his colleagues published the first '''multi-objective''' algorithm<ref>S. Iredi, D. Merkle et M. Middendorf, ''[https://link.springer.com/chapter/10.1007/3-540-44719-9_25 Bi-Criterion Optimization with Multi Colony Ant Algorithms]'', Evolutionary Multi-Criterion Optimization, First International Conference (EMO’01), Zurich, Springer Verlag, pages 359-372, 2001.</ref> − − * 2002, first applications in the design of schedule, Bayesian networks; − − * 2002, Bianchi and her colleagues suggested the first algorithm for [[stochastic]] problem;<ref>L. Bianchi, L.M. Gambardella et M.Dorigo, ''[http://hcot.ir/wp-content/uploads/2015/03/An-Ant-Colony-Optimization-Approach-to-the-Probabilistic-Traveling-Salesman-Problem.pdf An ant colony optimization approach to the probabilistic traveling salesman problem]'', PPSN-VII, Seventh International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer Verlag, Berlin, Allemagne, 2002.</ref> − − * 2004, Dorigo and Stützle publish the Ant Colony Optimization book with MIT Press <ref>M. Dorigo and T. Stützle, ''Ant Colony Optimization'', MIT Press, 2004.</ref> − − * 2004, Zlochin and Dorigo show that some algorithms are equivalent to the [[stochastic gradient descent]], the [[cross-entropy method]] and [[algorithms to estimate distribution]]<ref name="Zlochin model-based search"/> − − * 2005, first applications to [[protein folding]] problems. − − * 2012, Prabhakar and colleagues publish research relating to the operation of individual ants communicating in tandem without pheromones, mirroring the principles of computer network organization. The communication model has been compared to the [[Transmission Control Protocol]].<ref>B. Prabhakar, K. N. Dektar, D. M. Gordon, "The regulation of ant colony foraging activity without spatial information ", PLOS Computational Biology, 2012. URL: http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1002670</ref> − − * 2016, first application to peptide sequence design.<ref name=":0" /> − − * 2017, successful integration of the multi-criteria decision-making method PROMETHEE into the ACO algorithm ([[HUMANT (HUManoid ANT) algorithm|HUMANT algorithm]]).<ref>{{cite journal|last1=Mladineo|first1=Marko|last2=Veza|first2=Ivica|last3=Gjeldum|first3=Nikola|title=Solving partner selection problem in cyber-physical production networks using the HUMANT algorithm|journal=International Journal of Production Research|date=2017|volume=55|issue=9|pages=2506–2521|doi=10.1080/00207543.2016.1234084}}</ref> − − − − ==References== − − {{Reflist|30em}} − − − − ==Publications (selected)== − − * [[Marco Dorigo|M. Dorigo]], 1992. ''Optimization, Learning and Natural Algorithms'', PhD thesis, Politecnico di Milano, Italy. − − * M. Dorigo, V. Maniezzo & A. Colorni, 1996. "[http://www.cs.unibo.it/babaoglu/courses/cas05-06/tutorials/Ant_Colony_Optimization.pdf Ant System: Optimization by a Colony of Cooperating Agents]", IEEE Transactions on Systems, Man, and Cybernetics–Part B, 26 (1): 29–41. − − * M. Dorigo & [[Luca Maria Gambardella|L. M. Gambardella]], 1997. "[http://www.idsia.ch/~luca/acs-ec97.pdf Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem]". IEEE Transactions on Evolutionary Computation, 1 (1): 53–66. − − * M. Dorigo, G. Di Caro & L. M. Gambardella, 1999. "[http://people.idsia.ch/~gianni/Papers/ArtificialLife-original.pdf Ant Algorithms for Discrete Optimization]". Artificial Life, 5 (2): 137–172. − − * E. Bonabeau, M. Dorigo et G. Theraulaz, 1999. ''Swarm Intelligence: From Natural to Artificial Systems'', Oxford University Press. {{ISBN|0-19-513159-2}} − − * M. Dorigo & T. Stützle, 2004. ''Ant Colony Optimization'', MIT Press. {{ISBN|0-262-04219-3}} − − * M. Dorigo, 2007. [http://www.scholarpedia.org/article/Ant_Colony_Optimization "Ant Colony Optimization"]. Scholarpedia. − − * C. Blum, 2005 "[http://aisii.azc.uam.mx/mcbc/Cursos/IntCompt/Lectura16.pdf Ant colony optimization: Introduction and recent trends]". Physics of Life Reviews, 2: 353-373 − − * M. Dorigo, M. Birattari & T. Stützle, 2006 ''[http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2006-023r001.pdf Ant Colony Optimization: Artificial Ants as a Computational Intelligence Technique]''. TR/IRIDIA/2006-023 − − * Mohd Murtadha Mohamad,"Articulated Robots Motion Planning Using Foraging Ant Strategy",Journal of Information Technology - Special Issues in Artificial Intelligence, Vol.20, No. 4 pp. 163–181, December 2008, {{ISSN|0128-3790}}. − − * N. Monmarché, F. Guinand & P. Siarry (eds), "Artificial Ants", August 2010 Hardback 576 pp. {{ISBN|978-1-84821-194-0}}. − − * A. Kazharov, V. Kureichik, 2010. "[https://www.researchgate.net/profile/Asker_Kazharov/publication/225549674_Ant_colony_optimization_algorithms_for_solving_transportation_problems/links/56e0268e08aec4b3333d0039.pdf Ant colony optimization algorithms for solving transportation problems]", Journal of Computer and Systems Sciences International, Vol. 49. No. 1. pp. 30–43. − − * C-M. Pintea, 2014, [https://www.springer.com/la/book/9783642401787 Advances in Bio-inspired Computing for Combinatorial Optimization Problem], Springer {{ISBN|978-3-642-40178-7}} − − * K. Saleem, N. Fisal, M. A. Baharudin, A. A. Ahmed, S. Hafizah and S. Kamilah, "Ant colony inspired self-optimized routing protocol based on cross layer architecture for wireless sensor networks", WSEAS Trans. Commun., vol. 9, no. 10, pp. 669–678, 2010. {{ISBN|978-960-474-200-4}} − − * K. Saleem and N. Fisal, "Enhanced Ant Colony algorithm for self-optimized data assured routing in wireless sensor networks", Networks (ICON) 2012 18th IEEE International Conference on, pp. 422–427. {{ISBN|978-1-4673-4523-1}} − − − − ==External links== − − *[http://www.scholarpedia.org/article/Ant_colony_optimization/ Scholarpedia Ant Colony Optimization page] − − *[http://www.aco-metaheuristic.org/ Ant Colony Optimization Home Page] − − *[http://vk.com/ant_colony_optimization "Ant Colony Optimization" - Russian scientific and research community] − − *[https://web.archive.org/web/20080616044645/http://www.nightlab.ch/antsim/ AntSim - Simulation of Ant Colony Algorithms] − − *[http://www.midaco-solver.com/ MIDACO-Solver] General purpose optimization software based on ant colony optimization (Matlab, Excel, VBA, C/C++, R, C#, Java, Fortran and Python) − − * [https://web.archive.org/web/20110719105224/http://ems.eit.uni-kl.de/index.php?id=156 University of Kaiserslautern, Germany, AG Wehn: Ant Colony Optimization Applet] Visualization of Traveling Salesman solved by ant system with numerous options and parameters (Java Applet) − − *[http://webspace.webring.com/people/br/raguirre/hormigas/antfarm/ Ant Farm Simulator] − − *[http://www.djoh.net/inde/ANTColony/applet.html Ant algorithm simulation (Java Applet)] − − *[https://github.com/ugochirico/Java-Ant-Colony-System-Framework Java Ant Colony System Framework] − − − − {{collective animal behaviour}} − − − − {{DEFAULTSORT:Ant Colony Optimization}} − − [[Category:Articles which contain graphical timelines]] 第1,319行：
第313行： − [[Category:Nature-inspired metaheuristics]]+ 第1,325行：
第319行： − [[Category:Optimization algorithms and methods]]+
Moved page from wikipedia:en:Ant colony optimization algorithms (history)
此词条暂由彩云小译翻译，翻译字数共648，未经人工整理和审校，带来阅读不便，请见谅。
{{multiple issues|
{{multiple issues|
{{multiple issues|
{{multiple issues|
{多个问题 |
{多个问题 |
{{Original research|date=August 2018}}
{{Original research|date=August 2018}}
[[File:Artificial ants.jpg|thumb|400px|When a colony of ants is confronted with the choice of reaching their food via two different routes of which one is much shorter than the other, their choice is entirely random. However, those who use the shorter route reach the food faster and therefore go back and forth more often between the anthill and the food.<ref>{{cite book |last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Nanocomputers and Swarm Intelligence |publisher = [[ISTE Ltd|ISTE]] [[John Wiley & Sons]] |place = London |year = 2008 |isbn = 978-1-84704-002-2 | page = 225}}</ref>]]
[[File:Artificial ants.jpg|thumb|400px|When a colony of ants is confronted with the choice of reaching their food via two different routes of which one is much shorter than the other, their choice is entirely random. However, those who use the shorter route reach the food faster and therefore go back and forth more often between the anthill and the food.<ref>{{cite book |last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Nanocomputers and Swarm Intelligence |publisher = [[ISTE Ltd|ISTE]] [[John Wiley & Sons]] |place = London |year = 2008 |isbn = 978-1-84704-002-2 | page = 225}}</ref>]]
When a colony of ants is confronted with the choice of reaching their food via two different routes of which one is much shorter than the other, their choice is entirely random. However, those who use the shorter route reach the food faster and therefore go back and forth more often between the anthill and the food.
[[File:Artificial ants.jpg|thumb|400px|When a colony of ants is confronted with the choice of reaching their food via two different routes of which one is much shorter than the other, their choice is entirely random. However, those who use the shorter route reach the food faster and therefore go back and forth more often between the anthill and the food.
[文件: Artificial ants.jpg | thumb | 400px | 当一群蚂蚁面临通过两条不同的路径获取食物的选择时，其中一条路径比另一条路径短得多，它们的选择完全是随机的。然而，那些使用较短的路线到达食物更快，因此往返于蚁丘和食物之间的频率更高。
In [[computer science]] and [[operations research]], the '''ant colony optimization''' [[algorithm]] ('''ACO''') is a [[probability|probabilistic]] technique for solving computational problems which can be reduced to finding good paths through [[Graph (discrete mathematics)|graph]]s. '''Artificial Ants''' stand for [[multi-agent]] methods inspired by the behavior of real ants.
In [[computer science]] and [[operations research]], the '''ant colony optimization''' [[algorithm]] ('''ACO''') is a [[probability|probabilistic]] technique for solving computational problems which can be reduced to finding good paths through [[Graph (discrete mathematics)|graph]]s. '''Artificial Ants''' stand for [[multi-agent]] methods inspired by the behavior of real ants.
The pheromone-based communication of biological [[ant]]s is often the predominant paradigm used.<ref>{{cite book |last = Monmarché Nicolas, Guinand Frédéric and Siarry Patrick |title = Artificial Ants |publisher = Wiley-ISTE |year = 2010 |isbn = 978-1-84821-194-0}}</ref> Combinations of Artificial Ants and [[local search (optimization)|local search]] algorithms have become a method of choice for numerous optimization tasks involving some sort of [[Graph (discrete mathematics)|graph]], e.g., [[vehicle routing problem|vehicle routing]] and internet [[routing]]. The burgeoning activity in this field has led to conferences dedicated solely to Artificial Ants, and to numerous commercial applications by specialized companies such as [[AntOptima]].
In the Ant Colony System algorithm, the original Ant System was modified in three aspects: (i) the edge selection is biased towards exploitation (i.e. favoring the probability of selecting the shortest edges with a large amount of pheromone); (ii) while building a solution, ants change the pheromone level of the edges they are selecting by applying a local pheromone updating rule; (iii) at the end of each iteration, only the best ant is allowed to update the trails by applying a modified global pheromone updating rule.]]
在蚁群算法中，对原有的蚁群算法进行了三方面的改进: (i)边缘选择偏向于挖掘(即边缘选择偏向于挖掘边缘)。(2)在建立解时，蚂蚁通过应用局部信息素更新规则来改变它们选择的边的信息素水平; (3)在每次迭代结束时，只允许最优的蚂蚁通过应用一个修正的全局信息素更新规则来更新路径
To optimize the form of antennas, ant colony algorithms can be used. As example can be considered antennas RFID-tags based on ant colony algorithms (ACO),
为了优化天线的形状，可以采用蚁群算法。作为例子可以考虑天线射频识别标签基于蚁群算法(ACO) ,
As an example, Ant colony optimization<ref>{{cite journal|last = Dorigo, Gambardella |first = M, L.M. |authorlink = M. Dorigo & L. M. Gambardella |title = Learning Approach to the Traveling Salesman Problem |publisher = IEEE Transactions on Evolutionary Computation, 1 (1) |page=214 |year = 1997}}</ref> is a class of [[optimization (computer science)|optimization]] [[algorithm]]s modeled on the actions of an [[ant colony]]. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a [[parameter space]] representing all possible solutions. Real ants lay down [[pheromone]]s directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions.<ref>Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 2004. {{ISBN|0-262-04219-3}}</ref> One variation on this approach is [[bees algorithm|the bees algorithm]], which is more analogous to the foraging patterns of the [[honey bee]], another social insect.
As an example, Ant colony optimization<ref>{{cite journal|last = Dorigo, Gambardella |first = M, L.M. |authorlink = M. Dorigo & L. M. Gambardella |title = Learning Approach to the Traveling Salesman Problem |publisher = IEEE Transactions on Evolutionary Computation, 1 (1) |page=214 |year = 1997}}</ref> is a class of [[optimization (computer science)|optimization]] [[algorithm]]s modeled on the actions of an [[ant colony]]. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a [[parameter space]] representing all possible solutions. Real ants lay down [[pheromone]]s directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions.<ref>Ant Colony Optimization by Marco Dorigo and Thomas Stützle, MIT Press, 2004. {{ISBN|0-262-04219-3}}</ref> One variation on this approach is [[bees algorithm|the bees algorithm]], which is more analogous to the foraging patterns of the [[honey bee]], another social insect.
This algorithm is a member of the '''ant colony algorithms''' family, in [[swarm intelligence]] methods, and it constitutes some [[metaheuristic]] optimizations. Initially proposed by [[Marco Dorigo]] in 1992 in his PhD thesis,<ref>A. Colorni, M. Dorigo et V. Maniezzo, ''Distributed Optimization by Ant Colonies'', actes de la première conférence européenne sur la vie artificielle, Paris, France, Elsevier Publishing, 134-142, 1991.</ref><ref name="M. Dorigo, Optimization, Learning and Natural Algorithms">M. Dorigo, ''Optimization, Learning and Natural Algorithms'', PhD thesis, Politecnico di Milano, Italy, 1992.</ref> the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of [[ants]] seeking a path between their [[ant colony|colony]] and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants. From a broader perspective, ACO performs a model-based search<ref>{{cite journal|last1=Zlochin|first1=Mark|last2=Birattari|first2=Mauro|last3=Meuleau|first3=Nicolas|last4=Dorigo|first4=Marco|title=Model-Based Search for Combinatorial Optimization: A Critical Survey|journal=Annals of Operations Research|date=1 October 2004|volume=131|issue=1–4|pages=373–395|doi=10.1023/B:ANOR.0000039526.52305.af|language=en|issn=0254-5330|citeseerx=10.1.1.3.427|s2cid=63137}}</ref> and shares some similarities with [[estimation of distribution algorithm]]s.
The ACO algorithm is used in image processing for image edge detection and edge linking.Randomly place <math>K</math> ants on the image <math>I_{M_1 M_2}</math> where <math>K= (M_1*M_2)^\tfrac{1}{2}</math> . Pheromone matrix <math>\tau_{(i,j)}</math> are initialized with a random value. The major challenge in the initialization process is determining the heuristic matrix.
将蚁群算法应用于图像处理中，实现了图像的边缘检测和边缘连接。随机地点 < math > k </math > 蚂蚁在图像 < math > i _ { m _ 1 m _ 2} </math > < math > > k = (m _ 1 * m _ 2) ^ tfrac {1}{2} </math > 。信息素矩阵 < math > tau _ {(i，j)} </math > 由一个随机值初始化。在初始化过程中的主要挑战是确定启发式矩阵。
==Overview==
There are various methods to determine the heuristic matrix. For the below example the heuristic matrix was calculated based on the local statistics:
确定启发式矩阵的方法有多种。对于下面的例子，启发式矩阵是根据当地统计数据计算出来的:
the local statistics at the pixel position (i,j).
像素位置(i，j)的局部统计。
In the natural world, ants of some species (initially) wander [[random]]ly, and upon finding food return to their colony while laying down [[pheromone]] trails. If other ants find such a path, they are likely not to keep travelling at random, but instead to follow the trail, returning and reinforcing it if they eventually find food (see [[Ant#Communication|Ant communication]]).<ref>{{cite book |last1=Fladerer |first1=Johannes-Paul |last2=Kurzmann |first2=Ernst |title=WISDOM OF THE MANY : how to create self -organisation and how to use collective... intelligence in companies and in society from mana. |date=November 2019 |publisher=BOOKS ON DEMAND |isbn=9783750422421}}</ref>
In the natural world, ants of some species (initially) wander [[random]]ly, and upon finding food return to their colony while laying down [[pheromone]] trails. If other ants find such a path, they are likely not to keep travelling at random, but instead to follow the trail, returning and reinforcing it if they eventually find food (see [[Ant#Communication|Ant communication]]).<ref>{{cite book |last1=Fladerer |first1=Johannes-Paul |last2=Kurzmann |first2=Ernst |title=WISDOM OF THE MANY : how to create self -organisation and how to use collective... intelligence in companies and in society from mana. |date=November 2019 |publisher=BOOKS ON DEMAND |isbn=9783750422421}}</ref>
<math>\eta_{(i,j)}= \tfrac{1}{Z}*Vc*I_{(i,j)}</math>
< math > eta _ (i，j)} = tfrac {1}{ z } * Vc _ (i，j)} </math >
Over time, however, the pheromone trail starts to evaporate, thus reducing its attractive strength. The more time it takes for an ant to travel down the path and back again, the more time the pheromones have to evaporate. A short path, by comparison, gets marched over more frequently, and thus the pheromone density becomes higher on shorter paths than longer ones. Pheromone evaporation also has the advantage of avoiding the convergence to a locally optimal solution. If there were no evaporation at all, the paths chosen by the first ants would tend to be excessively attractive to the following ones. In that case, the exploration of the solution space would be constrained. The influence of pheromone evaporation in real ant systems is unclear, but it is very important in artificial systems.<ref>Marco Dorigo and Thomas Stültze, Ant Colony Optimization, p.12. 2004.</ref>
Over time, however, the pheromone trail starts to evaporate, thus reducing its attractive strength. The more time it takes for an ant to travel down the path and back again, the more time the pheromones have to evaporate. A short path, by comparison, gets marched over more frequently, and thus the pheromone density becomes higher on shorter paths than longer ones. Pheromone evaporation also has the advantage of avoiding the convergence to a locally optimal solution. If there were no evaporation at all, the paths chosen by the first ants would tend to be excessively attractive to the following ones. In that case, the exploration of the solution space would be constrained. The influence of pheromone evaporation in real ant systems is unclear, but it is very important in artificial systems.<ref>Marco Dorigo and Thomas Stültze, Ant Colony Optimization, p.12. 2004.</ref>
Where <math>I</math> is the image of size <math>M_1*M_2</math><br />
大小如下的图像在哪里
The overall result is that when one ant finds a good (i.e., short) path from the colony to a food source, other ants are more likely to follow that path, and [[positive feedback]] eventually leads to many ants following a single path. The idea of the ant colony algorithm is to mimic this behavior with "simulated ants" walking around the graph representing the problem to solve.
The overall result is that when one ant finds a good (i.e., short) path from the colony to a food source, other ants are more likely to follow that path, and [[positive feedback]] eventually leads to many ants following a single path. The idea of the ant colony algorithm is to mimic this behavior with "simulated ants" walking around the graph representing the problem to solve.
<math>Z =\sum_{i=1:M_1} \sum_{j=1:M_2} Vc(I_{i,j})</math>, which is a normalization factor
[ math ] z = sum { i = 1: m _ 1} sum { j = 1: m _ 2} Vc (i _ { i，j }) </math > ，这是一个归一化因子
===Ambient networks of intelligent objects===
===Ambient networks of intelligent objects===
<math>\begin{align}Vc(I_{i,j}) = &f \left( \left\vert I_{(i-2,j-1)} - I_{(i+2,j+1)} \right\vert + \left\vert I_{(i-2,j+1)} - I_{(i+2,j-1)} \right\vert \right. \\
< math > begin { align } Vc (i _ { i，j }) = & f left (left vert i _ {(i-2，j-1)}-i _ {(i + 2，j + 1)}右垂直 + 左垂直 i _ {(i-2，j + 1)}-i _ (i + 2，j-1)}右垂直。\\
New concepts are required since “intelligence” is no longer centralized but can be found throughout all minuscule objects. Anthropocentric concepts have been known to lead to the production of IT systems in which data processing, control units and calculating forces are centralized. These centralized units have continually increased their performance and can be compared to the human brain. The model of the brain has become the ultimate vision of computers. [[Ambient networks]] of intelligent objects and, sooner or later, a new generation of information systems which are even more diffused and based on nanotechnology, will profoundly change this concept. Small devices that can be compared to insects do not dispose of a high intelligence on their own. Indeed, their intelligence can be classed as fairly limited. It is, for example, impossible to integrate a high performance calculator with the power to solve any kind of mathematical problem into a biochip that is implanted into the human body or integrated in an intelligent tag which is designed to trace commercial articles. However, once those objects are interconnected they dispose of a form of intelligence that can be compared to a colony of ants or bees. In the case of certain problems, this type of intelligence can be superior to the reasoning of a centralized system similar to the brain.<ref name="Waldner 2008 214">{{cite book |last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Nanocomputers and Swarm Intelligence |publisher = [[ISTE Ltd|ISTE]] John Wiley & Sons |place = London |year = 2008 |isbn = 978-1-84704-002-2 | page = 214}}</ref>
New concepts are required since “intelligence” is no longer centralized but can be found throughout all minuscule objects. Anthropocentric concepts have been known to lead to the production of IT systems in which data processing, control units and calculating forces are centralized. These centralized units have continually increased their performance and can be compared to the human brain. The model of the brain has become the ultimate vision of computers. [[Ambient networks]] of intelligent objects and, sooner or later, a new generation of information systems which are even more diffused and based on nanotechnology, will profoundly change this concept. Small devices that can be compared to insects do not dispose of a high intelligence on their own. Indeed, their intelligence can be classed as fairly limited. It is, for example, impossible to integrate a high performance calculator with the power to solve any kind of mathematical problem into a biochip that is implanted into the human body or integrated in an intelligent tag which is designed to trace commercial articles. However, once those objects are interconnected they dispose of a form of intelligence that can be compared to a colony of ants or bees. In the case of certain problems, this type of intelligence can be superior to the reasoning of a centralized system similar to the brain.<ref name="Waldner 2008 214">{{cite book |last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Nanocomputers and Swarm Intelligence |publisher = [[ISTE Ltd|ISTE]] John Wiley & Sons |place = London |year = 2008 |isbn = 978-1-84704-002-2 | page = 214}}</ref>
& +\left\vert I_{(i-1,j-2)} - I_{(i+1,j+2)} \right\vert + \left\vert I_{(i-1,j-1)} - I_{(i+1,j+1)} \right\vert\\
& +\left\vert I_{(i-1,j-2)} - I_{(i+1,j+2)} \right\vert + \left\vert I_{(i-1,j-1)} - I_{(i+1,j+1)} \right\vert\\
& +\left\vert I_{(i-1,j)} - I_{(i+1,j)} \right\vert + \left\vert I_{(i-1,j+1)} - I_{(i-1,j-1)} \right\vert\\
& +\left\vert I_{(i-1,j)} - I_{(i+1,j)} \right\vert + \left\vert I_{(i-1,j+1)} - I_{(i-1,j-1)} \right\vert\\
Nature offers several examples of how minuscule organisms, if they all follow the same basic rule, can create a form of [[collective intelligence]] on the macroscopic level. Colonies of social insects perfectly illustrate this model which greatly differs from human societies. This model is based on the co-operation of independent units with simple and unpredictable behavior.<ref>{{cite book|last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Inventer l'Ordinateur du XXIème Siècle |publisher = [[Hermes Science]] |place = London |year = 2007 | pages = 259–265 |isbn = 978-2-7462-1516-0}}</ref> They move through their surrounding area to carry out certain tasks and only possess a very limited amount of information to do so. A colony of ants, for example, represents numerous qualities that can also be applied to a network of ambient objects. Colonies of ants have a very high capacity to adapt themselves to changes in the environment as well as an enormous strength in dealing with situations where one individual fails to carry out a given task. This kind of flexibility would also be very useful for mobile networks of objects which are perpetually developing. Parcels of information that move from a computer to a digital object behave in the same way as ants would do. They move through the network and pass from one knot to the next with the objective of arriving at their final destination as quickly as possible.<ref>{{cite book |last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Nanocomputers and Swarm Intelligence |publisher = ISTE John Wiley & Sons |place = London |year = 2008 |isbn = 978-1-84704-002-2 | page = 215}}</ref>
Nature offers several examples of how minuscule organisms, if they all follow the same basic rule, can create a form of [[collective intelligence]] on the macroscopic level. Colonies of social insects perfectly illustrate this model which greatly differs from human societies. This model is based on the co-operation of independent units with simple and unpredictable behavior.<ref>{{cite book|last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Inventer l'Ordinateur du XXIème Siècle |publisher = [[Hermes Science]] |place = London |year = 2007 | pages = 259–265 |isbn = 978-2-7462-1516-0}}</ref> They move through their surrounding area to carry out certain tasks and only possess a very limited amount of information to do so. A colony of ants, for example, represents numerous qualities that can also be applied to a network of ambient objects. Colonies of ants have a very high capacity to adapt themselves to changes in the environment as well as an enormous strength in dealing with situations where one individual fails to carry out a given task. This kind of flexibility would also be very useful for mobile networks of objects which are perpetually developing. Parcels of information that move from a computer to a digital object behave in the same way as ants would do. They move through the network and pass from one knot to the next with the objective of arriving at their final destination as quickly as possible.<ref>{{cite book |last = Waldner |first = Jean-Baptiste |authorlink = Jean-Baptiste Waldner |title = Nanocomputers and Swarm Intelligence |publisher = ISTE John Wiley & Sons |place = London |year = 2008 |isbn = 978-1-84704-002-2 | page = 215}}</ref>
& + \left. \left\vert I_{(i-1,j+2)} - I_{(i-1,j-2)} \right\vert + \left\vert I_{(i,j-1)} - I_{(i,j+1)} \right\vert \right) \end{align}</math>
左边。(i-1，j + 2)}-i _ {(i-1，j-2)}右 vert + 左 vert i _ {(i，j-1)}-i _ {(i，j + 1)}右 vert 右 vert { align } </math >
===Artificial pheromone system===
===Artificial pheromone system===
<math>f(\cdot)</math> can be calculated using the following functions:<br /><math>f(x) = \lambda x, \quad \text{for x ≥ 0; (1)} </math><br /><math>f(x) = \lambda x^2, \quad \text{for x ≥ 0; (2)} </math><br /><math>f(x) =
< math > f (cdot) </math > 可以用以下函数计算: < br/> < math > f (x) = lambda x，quad text { for x ≥0; (1)} </math > < br/> < math > f (x) = lambda x ^ 2，quad text { for x ≥0; (2)} </math > < br/> < math > f (x) =
Pheromone-based communication is one of the most effective ways of communication which is widely observed in nature. Pheromone is used by social insects such as
Pheromone-based communication is one of the most effective ways of communication which is widely observed in nature. Pheromone is used by social insects such as
\begin{cases}
开始{ cases }
bees, ants and termites; both for inter-agent and agent-swarm communications. Due to its feasibility, artificial pheromones have been adopted in multi-robot and swarm robotic systems. Pheromone-based communication was implemented by different means such as chemical <ref>Lima, Danielli A., and Gina MB Oliveira. "[https://doi.org/10.1016/j.apm.2017.03.021 A cellular automata ant memory model of foraging in a swarm of robots]." Applied Mathematical Modelling 47, 2017: 551-572.</ref><ref>Russell, R. Andrew. "[https://ieeexplore.ieee.org/abstract/document/774005/ Ant trails-an example for robots to follow?]." Robotics and Automation, 1999. Proceedings. 1999 IEEE International Conference on. Vol. 4. IEEE, 1999.</ref><ref>Fujisawa, Ryusuke, et al. "[https://www.researchgate.net/profile/Shigeto_Dobata/publication/265053113_Designing_pheromone_communication_in_swarm_robotics_Group_foraging_behavior_mediated_by_chemical_substance/links/551500f60cf260a7cb2e39eb.pdf Designing pheromone communication in swarm robotics: Group foraging behavior mediated by chemical substance]." Swarm Intelligence 8.3 (2014): 227-246.</ref> or physical (RFID tags,<ref>Sakakibara, Toshiki, and Daisuke Kurabayashi. "[https://link.springer.com/article/10.1016/S1672-6529(07)60038-9 Artificial pheromone system using rfid for navigation of autonomous robots]." Journal of Bionic Engineering 4.4 (2007): 245-253.</ref> light,<ref>Arvin, Farshad, et al. "[http://eprints.lincoln.ac.uk/22466/7/Aggregation-Final.pdf Investigation of cue-based aggregation in static and dynamic environments with a mobile robot swarm]." Adaptive Behavior (2016): 1-17.</ref><ref>Farshad Arvin, et al. "[https://www.researchgate.net/profile/Masoud_Bekravi/publication/241683938_Imitation_of_Honeybee_Aggregation_with_Collective_Behavior_of_Swarm_Robots/links/546518320cf25b85d17d2587/Imitation-of-Honeybee-Aggregation-with-Collective-Behavior-of-Swarm-Robots.pdf Imitation of honeybee aggregation with collective behavior of swarm robots]." International Journal of Computational Intelligence Systems 4.4 (2011): 739-748.</ref><ref>Schmickl, Thomas, et al. "[http://swarmrobot.org/publications/Get_in_touch.pdf Get in touch: cooperative decision making based on robot-to-robot collisions]." Autonomous Agents and Multi-Agent Systems 18.1 (2009): 133-155.</ref><ref>Garnier, Simon, et al. "[http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1002903 Do ants need to estimate the geometrical properties of trail bifurcations to find an efficient route? A swarm robotics test bed.]" PLoS Comput Biol 9.3 (2013): e1002903.</ref> sound<ref>Arvin, Farshad, et al. "[https://www.researchgate.net/profile/Farshad_Arvin/publication/273892103_Cue-based_aggregation_with_a_mobile_robot_swarm_A_novel_fuzzy-based_method/links/55e4b97a08ae6abe6e9031be/Cue-based-aggregation-with-a-mobile-robot-swarm-A-novel-fuzzy-based-method.pdf Cue-based aggregation with a mobile robot swarm: a novel fuzzy-based method]." Adaptive Behavior 22.3 (2014): 189-206.</ref>) ways. However, those implementations were not able to replicate all the aspects of pheromones as seen in nature.
bees, ants and termites; both for inter-agent and agent-swarm communications. Due to its feasibility, artificial pheromones have been adopted in multi-robot and swarm robotic systems. Pheromone-based communication was implemented by different means such as chemical <ref>Lima, Danielli A., and Gina MB Oliveira. "[https://doi.org/10.1016/j.apm.2017.03.021 A cellular automata ant memory model of foraging in a swarm of robots]." Applied Mathematical Modelling 47, 2017: 551-572.</ref><ref>Russell, R. Andrew. "[https://ieeexplore.ieee.org/abstract/document/774005/ Ant trails-an example for robots to follow?]." Robotics and Automation, 1999. Proceedings. 1999 IEEE International Conference on. Vol. 4. IEEE, 1999.</ref><ref>Fujisawa, Ryusuke, et al. "[https://www.researchgate.net/profile/Shigeto_Dobata/publication/265053113_Designing_pheromone_communication_in_swarm_robotics_Group_foraging_behavior_mediated_by_chemical_substance/links/551500f60cf260a7cb2e39eb.pdf Designing pheromone communication in swarm robotics: Group foraging behavior mediated by chemical substance]." Swarm Intelligence 8.3 (2014): 227-246.</ref> or physical (RFID tags,<ref>Sakakibara, Toshiki, and Daisuke Kurabayashi. "[https://link.springer.com/article/10.1016/S1672-6529(07)60038-9 Artificial pheromone system using rfid for navigation of autonomous robots]." Journal of Bionic Engineering 4.4 (2007): 245-253.</ref> light,<ref>Arvin, Farshad, et al. "[http://eprints.lincoln.ac.uk/22466/7/Aggregation-Final.pdf Investigation of cue-based aggregation in static and dynamic environments with a mobile robot swarm]." Adaptive Behavior (2016): 1-17.</ref><ref>Farshad Arvin, et al. "[https://www.researchgate.net/profile/Masoud_Bekravi/publication/241683938_Imitation_of_Honeybee_Aggregation_with_Collective_Behavior_of_Swarm_Robots/links/546518320cf25b85d17d2587/Imitation-of-Honeybee-Aggregation-with-Collective-Behavior-of-Swarm-Robots.pdf Imitation of honeybee aggregation with collective behavior of swarm robots]." International Journal of Computational Intelligence Systems 4.4 (2011): 739-748.</ref><ref>Schmickl, Thomas, et al. "[http://swarmrobot.org/publications/Get_in_touch.pdf Get in touch: cooperative decision making based on robot-to-robot collisions]." Autonomous Agents and Multi-Agent Systems 18.1 (2009): 133-155.</ref><ref>Garnier, Simon, et al. "[http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1002903 Do ants need to estimate the geometrical properties of trail bifurcations to find an efficient route? A swarm robotics test bed.]" PLoS Comput Biol 9.3 (2013): e1002903.</ref> sound<ref>Arvin, Farshad, et al. "[https://www.researchgate.net/profile/Farshad_Arvin/publication/273892103_Cue-based_aggregation_with_a_mobile_robot_swarm_A_novel_fuzzy-based_method/links/55e4b97a08ae6abe6e9031be/Cue-based-aggregation-with-a-mobile-robot-swarm-A-novel-fuzzy-based-method.pdf Cue-based aggregation with a mobile robot swarm: a novel fuzzy-based method]." Adaptive Behavior 22.3 (2014): 189-206.</ref>) ways. However, those implementations were not able to replicate all the aspects of pheromones as seen in nature.
\sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (3)} \\
Sin (frac { pi x }{2 lambda }) ，& text { for 0≤ x ≤} lambda text { ; (3)}
0, & \text{else}
0，& text { else }
Using projected light was presented in an 2007 IEEE paper by Garnier, Simon, et al.<ref>Garnier, Simon, et al. "[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.716.1460&rep=rep1&type=pdf Alice in pheromone land: An experimental setup for the study of ant-like robots]." 2007 IEEE Swarm Intelligence Symposium. IEEE, 2007.</ref> as an experimental setup to study pheromone-based communication with micro autonomous robots. Another study that proposed a novel pheromone communication method, ''COSΦ'',<ref>Farshad Arvin et al. "[http://eprints.lincoln.ac.uk/17957/1/APH-colias.pdf COSΦ: artificial pheromone system for robotic swarms research]." IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2015.</ref> for a swarm robotic system is based on precise and fast visual localization.<ref>Krajník, Tomáš, et al. "[http://eprints.lincoln.ac.uk/13653/1/jint_2014_public.pdf A practical multirobot localization system]." Journal of Intelligent & Robotic Systems 76.3-4 (2014): 539-562.</ref>
Using projected light was presented in an 2007 IEEE paper by Garnier, Simon, et al.<ref>Garnier, Simon, et al. "[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.716.1460&rep=rep1&type=pdf Alice in pheromone land: An experimental setup for the study of ant-like robots]." 2007 IEEE Swarm Intelligence Symposium. IEEE, 2007.</ref> as an experimental setup to study pheromone-based communication with micro autonomous robots. Another study that proposed a novel pheromone communication method, ''COSΦ'',<ref>Farshad Arvin et al. "[http://eprints.lincoln.ac.uk/17957/1/APH-colias.pdf COSΦ: artificial pheromone system for robotic swarms research]." IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2015.</ref> for a swarm robotic system is based on precise and fast visual localization.<ref>Krajník, Tomáš, et al. "[http://eprints.lincoln.ac.uk/13653/1/jint_2014_public.pdf A practical multirobot localization system]." Journal of Intelligent & Robotic Systems 76.3-4 (2014): 539-562.</ref>
\end{cases}</math><br /><math>f(x) =
结束{ cases } </math > < br/> < math > f (x) =
The system allows simulation of a virtually unlimited number of different pheromones and provides the result of their interaction as a gray-scale image on a horizontal LCD screen that the robots move on. In order to demonstrate the pheromone communication method, Colias autonomous micro robot was deployed as the swarm robotic platform.{{Citation needed|date=December 2019|reason=removed citation to predatory publisher content}}
The system allows simulation of a virtually unlimited number of different pheromones and provides the result of their interaction as a gray-scale image on a horizontal LCD screen that the robots move on. In order to demonstrate the pheromone communication method, Colias autonomous micro robot was deployed as the swarm robotic platform.{{Citation needed|date=December 2019|reason=removed citation to predatory publisher content}}
\begin{cases}
开始{ cases }
\pi x \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (4)} \\
\pi x \sin(\frac{\pi x}{2 \lambda}), & \text{for 0 ≤ x ≤} \lambda \text{; (4)} \\
==Algorithm and formulae==
==Algorithm and formulae==
0, & \text{else}
0，& text { else }
In the ant colony optimization algorithms, an artificial ant is a simple computational agent that searches for good solutions to a given optimization problem. To apply an ant colony algorithm, the optimization problem needs to be converted into the problem of finding the [[shortest path problem|shortest path]] on a weighted graph. In the first step of each iteration, each ant stochastically constructs a solution, i.e. the order in which the edges in the graph should be followed. In the second step, the paths found by the different ants are compared. The last step consists of updating the pheromone levels on each edge.
In the ant colony optimization algorithms, an artificial ant is a simple computational agent that searches for good solutions to a given optimization problem. To apply an ant colony algorithm, the optimization problem needs to be converted into the problem of finding the [[shortest path problem|shortest path]] on a weighted graph. In the first step of each iteration, each ant stochastically constructs a solution, i.e. the order in which the edges in the graph should be followed. In the second step, the paths found by the different ants are compared. The last step consists of updating the pheromone levels on each edge.
\end{cases}</math><br />The parameter <math>\lambda</math> in each of above functions adjusts the functions’ respective shapes.<br />Step 2 Construction process:<br />The ant's movement is based on 4-connected pixels or 8-connected pixels. The probability with which the ant moves is given by the probability equation <math>P_{x,y}</math><br />Step 3 and Step 5 Update process:<br />The pheromone matrix is updated twice. in step 3 the trail of the ant (given by <math>\tau_{(x,y)}</math> ) is updated where as in step 5 the evaporation rate of the trail is updated which is given by the below equation.<br /><math>
上面每个函数中的参数 < math > lambda </math > 调整函数各自的形状。< br/> 步骤2构建过程: < br/> 蚂蚁的移动是基于4个连接的像素或8个连接的像素。根据概率方程 < math > p _ { x，y } </math > < br/> 步骤3和步骤5更新过程给出蚂蚁移动的概率: < br/> 信息素矩阵更新两次。在步骤3中，蚂蚁的踪迹(由 < math > tau _ {(x，y)} </math > 给出)被更新，在步骤5中，蚂蚁的踪迹蒸发率被更新，这个更新是由下面的方程给出的。[数学]
\tau_{new} \leftarrow
左塔罗
'''procedure''' ACO_MetaHeuristic '''is'''
'''procedure''' ACO_MetaHeuristic '''is'''
(1-\psi)\tau_{old} + \psi \tau_{0}
(1-psi) tau _ { old } + psi tau _ {0}
'''while''' not_termination '''do'''
'''while''' not_termination '''do'''
</math>, where <math>\psi</math> is the pheromone decay coefficient <math>0< \tau <1</math>
这里是信息素衰变系数
generateSolutions()
generateSolutions()
daemonActions()
daemonActions()
Step 7 Decision Process:<br />Once the K ants have moved a fixed distance L for N iteration, the decision whether it is an edge or not is based on the threshold T on the pheromone matrixτ. Threshold for the below example is calculated based on Otsu's method.
步骤7决策过程: 一旦 k 蚂蚁在 n 次迭代中移动了一个固定的距离 l，判断它是否是一个边缘是基于信息素矩阵 τ 上的阈值 t。下面例子的阈值是根据 Otsu 的方法计算的。
pheromoneUpdate()
pheromoneUpdate()
'''repeat'''
'''repeat'''
Image Edge detected using ACO:<br />The images below are generated using different functions given by the equation (1) to (4). which is a very general framework in which ant colony algorithms fit.
使用 ACO 检测图像边缘: < br/> 下面的图像是使用方程(1)至(4)给出的不同函数生成的。这是一个非常普遍的框架，蚁群算法适合。
end procedure
end procedure
===Edge selection===
There is in practice a large number of algorithms claiming to be "ant colonies", without always sharing the general framework of optimization by canonical ant colonies.). A technical report extracted from the thesis and co-authored by V. Maniezzo and A. Colorni
在实践中，有大量的算法声称是“蚁群” ，但并不总是共享规范的蚁群优化的一般框架。).摘自论文的技术报告，由 v. Maniezzo 和 a. Colorni 合著
Each ant needs to construct a solution to move through the graph. To select the next edge in its tour, an ant will consider the length of each edge available from its current position, as well as the corresponding pheromone level. At each step of the algorithm, each ant moves from a state <math>x</math> to state <math>y</math>, corresponding to a more complete intermediate solution. Thus, each ant <math>k</math> computes a set <math>A_k(x)</math> of feasible expansions to its current state in each iteration, and moves to one of these in probability. For ant <math>k</math>, the probability <math>p_{xy}^k</math> of moving from state <math>x</math> to state <math>y</math> depends on the combination of two values, the ''attractiveness'' <math>\eta_{xy}</math> of the move, as computed by some heuristic indicating the ''a priori'' desirability of that move and the ''trail level'' <math>\tau_{xy}</math> of the move, indicating how proficient it has been in the past to make that particular move. The ''trail level'' represents a posteriori indication of the desirability of that move.
Each ant needs to construct a solution to move through the graph. To select the next edge in its tour, an ant will consider the length of each edge available from its current position, as well as the corresponding pheromone level. At each step of the algorithm, each ant moves from a state <math>x</math> to state <math>y</math>, corresponding to a more complete intermediate solution. Thus, each ant <math>k</math> computes a set <math>A_k(x)</math> of feasible expansions to its current state in each iteration, and moves to one of these in probability. For ant <math>k</math>, the probability <math>p_{xy}^k</math> of moving from state <math>x</math> to state <math>y</math> depends on the combination of two values, the ''attractiveness'' <math>\eta_{xy}</math> of the move, as computed by some heuristic indicating the ''a priori'' desirability of that move and the ''trail level'' <math>\tau_{xy}</math> of the move, indicating how proficient it has been in the past to make that particular move. The ''trail level'' represents a posteriori indication of the desirability of that move.
In general, the <math>k</math>th ant moves from state <math>x</math> to state <math>y</math> with probability
In general, the <math>k</math>th ant moves from state <math>x</math> to state <math>y</math> with probability
<math>
<math>
p_{xy}^k =
p_{xy}^k =
\frac
\frac
{ (\tau_{xy}^{\alpha}) (\eta_{xy}^{\beta}) }
{ (\tau_{xy}^{\alpha}) (\eta_{xy}^{\beta}) }
{ \sum_{z\in \mathrm{allowed}_x} (\tau_{xz}^{\alpha}) (\eta_{xz}^{\beta}) }
{ \sum_{z\in \mathrm{allowed}_x} (\tau_{xz}^{\alpha}) (\eta_{xz}^{\beta}) }
</math>
</math>
where
where
<math>\tau_{xy}</math> is the amount of pheromone deposited for transition from state <math>x</math> to <math>y</math>, 0 ≤ <math>\alpha</math> is a parameter to control the influence of <math>\tau_{xy}</math>, <math>\eta_{xy}</math> is the desirability of state transition <math>xy</math> (''a priori'' knowledge, typically <math>1/d_{xy}</math>, where <math>d</math> is the distance) and <math>\beta</math> ≥ 1 is a parameter to control the influence of <math>\eta_{xy}</math>. <math>\tau_{xz}</math> and <math>\eta_{xz}</math> represent the trail level and attractiveness for the other possible state transitions.
<math>\tau_{xy}</math> is the amount of pheromone deposited for transition from state <math>x</math> to <math>y</math>, 0 ≤ <math>\alpha</math> is a parameter to control the influence of <math>\tau_{xy}</math>, <math>\eta_{xy}</math> is the desirability of state transition <math>xy</math> (''a priori'' knowledge, typically <math>1/d_{xy}</math>, where <math>d</math> is the distance) and <math>\beta</math> ≥ 1 is a parameter to control the influence of <math>\eta_{xy}</math>. <math>\tau_{xz}</math> and <math>\eta_{xz}</math> represent the trail level and attractiveness for the other possible state transitions.
Trails are usually updated when all ants have completed their solution, increasing or decreasing the level of trails corresponding to moves that were part of "good" or "bad" solutions, respectively. An example of a global pheromone updating rule is
Trails are usually updated when all ants have completed their solution, increasing or decreasing the level of trails corresponding to moves that were part of "good" or "bad" solutions, respectively. An example of a global pheromone updating rule is
<math>
<math>
\tau_{xy} \leftarrow
\tau_{xy} \leftarrow
(1-\rho)\tau_{xy} + \sum_{k}\Delta \tau^{k}_{xy}
(1-\rho)\tau_{xy} + \sum_{k}\Delta \tau^{k}_{xy}
</math>
</math>
where <math>\tau_{xy}</math> is the amount of pheromone deposited for a state transition <math>xy</math>, <math>\rho</math> is the ''pheromone evaporation coefficient'' and <math>\Delta \tau^{k}_{xy}</math> is the amount of pheromone deposited by <math>k</math>th ant, typically given for a [[Travelling salesman problem|TSP]] problem (with moves corresponding to arcs of the graph) by
where <math>\tau_{xy}</math> is the amount of pheromone deposited for a state transition <math>xy</math>, <math>\rho</math> is the ''pheromone evaporation coefficient'' and <math>\Delta \tau^{k}_{xy}</math> is the amount of pheromone deposited by <math>k</math>th ant, typically given for a [[Travelling salesman problem|TSP]] problem (with moves corresponding to arcs of the graph) by
<math>
<math>
\Delta \tau^{k}_{xy} =
\Delta \tau^{k}_{xy} =
\begin{cases}
\begin{cases}
Q/L_k & \mbox{if ant }k\mbox{ uses curve }xy\mbox{ in its tour} \\
Q/L_k & \mbox{if ant }k\mbox{ uses curve }xy\mbox{ in its tour} \\
0 & \mbox{otherwise}
0 & \mbox{otherwise}
\end{cases}
\end{cases}
</math>
</math>
where <math>L_k</math> is the cost of the <math>k</math>th ant's tour (typically length) and <math>Q</math> is a constant.
where <math>L_k</math> is the cost of the <math>k</math>th ant's tour (typically length) and <math>Q</math> is a constant.
Here are some of the most popular variations of ACO algorithms.
Here are some of the most popular variations of ACO algorithms.
The Ant System is the first ACO algorithm. This algorithm corresponds to the one presented above. It was developed by Dorigo.<ref name="Ant system" />
The Ant System is the first ACO algorithm. This algorithm corresponds to the one presented above. It was developed by Dorigo.<ref name="Ant system" />
In the Ant Colony System algorithm, the original Ant System was modified in three aspects: (i) the edge selection is biased towards exploitation (i.e. favoring the probability of selecting the shortest edges with a large amount of pheromone); (ii) while building a solution, ants change the pheromone level of the edges they are selecting by applying a local pheromone updating rule; (iii) at the end of each iteration, only the best ant is allowed to update the trails by applying a modified global pheromone updating rule.<ref name="M. Dorigo et L.M. Gambardella">M. Dorigo et L.M. Gambardella, ''[http://www.idsia.ch/~luca/acs-ec97.pdf Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem]'', IEEE Transactions on Evolutionary Computation, volume 1, numéro 1, pages 53-66, 1997.</ref>
In the Ant Colony System algorithm, the original Ant System was modified in three aspects: (i) the edge selection is biased towards exploitation (i.e. favoring the probability of selecting the shortest edges with a large amount of pheromone); (ii) while building a solution, ants change the pheromone level of the edges they are selecting by applying a local pheromone updating rule; (iii) at the end of each iteration, only the best ant is allowed to update the trails by applying a modified global pheromone updating rule.<ref name="M. Dorigo et L.M. Gambardella">M. Dorigo et L.M. Gambardella, ''[http://www.idsia.ch/~luca/acs-ec97.pdf Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem]'', IEEE Transactions on Evolutionary Computation, volume 1, numéro 1, pages 53-66, 1997.</ref>
Category:Articles which contain graphical timelines
Category:Articles which contain graphical timelines
类别: 包含图形时间表的文章
类别: 包含图形时间表的文章
===Elitist Ant System===
Category:Nature-inspired metaheuristics
Category:Nature-inspired metaheuristics
类别: 自然启发的启发式元推理
类别: 自然启发的启发式元推理
In this algorithm, the global best solution deposits pheromone on its trail after every iteration (even if this trail has not been revisited), along with all the other ants.
Category:Optimization algorithms and methods
Category:Optimization algorithms and methods