A hybridized tabu search approach for the minimum weight vertex cover problem

Authors:
Stefan Voβ;Andreas Fink
Affiliations:
Institute of Information Systems, University of Hamburg, Hamburg, Germany 20146;Chair of Information Systems, Helmut-Schmidt-University, Hamburg, Germany 22043
Venue:
Journal of Heuristics
Year:
2012

Citing 8
Cited 0

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Tabu Search

Tabu Search
Experimental analysis of approximation algorithms for the vertex cover and set covering problems

Computers and Operations Research
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Comparison of different topologies for island-based multi-colony ant algorithms for the minimum weight vertex cover problem

WSEAS Transactions on Computers
An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem

Applied Soft Computing
Kernelization as heuristic structure for the vertex cover problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Hybridizing reactive tabu search with simulated annealing

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum weight vertex cover problem is a basic combinatorial optimization problem defined as follows. Given an undirected graph and positive weights for all vertices the objective is to determine a subset of the vertices which covers all edges such that the sum of the related cost values is minimized. In this paper we apply a modified reactive tabu search approach for solving the problem. While the initial concept of reactive tabu search involves a random walk we propose to replace this random walk by a controlled simulated annealing. Numerical results are presented outperforming previous metaheuristic approaches in most cases.