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

An effective hybrid search method for the quadratic knapsack problem with conflict graphs

Author

Listed:
  • Qing Zhou
  • Jin-Kao Hao
  • Zhong-Zhong Jiang
  • Qinghua Wu

Abstract

The quadratic knapsack problem (QKP) is a variant of the well-known knapsack problem and arises in a variety of real life applications. The quadratic knapsack problem with conflict graphs (QKPCG) further extends QKP by considering the conflicts of items. In this work, we propose an effective hybrid search method based on the framework of memetic algorithm to tackle QKPCG. The method integrates a randomized uniform-based crossover operator to generate promising offspring solutions, a multi-neighborhood tabu search to perform local optimization, and a streamline technique to speed up the evaluation of candidate solutions. The method shows a competitive performance compared to the state-of-the-art approaches in the literature. It finds 3 improved best-known solutions and matches the best-known solutions for all the remaining cases out of the 45 benchmark instances. We investigate the effects of the key ingredients of the algorithm.

Suggested Citation

  • Qing Zhou & Jin-Kao Hao & Zhong-Zhong Jiang & Qinghua Wu, 2024. "An effective hybrid search method for the quadratic knapsack problem with conflict graphs," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(5), pages 1000-1010, May.
    • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:5:p:1000-1010
    DOI: 10.1080/01605682.2023.2228339
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2228339
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2023.2228339?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:75:y:2024:i:5:p:1000-1010. 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.