ACODA is a truly distributed framework for Ant Colony Optimization. ACODA is heavily using message passing, so communication costs are quite high. In this paper we formulate the optimization of communication costs in ACODA as a mathematical optimization problem. We analyze the feasibility of its solution using Simulated Annealing.

This article proposed one kind based on the ant colony algorithm routing algorithm in wireless sensor networks. According to the election of cluster head node energy, and the use of ant colony algorithm is simple and easy to implement, support for multiple path characteristics, through the adjacent cluster-heads mutual exchange between the respective distances and residual energy value informat...

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions

Chest computed tomography (CT) is the most commonly used technique for the inspection of lung lesions. However, the lobe fissures in lung CT is still difficult to observe owing to its imaging structure. Therefore, in this paper, we aimed to develop an efficient tracking framework to extract the lobe fissures by the proposed modified ant colony optimization (ACO) algorithm. We used the method of...

In this paper the analogy between biological swarms and artificial multiagent systems is pointed out. As an example the steps required to model the artificial optimization technique called Ant Colony Optimization starting from the foraging behaviour of natural ant colonies are explained in detail. During the development of the model the authors use the language of multiagent systems to highligh...

In this paper, we present an ant algorithm applied to a shortest path problem. The algorithm will consider different input parameters in order to see how the results behave. These results will be compared to see if there is a pattern on changing the input parameters.

Assembly line balancing concerns the design of assembly lines for the manufacturing of products. In this paper we consider the time and space constrained simple assembly line balancing problem with the objective of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1 in the literature. For tackling this problem we propose a Beam-ACO approach, which is an algorit...

In this article a method for color reduction based on ant colony algorithm is presented. Generally color reduction involves two steps: choosing a proper palette and mapping colors to this palette. This article is about the first step. Using ant colony algorithm, pixel clusters are formed based on their colors and neighborhood information to make the final palette. A comparison between the resul...

The Probabilistic Traveling Salesman Problem (PTSP) is a TSP problem where each customer has a given probability of requiring a visit. The goal is to find an a priori tour of minimal expected length over all customers, with the strategy of visiting a random subset of customers in the same order as they appear in the a priori tour. We address the question of whether and in which context an a pri...

A hybrid population based Ant Colony Optimization (ACO) algorithm PFold-P-ACO for protein folding in the HP model is proposed in this paper. This is the first population based ACO algorithm in the bioinformatics. It is shown experimentally that the algorithms achieves on nearly all test sequences at least comparable results to other state of the art algorithms. Compared to the state of the art ...