Wilbaut, C. and Salhi, S. and Hanafi, S. (2009) An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. European Journal of Operational Research (EJOR), 199 (2). pp. 339-348. ISSN 0377-2217 .
This is the latest version of this item.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|Uncontrolled keywords:||Heuristics Exact methods Fixation techniques Knapsack|
|Subjects:||Q Science > Operations Research - Theory|
|Divisions:||Faculties > Social Sciences > Kent Business School > Management Science|
|Depositing User:||Said Salhi|
|Date Deposited:||02 Oct 2009 06:48|
|Last Modified:||01 Aug 2011 15:34|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/22873 (The current URI for this page, for reference purposes)|
Available versions of this item
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. (deposited 02 Oct 2009 06:48) [Currently Displayed]
- Depositors only (login required):