An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles European Journal of Operational Research Year : 2008

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem

Abstract

An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the variables to fix either permanently or temporarily and on the other hand to construct feasible solutions of the problem. Adaptations of this mechanism are proposed to explore different parts of the search space and to enhance the behaviour of the algorithm. Encouraging results are presented when tested on the correlated instances of the 0-1 multidimensional knapsack problem.
Fichier principal
Vignette du fichier
Wilbaut et al. - 2009 - An iterative variable-based fixation heuristic for.pdf (433.64 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03723748 , version 1 (15-07-2022)

Identifiers

Cite

Christophe Wilbaut, Saïd Salhi, Saïd Hanafi. An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. European Journal of Operational Research, 2008, 199, pp.339 - 348. ⟨10.1016/j.ejor.2008.11.036⟩. ⟨hal-03723748⟩
7 View
17 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More