A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem - l'unam - université nantes angers le mans Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2007

A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

Abdelkader Sbihi
  • Fonction : Auteur
  • PersonId : 833121

Résumé

In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle of the approach is twofold: (i) to generate an initial feasible solution as a starting lower bound, and (ii) at different levels of the search tree to determine an intermediate upper bound obtained by solving an auxiliary problem called MMKPaux and perform the strategy of fixing items during the exploration. The approach which we develop is of best-first search strategy. The method was able to optimally solve the MMKP. The performance of the exact algorithm is evaluated on a set of small and medium instances, some of them are extracted from the literature and others are randomly generated. This algorithm is parallelizable and it is one of its important feature.
Fichier principal
Vignette du fichier
MMKP_joco.pdf (348.4 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00278065 , version 1 (09-05-2008)

Identifiants

Citer

Abdelkader Sbihi. A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. Journal of Combinatorial Optimization, 2007, Volume 13 (4), pp.337-351. ⟨10.1007/s10878-006-9035-3⟩. ⟨hal-00278065⟩
171 Consultations
1184 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More