IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v253y2016i2p328-336.html
   My bibliography  Save this article

An ejection chain approach for the quadratic multiple knapsack problem

Author

Listed:
  • Peng, Bo
  • Liu, Mengqi
  • Lü, Zhipeng
  • Kochengber, Gary
  • Wang, Haibo

Abstract

In an algorithm for a problem whose candidate solutions are selections of objects, an ejection chain is a sequence of moves from one solution to another that begins by removing an object from the current solution. The quadratic multiple knapsack problem extends the familiar 0–1 knapsack problem both with several knapsacks and with values associated with pairs of objects. A hybrid algorithm for this problem extends a local search algorithm through an ejection chain mechanism to create more powerful moves. In addition, adaptive perturbations enhance the diversity of the search process. The resulting algorithm produces results that are competitive with the best heuristics currently published for this problem. In particular, it improves the best known results on 34 out of 60 test problem instances and matches the best known results on all but 6 of the remaining instances.

Suggested Citation

  • Peng, Bo & Liu, Mengqi & Lü, Zhipeng & Kochengber, Gary & Wang, Haibo, 2016. "An ejection chain approach for the quadratic multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 253(2), pages 328-336.
    • Handle: RePEc:eee:ejores:v:253:y:2016:i:2:p:328-336
    DOI: 10.1016/j.ejor.2016.02.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716300960
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.02.043?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fleszar, Krzysztof, 2022. "A branch-and-bound algorithm for the quadratic multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 298(1), pages 89-98.
    2. M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2020. "A GRASP algorithm for multi container loading problems with practical constraints," 4OR, Springer, vol. 18(1), pages 49-72, March.

    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:eee:ejores:v:253:y:2016:i:2:p:328-336. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.