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

被引：20
|
作者：
Wilbaut, Christophe [1 ]
Salhi, Said [2 ]
Hanafi, Said [1 ]
机构：
[1] Univ Valenciennes, CNRS, UMR 8530, LAMIH SIADE, F-59530 Valenciennes 9, France
[2] Univ Kent, Kent Business Sch, Ctr Heurist Optimisat, Canterbury CT2 7NZ, Kent, England
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2009年 / 199卷 / 02期
关键词：
Heuristics; Exact methods; Fixation techniques; Knapsack; TABU SEARCH; ALGORITHM;
D O I：
10.1016/j.ejor.2008.11.036
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：339 / 348
页数：10
相关论文
共 50 条
  • [1] Problem reduction heuristic for the 0-1 multidimensional knapsack problem
    Hill, Raymond R.
    Cho, Yong Kun
    Moore, James T.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 19 - 26
  • [2] A Memetic Lagrangian Heuristic for the 0-1 Multidimensional Knapsack Problem
    Yoon, Yourim
    Kim, Yong-Hyuk
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2013, 2013
  • [3] THE MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM A New Heuristic Algorithm Combined with 0-1 Linear Programming
    Csebfalvi, Aniko
    Csebfalvi, Gyorgy
    [J]. ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011, : 203 - 207
  • [4] Heuristics for the 0-1 multidimensional knapsack problem
    Boyer, V.
    Elkihel, M.
    El Baz, D.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (03) : 658 - 664
  • [5] The multidimensional 0-1 knapsack problem:: An overview
    Fréville, A
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (01) : 1 - 21
  • [6] AN IMPROVED HEURISTIC FOR MULTIDIMENSIONAL 0-1 KNAPSACK-PROBLEMS
    VOLGENANT, A
    ZOON, JA
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1990, 41 (10) : 963 - 970
  • [7] A hybrid heuristic for the 0-1 Knapsack Sharing Problem
    Haddar, Boukthir
    Khemakhem, Mahdi
    Hanafi, Said
    Wilbaut, Christophe
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (10) : 4653 - 4666
  • [8] A HEURISTIC ALGORITHM BASED ON EXPECTATION EFFICIENCY FOR 0-1 KNAPSACK PROBLEM
    Zhang, Lingling
    Lv, Jianhui
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2018, 14 (05): : 1833 - 1854
  • [9] Improved results on the 0-1 multidimensional knapsack problem
    Vasquez, M
    Vimont, Y
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) : 70 - 81
  • [10] Solution to the 0-1 Multidimensional Knapsack Problem Based on DNA Computation
    Wu, Kee-Rong
    Yeh, Chung-Wei
    [J]. INFORMATION TECHNOLOGY FOR MANUFACTURING SYSTEMS II, PTS 1-3, 2011, 58-60 : 1767 - +
12345