IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v14y2020i5p715-741.html
   My bibliography  Save this article

Efficient matheuristic for the generalised multiple knapsack problem with setup

Author

Listed:
  • Yassine Adouani
  • Bassem Jarboui
  • Malek Masmoudi

Abstract

This paper introduces a new variant of the knapsack problem with setup (KPS). We refer to it as the generalised multiple knapsack problem with setup (GMKPS). GMKPS originates from industrial production problems where the items are divided into classes and processed in multiple periods. We refer to the particular case where items from the same class cannot be processed in more than one period as the multiple knapsack problem with setup (MKPS). First, we provide mathematical formulations of GMKPS and MKPS and provide an upper bound expression for the knapsack problem. We then propose a matheuristic that combines variable neighbourhood descent (VND) with integer programming (IP). We consider local search techniques to assign classes to knapsacks and apply the IP to select the items in each knapsack. Computational experiments on randomly generated instances show the efficiency of our matheuristic in comparison to the direct use of a commercial solver. [Received: 4 March 2018; Revised: 1 June 2019; Revised: 12 July 2019; Revised: 22 November 2019; Accepted: 6 January 2020]

Suggested Citation

  • Yassine Adouani & Bassem Jarboui & Malek Masmoudi, 2020. "Efficient matheuristic for the generalised multiple knapsack problem with setup," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 14(5), pages 715-741.
    • Handle: RePEc:ids:eujine:v:14:y:2020:i:5:p:715-741
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=109906
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. He, Yichao & Wang, Jinghong & Liu, Xuejing & Wang, Xizhao & Ouyang, Haibin, 2024. "Modeling and solving of knapsack problem with setup based on evolutionary algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 219(C), pages 378-403.

    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:ids:eujine:v:14:y:2020:i:5:p:715-741. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.