IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i11p2382-2390.html
   My bibliography  Save this article

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

Author

Listed:
  • Ran Tai
  • Dantong Ouyang
  • Ruizhi Li
  • Liming Zhang

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.

Suggested Citation

  • Ran Tai & Dantong Ouyang & Ruizhi Li & Liming Zhang, 2023. "ILSGVCP: An improved local search algorithm for generalized vertex cover problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(11), pages 2382-2390, November.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:11:p:2382-2390
    DOI: 10.1080/01605682.2022.2147458
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2147458
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2022.2147458?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:74:y:2023:i:11:p:2382-2390. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.