The Multidimensional Knapsack Problem: Structure and Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue INFORMS Journal on Computing Année : 2010

The Multidimensional Knapsack Problem: Structure and Algorithms

Résumé

We study the multidimensional knapsack problem, present some theoretical and empirical results about its structure, and evaluate different Integer Linear Programming (ILP) based, metaheuristic, and collaborative approaches for it. We start by considering the distances between optimal solutions to the LP-relaxation and the original problem and then introduce a new core concept for the MKP, which we study extensively. The empirical analysis is then used to develop new concepts for solving the MKP using ILP-based and memetic algorithms. Different collaborative combinations of the presented methods are discussed and evaluated. Further computational experiments with longer run-times are also performed in order to compare the solutions of our approaches to the best known solutions of another so far leading approach for common MKP benchmark instances. The extensive computational experiments show the effectiveness of the proposed methods, which yield highly competitive results in significantly shorter run-times than previously described approaches.
Fichier principal
Vignette du fichier
puchinger-07.pdf (231.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01224914 , version 1 (05-11-2015)

Identifiants

Citer

Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy. The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS Journal on Computing, 2010, 22 (2), pp.250 - 265. ⟨10.1287/ijoc.1090.0344⟩. ⟨hal-01224914⟩
130 Consultations
7269 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More