Efficient matheuristic for the generalised multiple knapsack problem with setup Online publication date: Tue, 29-Sep-2020
by Yassine Adouani; Bassem Jarboui; Malek Masmoudi
European J. of Industrial Engineering (EJIE), Vol. 14, No. 5, 2020
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]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook