Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...

We briefly describe an approach to extend the Ant Colony System by a group recruitment strategy. The underlying idea is very similar to the behavior of real ants, which use e.g. tandem-techniques to guide each other to large food sources. General investigations with small and medium sized colonies have shown that such strategies in combination with mass recruitment (pheromones) increase the foo...

the prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. this has motivated researchers to develop cognitive radio (cr) as a smart and dynamic radio access promised solution. a major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. this paper introduces an i...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

one of the main problems in the quality control of rivers is the high control cost imposed upon pollutant units. the cooperative policy approach in the treatment process between two or more pollutant units is a new and economic perspective in the environmental management of catchment basins. origins of large amounts pollutants which require a high cost to control pollution are trying to start p...

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant syste...

many real world problems can be modelled as an optimization problem. evolutionary algorithms are used to solve these problems. ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. these ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. ant colony optim...

-Wireless Sensor Networks (WSN’s) have become an important and challenging research area in last year. Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used ...

The Learnable Ant Colony Optimization (LACO) is proposed to satellite ground station system scheduling problems. The LACO employs an integrated modelling idea which combines the ant colony model with the knowledge model. In order to improve the performance, LACO largely pursues the complementary advantages of ant colony model and knowledge model. Experimental results suggest that LACO is a feas...