An innovative ant colony algorithm called memory-based ant colony algorithm is proposed to solve the bipartite subgraph problem. In the proposed algorithm, artificial ant has memory of solution found previously, and can use it to construct a new solution. Besides, in the proposed algorithm two kinds of pheromone and two kinds of heuristic information are also adopted to reinforce the search abi...

Image enhancement improves the visual looks of the images . In this paper various algorithm which are used to enhance the quality of the image are surveyed ,special attention is given to L0 norm and ant colony based optimisation algorithms.

Traditional tour route planning mostly depends on the planner’s experience. However, whether tour route planning is appropriate or not has a considerable impact on the time and cost of the tour. Good planning can save unnecessary waiting time, avoid wasted operating costs, and contribute to the enhancement of the quality of tourism. Therefore, this study applied the ant colony optimization algo...

In this paper a new algorithm called Dynamic Ant is introduced. It was a combination of Ant Colony Optimization techniques and Dynamic Niche Sharing scheme. The interesting point of this algorithm is that it is simple to be implemented and could be well matched with existing design algorithms by adding the heuristic weights to speed up the algorithm. The algorithm uses the problem state structu...

In order to detect new virus, a method based on biological immune principle is presented in this paper .On this basis , the clustering method combining genetic algorithm and ant colony algorithm is adopted to detect computer virus. Experiments results indicate that this method has strong adaptability, better intelligence, and higher degree of automation. Therefore, the method can be used to det...

A system based on the adaptation of the search principle used in ant colony optimization (ACO) for multiobjective graph-based data mining (GBDM) is introduced in this paper. Our multiobjective ACO algorithm is designed to retrieve the best substructures in a graph database by jointly considering two criteria, support and complexity. The experimental comparison performed with a classical GBDM me...

We introduce two reactive frameworks for dynamic adapating some parameters of an Ant Colony Optimization (ACO) algorithm. Both reactive frameworks use ACO to adapt parameters: pheromone trails are associated with parameter values; these pheromone trails represent the learnt desirability of using parameter values and are used to dynamically set parameters in a probabilistic way. The two framewor...

Minimum-weight arborescence problems have recently enjoyed an increased attention due to their relation to imporant problems in computer vision. A prominent example is the automated reconstruction of consistent tree structures from noisy images. In this paper, we first propose a heuristic for tackling the minimum-weight rooted arborescence problem. Moreover, we propose an ant colony optimizatio...

A number of algorithms have been developed for the optimization of power plant maintenance schedules. However, the true test of such algorithms occurs when they are applied to real systems. In this paper, the application of an Ant Colony Optimization formulation to a hydropower system is presented. The formulation is found to be effective in handling various constraints commonly encountered in ...