ILSGVCP: An improved local search algorithm for generalized vertex cover problem

Ran Tai, Dantong Ouyang, Ruizhi Li and Liming Zhang

Journal of the Operational Research Society, 2023, vol. 74, issue 11, 2382-2390

Abstract: The generalized vertex cover problem (GVCP) is a well-known combinatorial problem of the classic minimum vertex cover problem with rich applications. And local search algorithm is an effective heuristic algorithm to solve GVCP. Therefore, In this paper, we develop an improved local search algorithm for the problem, namely ILSGVCP. Specifically, new choosing small weight rules called CSWR is presented for initialization to acquire a high-quality candidate solution. Furthermore, we propose a dynamic perturbation mechanism called DP with a novel formula which makes local search perturbed dynamically. Moreover, we combine CSWR and DP to propose our algorithm ILSGVCP. Finally, we carry out experiments to evaluate ILSGVCP on random instances with up to 1000 vertices and 400,000 edges and DIMACS instances. A detailed experimental evaluation reveals that ILSGVCP outperforms other state-of-the-art algorithms for the GVCP.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2022.2147458 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:74:y:2023:i:11:p:2382-2390

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2022.2147458

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().