local search with edge weighting and configuration checking heuristics for minimum vertex cover

	local search with edge weighting and configuration checking heuristics for minimum vertex cover
	Cai Shaowei; Su Kaile; Sattar Abdul
	2011
会议录名称	Artificial Intelligence
页码	1672-1696
收录类别	ei
ISSN	43702
部门归属	(1) Key laboratory of High Confidence Software Technologies (Peking University), Ministry of Education, Beijing, China; (2) Institute for Integrated and Intelligent Systems, Griffith University, Brisbane, Australia; (3) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (4) ATOMIC Project, Queensland Research Lab, NICTA, Australia
摘要	The Minimum Vertex Cover (MVC) problem is a well-known combinatorial optimization problem of great importance in theory and applications. In recent years, local search has been shown to be an effective and promising approach to solve hard problems, such as MVC. In this paper, we introduce two new local search algorithms for MVC, called EWLS (Edge Weighting Local Search) and EWCC (Edge Weighting Configuration Checking). The first algorithm EWLS is an iterated local search algorithm that works with a partial vertex cover, and utilizes an edge weighting scheme which updates edge weights when getting stuck in local optima. Nevertheless, EWLS has an instance-dependent parameter. Further, we propose a strategy called Configuration Checking for handling the cycling problem in local search. This is used in designing a more efficient algorithm that has no instance-dependent parameters, which is referred to as EWCC. Unlike previous vertex-based heuristics, the configuration checking strategy considers the induced subgraph configurations when selecting a vertex to add into the current candidate solution.A detailed experimental study is carried out using the well-known DIMACS and BHOSLIB benchmarks. The experimental results conclude that EWLS and EWCC are largely competitive on DIMACS benchmarks, where they outperform other current best heuristic algorithms on most hard instances, and dominate on the hard random BHOSLIB benchmarks. Moreover, EWCC makes a significant improvement over EWLS, while both EWLS and EWCC set a new record on a twenty-year challenge instance. Further, EWCC performs quite well even on structured instances in comparison to the best exact algorithm we know. We also study the run-time behavior of EWLS and EWCC which shows interesting properties of both algorithms. © 2011 Elsevier B.V.
关键词	Combinatorial Optimization Learning Algorithms Problem Solving
语种	英语
WOS记录号	WOS:000292222400010
引用统计
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/14267
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Cai Shaowei,Su Kaile,Sattar Abdul. local search with edge weighting and configuration checking heuristics for minimum vertex cover[C],2011:1672-1696.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
local search with ed（600KB）			开放获取	--	请求全文