A Comparative Assessment of Ant Colony Optimization Algorithms for the Minimum Weight Vertex Cover Problem
نویسندگان
چکیده
In this paper we analyze the application of the Ant Colony Optimization to the Minimum Weight Vertex Covering Problem. We use the software system that we developed and implemented different standard ACO algorithms to this problem: Ant Colony System, the use of Elitism, Rank based approach and the MinMax system. We have made a comparative assessment of the effectiveness of these algorithms to the Minimum Weight Vertex Covering Problem in different problem cases and shown that Elitist Ant System and MinMax Ant System give better solutions for larger test cases while run-times for all algorithms were similar. Key-Words: Ant Colony Optimization, Minimum Weight Vertex Cover, Evolutionary Computation, Swarm Intelligence
منابع مشابه
An Analysis of Different Variations of Ant Colony Optimization to the Minimum Weight Vertex Cover Problem
Ant colony optimization (ACO) has previously been applied to the Minimum Weight Vertex Cover Problem with very good results. The performance of the ACO algorithm can be improved with the use of different variations of the basic Ant Colony System algorithm, like the use of Elitism, Rank based approach and the MinMax system. In this paper, we have made an analysis of effectiveness of these variat...
متن کاملAnalysis of Parallel Implementations of the Ant Colony Optimization Applied to the Minimum Weight Vertex Cover Problem
In this paper we analyze various parallel implementations of the Ant Colony Optimization (ACO) applied to the Minimum Weight Vertex Cover Problem (MWVCP). We investigated the ACO algorithms applied to the MWCVP before. Here, we observe the behavior of different parallel topologies and corresponding algorithms like fully connected, replace worst, ring and independent parallel runs. We also prese...
متن کاملComparison of Different Topologies for Island-Based Multi-Colony Ant Algorithms for the Minimum Weight Vertex Cover Problem
The aim of this paper is compare the effect of using different topologies or connections between separate colonies in island based parallel implementations of the Ant Colony Optimization applied to the Minimum Weight Vertex Cover Problem. We investigated the sequential Ant Colony Optimization algorithms applied to the Minimum Weight Vertex Cover Problem before. Parallelization of population bas...
متن کاملAn ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem
The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem. Some kind of hybridization or exploi...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
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...
متن کامل