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...

This paper gives an algorithm for the graph bisection problem using the Ant System (AS) technique. The ant algorithm given in this paper differs from the usual ant algorithms in that the individual ant in the system does not construct a solution to the problem nor a component of the solution directly. Rather the collective behavior of the two species of ants in the system induces a solution to ...

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

In computer vision, image segmentation is an important problem and plays vital role in medical imaging. Analysis and diagnosis of tumor in MRI brain image involves segmentation as very essential steep. It separates the region of interest objects from the background and the other objects. Several approaches are used for MRI brain tumor segmentation. Fuzzy C Means (FCM) is most widely used fuzzy ...

This paper presents a method of optimized PID parameter self-adapted ant colony algorithm with aberrance gene, based on ant colony algorithm. This method overcomes genetic algorithm’s defects of repeated iteration, slower solving efficiency, ordinary ant colony algorithm’s defects of slow convergence speed, easy to get stagnate, and low ability of full search. For a given system, the results of...

Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem. Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms. Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve differenttypes of NP-hard problems.However, ant colony s...

This paper explores the former Eastern Bloc’s (primarily the GDR and the Soviet Union) supremacy in developing elite sporting excellence and traces the ‘ow’ of elements of such systems to selected Western nation-states. The national elite sport development systems discussed in the West are: Europe (UK, France and Spain), North America (Canada, United States) and Australia. A tentative conceptu...

As a swarm-based optimization heuristic, the Ant System (AS) was proposed to deal with Traveling Salesman Problem (TSP). Classifified as constructive approach, AS inspired by ants’ social behavior.In Practice, its implementation reveals three basic variants that exploit two operating models: fifirst “natural” model, where ants move and update pheromones, consideration of distances between towns...

This paper describes the cunning ant system (cAS), which can be used to optimize problems with candidate solutions represented by permutations. cAS generates new candidate solutions from a combination of the pheromone density and the archive of past candidate solutions. Performance of cAS is demonstrated on two important classes of permutation problems: (1) the traveling salesman problem and (2...