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 条
  • [11] Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
    Hifi, M.
    Michrafy, M.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (09) : 2657 - 2673
  • [12] A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
    Pasquale Legato
    Roberto Trunfio
    4OR, 2014, 12 : 123 - 156
  • [13] A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
    Legato, Pasquale
    Trunfio, Roberto
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2014, 12 (02): : 123 - 156
  • [14] A hybrid guided neighborhood search for the disjunctively constrained knapsack problem
    Hifi, Mhand
    Saleh, Sagvan
    Wu, Lei
    COGENT ENGINEERING, 2015, 2 (01):
  • [15] A Parallel Large Neighborhood Search-based Heuristic for the Disjunctively Constrained Knapsack Problem
    Hifi, Mhand
    Negre, Stephane
    Saadi, Toufik
    Saleh, Sagvan
    Wu, Lei
    PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2014, : 1547 - 1551
  • [16] PROBABILISTIC TABU SEARCH WITH MULTIPLE NEIGHBORHOODS FOR THE DISJUNCTIVELY CONSTRAINED KNAPSACK PROBLEM
    Ben Salem, Mariem
    Hanafi, Said
    Taktak, Raouia
    Ben Abdallah, Hanene
    RAIRO-OPERATIONS RESEARCH, 2017, 51 (03) : 627 - 637
  • [17] Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem
    Quan, Zhe
    Wu, Lei
    ENGINEERING OPTIMIZATION, 2017, 49 (09) : 1541 - 1557
  • [18] Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
    de Queiroz, Thiago Alves
    Del Bianco Hokama, Pedro Henrique
    Saliba Schouery, Rafael Crivellari
    Miyazawa, Flavio Keidi
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 105 : 313 - 328
  • [19] The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set-Union Knapsack Problem
    Dahmani, Isma
    Ferroum, Meriem
    Hifi, Mhand
    JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, 2022, 13 (03) : 259 - 264
  • [20] A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs
    Oliveira, Elisama de Araujo Silva
    Wanner, Elizabeth
    de Sa, Elisangela Martins
    de Souza, Sergio Ricardo
    JOURNAL OF HEURISTICS, 2025, 31 (01)
12345