IDEAS home Printed from https://ideas.repec.org/a/gvu/jucct0/v6y2024i3id1786.html

Novel Solutions to the Multidimensional Knapsack Problem Using CPLEX: New Results on ORX Benchmarks

Author

Listed:
  • Khelifa Meriem
  • Mezzoudj Saliha
  • Hacini Mohammed abdelaziz
  • Fenniche Mohammed Amine
  • Babasidi Mohammed Khaled

Abstract

The Multidimensional Knapsack Problem (MKP) is a challenging combinatorial optimization problem that extends the classical knapsack problem by introducing multiple capacity constraints across various dimensions. This problem has significant practical applications, including resource allocation in supply chain management, portfolio optimization in finance, and cargo loading in logistics, where the goal is to maximize the total profit of selected items while adhering to these constraints. In this research, the CPLEX solver was applied to address the MKP using a set of complex instances from the OR-Library, specifically the ORX Benchmarks. The study focuses on 270 MKP instances characterized by varying numbers of variables (n = 100, 250, 500), constraints (m = 5), and tightness ratios (α = 0.25). Through advanced CPLEX techniques, new results were successfully obtained by employing advanced CPLEX methods, contributing to the existing literature, and setting new benchmarks for these instances.

Suggested Citation

Handle: RePEc:gvu:jucct0:v:6:y:2024:i:3:id:1786
DOI: 10.36548/jucct.2024.3.007
as

Download full text from publisher

File URL: https://irojournals.com/jucct/article/view/1786
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/jucct/article/download/1786/1616
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jucct.2024.3.007?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
---><---

More about this item

Keywords

;
;
;
;
;

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:gvu:jucct0:v:6:y:2024:i:3:id:1786. 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: Journal Manager (email available below). General contact details of provider: https://irojournals.com/jucct .

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.