The self-organization behavior exhibited by ants may be modeled to solve real world clustering problems. The general idea of artificial ants walking around in search space to pick up, or drop an item based upon some probability measure has been examined to cluster a large number of World Wide Web (WWW) documents. However, this idea is extended with the direct application of template matching wi...

In this paper, we propose a novel method for image segmentation that we call ACS-MRF method. ACS-MRF is a hybrid ant colony system coupled with a local search. We show how a colony of cooperating ants are able to estimate the labels field and minimize the MAP estimate. Cooperation between ants is performed by exchanging information through pheromone updating. The obtained results show the effic...

Consider the following problem. An unknown number k of ants, initially located at the nest, searches the plane for a treasure. The identical, deterministic ants take steps asynchronously, until eventually an ant moves onto the location of the treasure. The only means to record the progress of the search is by marking each explored grid point with a pheromone. It is well-known that ants have thi...

In this work the hybrid Ant Colony Optimization (ACO) [1] algorithm PLANTS [2][3][4] (Protein-Ligand ANT System) for the task of structureand ligand-based drug design is introduced. Like other ACO-based approaches it is inspired by the behaviour of real ants finding a shortest path between their nest and a food source. The ants use indirect communication in the form of pheromone trails, which m...

A multi-colony ant system (MAS) is proposed for the combinatorial optimization problems. The proposed MAS is inspired by the knowledge that there are many colonies of ants in the natural world and organized with multiple colonies of ants. At first, ants perform solution search procedure by cooperating with each other in the same colony until no better solution is found after a certain time peri...

In Ant Colony Optimization (ACO) artiicial ants communicate by laying synthetic pheromone along the edges on their path through a decision graph. This attracts following ants so that they will likely search in the same region of the search space. The problem of how the pheromone information should be evaluated in ant systems is studied in this paper. The standard approach for pheromone evaluati...

A modified ant-based edge detector is presented. It is based on the distribution of ants on an image. Ants try to find possible edges by using a heuristic function based on 3x3 ideal edge structures. Visual comparisons show that the modified algorithm gives finer details and thinner edges at lesser computational times when compared to earlier ant-based approaches. When compared to standard edge...

Ant colony optimization is an ant algorithm framework that took inspiration from foraging behavior of ant colonies. Indeed, ACO algorithms use a chemical communication, represented by pheromone trails, to build good solutions. However, ants involve different communication channels to interact. Thus, this paper introduces the acoustic communication between ants while they are foraging. This proc...

It is important to reduce the mean transfer time of network, thus the routing algorithm designed to get load balancing is required. In such algorithms, every node must have following functionalities: getting network traffic information, and updating the routing table to reflect traffic information provided for node. In this paper we describe a routing algorithm for load balancing. Our algorithm...

To solve the cloud computing resource scheduling problem in IaaS platform, a scheduling model based on ant colony algorithm was proposed. In this model, pheromone changes dynamically according to the best route searched by ants. This model automatically updates pheromones and guides ants to search the global best route. Experiment results show that the proposed model is of better ability in ene...