In this paper we present a new algorithm based on ant colony metaphor for examining numerical optimization problems. The ants’ search behavior consists of a parallel searches on distributed randomly points. Using synergetic effect and tandem running ants try to calibrate with another ants to exchange information about the fruitful positions of search space. The position of the searching point i...

Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...

Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ants may need to get together; however, they may not know the locations of other ants. Hence, we focus on an ant variant of the rendezvous problem, in which two ants are to be brought to the same location in finite tim...

An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. This is a distributed algorithm composed by a set of cooperating agents called ants which cooperate among them to find good solutions to combinatorial optimization problems. The cooperation follows the behavior of real ants using an indirect form of communication med...

Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...

Ant algorithms are usually derived from a stochastic modeling based on some specific probability laws. We consider in this paper a full deterministic model of “logistic ants” which uses chaotic maps to govern the behavior of the artificial ants. We illustrate and test this approach on a TSP instance, and compare the results with the original Ant System algorithm. This change of paradigm —determ...

Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness Problem. Compared to an existing ACO algorithm for the unweighted Total Tar-diness Problem our algorithm has several improvements. The main novelty is that in our algorithm the ants are guided on their way to good so...

This study presents a new algorithm based on ant colony optimization for load balancing management in grid computing. The concentration is on improving the way ants search the best resources in terms of minimizing the processing time of each job and at the same time balancing the workload on available resources. An enhanced technique is proposed for the pheromone update activities. Single colon...

Abstract: In order to find a common approach to plan the turning of a bio-inspired hexapod robot, a locomotion strategy for turning and deviation correction of a hexapod walking robot based on the biological behavior and sensory strategy of ants. A series of experiments using ants were carried out where the gait and the movement form of ants was studied. Taking the results of the ant experiment...

These last years a new model of cooperative algorithm appeared , the model of ants colonies. This paper is dedicated to the integration of an ants colony's based cooperation method, in another algorithm, here research tabu, opposite the rough use of the computing power placed at the disposal on the current networks. The algorithms that we present are applied to the resolution of quadratic assig...