Local Branching-Based Algorithm for the Disjunctively Constrained Knapsack Problem

被引：6
|
作者：
Hifi, Mhand [1 ]
Negre, Stephane [1 ]
Mounir, Mohamed Ould Ahmed [1 ]
机构：
[1] Univ Picardie Jules Verne, Lab MIS, F-80000 Amiens, France
来源：
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词：
Combinatorial optimization; knapsack; optimization; rounding strategy; local branching;
D O I：
10.1109/ICCIE.2009.5223682
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we propose to solve large-scale disjunctively constrained knapsack problem. We investigate the use of the rounding solution procedure and an effective local branching. The method can be viewed as a combination 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 the provided results are compared to the best solutions of the literature. For these instances, most of which cannot be solved to proven optimality in a reasonable runtime, the proposed method is able to improve several solution values of these instances.
引用
收藏
页码：279 / 284
页数：6
相关论文
共 50 条
  • [41] Graph partitioning method based on connected graph constrained knapsack problem
    Lin, J. (mejklin@126.com), 1600, Chinese Society for Electrical Engineering (32):
  • [42] A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
    Pirkwieser, Sandro
    Raidl, Guenther R.
    Puchinger, Jakob
    RECENT ADVANCES IN EVOLUTIONARY COMPUTATION FOR COMBINATORIAL OPTIMIZATION, 2008, 153 : 69 - +
  • [43] Algorithm for Optimal Chance Constrained Knapsack Problem with Applications to Multi-robot Teaming
    Yang, Fan
    Chakraborty, Nilanjan
    2018 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2018, : 1043 - 1049
  • [44] Combining Lagrangian decomposition with an evolutionary algorithm for the Knapsack Constrained Maximum Spanning Tree problem
    Pirkwieser, Sandro
    Raidl, Guenther R.
    Puchinger, Jakob
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4446 : 176 - +
  • [45] Research on the Fast Particle Swarm Optimization Algorithm for Arbitrarily Constrained Multidimensional Knapsack Problem
    Ding, Luwei
    Kang, KunPeng
    Kang, Bin
    Wang, Jianyong
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (09): : 3849 - 3853
  • [46] Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
    Kumabe, Soh
    Maehara, Takanori
    Sin'ya, Ryoma
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019), 2019, 11355 : 248 - 260
  • [47] Heuristic algorithms for the cardinality constrained knapsack problem
    Pienkosz, Krzysztof
    PRZEGLAD ELEKTROTECHNICZNY, 2008, 84 (09): : 89 - 92
  • [48] A polyhedral study of the cardinality constrained knapsack problem
    I.R. de Farias Jr
    G.L. Nemhauser
    Mathematical Programming, 2003, 96 : 439 - 467
  • [49] Reduction Strategies for the Cardinality Constrained Knapsack Problem
    Pienkosz, Krzysztof
    2017 22ND INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN AUTOMATION AND ROBOTICS (MMAR), 2017, : 924 - 927
  • [50] A polyhedral study of the cardinality constrained knapsack problem
    de Farias, IR
    Nemhauser, GL
    MATHEMATICAL PROGRAMMING, 2003, 96 (03) : 439 - 467
12345