A column generation method for the multiple-choice multi-dimensional knapsack problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computational Optimization and Applications Année : 2010

A column generation method for the multiple-choice multi-dimensional knapsack problem

Résumé

In this paper, we propose to solve large-scale multiple-choice multi-dimensional knapsack problems. We investigate the use of the column generation and effective solution procedures. The method is in the spirit of well-known local search metaheuristics, in which the search process is composed of two complementary stages: (i) a rounding solution stage and (ii) a restricted exact solution procedure. The method is analyzed computationally on a set of problem instances of the literature and compared to the results reached by both Cplex solver and a recent reactive local search. For these instances, most of which cannot be solved to proven optimality in a reasonable runtime, the proposed method improves 21 out of 27.

Dates et versions

hal-00308694 , version 1 (31-07-2008)

Identifiants

Citer

Nawal Cherfi, Mhand Hifi. A column generation method for the multiple-choice multi-dimensional knapsack problem. Computational Optimization and Applications, 2010, 46 (1), pp.51-73. ⟨10.1007/s10589-008-9184-7⟩. ⟨hal-00308694⟩
75 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More