A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
نویسندگان
چکیده
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. In this paper we have demonstrated that when local optimization technique is added to genetic algorithm to form HGA, it gives near to optimal solution speedy. We have developed new heuristic vertex crossover operator (HVX) especially for MVCP, which converges faster to the global optimal solution. HVX gives far better results compared to classical crossover operators. We have also studied the effect of mutation on optimal solution in MVCP.
منابع مشابه
A hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملA Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem
Given an undirected, unweighted graph G = (V , E) the minimum vertex cover (MVC) problem is a subset of V whose cardinality is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we propose a meta-heuristic based on Ant Colony Optimization (ACO) approach to find approximate solutions to the minimum vertex cover problem. By introducing a visible...
متن کاملNear-Optimal Solutions for the Minimum Cost Spare Allocation Problem using Hopfield-Type Neural Network Optimizers1
Four neural network models (analog Hopfield network with simulated annealing, Boltzmann machine, Cauchy machine and a hybrid scheme) are reviewed and subsequently employed as optimizers in order to solve the NP-HARD Minimum Cost Spare Allocation (MCSA) Problem (or equivalently Vertex Cover in bipartite graphs). The methodology is based on the energy reduction property of such networks and provi...
متن کاملAn Effective Algorithm for Minimum Weighted Vertex Cover Problem
The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Sup...
متن کاملSolving Minimum Vertex Cover Problem Using Learning Automata
Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph. In this paper, a learning automaton based algorithm is proposed to find minimum vertex cover in graph. In the proposed algorithm, each vertex of graph is equipped with a learning automaton that has two actions in the candidate or noncandidate of the corresponding vertex cover se...
متن کامل