Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic

被引：4
|
作者：
Li, Ruizhi [1 ,2 ]
Wang, Yupan [3 ]
Hu, Shuli [3 ]
Jiang, Jianhua [1 ]
Ouyang, Dantong [2 ]
Yin, Minghao [3 ,4 ]
机构：
[1] Jilin Univ Finance & Econ, Sch Management Sci & Informat Engn, Changchun 130117, Peoples R China
[2] Jilin Univ, Sch Comp Sci & Technol, Changchun 130012, Peoples R China
[3] Northeast Normal Univ, Sch Comp Sci & Informat Technol, Changchun 130024, Peoples R China
[4] Northeast Normal Univ, MOE, Key Lab Appl Stat, Changchun 130117, Peoples R China
来源：
MATHEMATICAL PROBLEMS IN ENGINEERING | 2020年 / 2020卷
基金：
中国国家自然科学基金; 中国博士后科学基金;
关键词：
EFFICIENT LOCAL SEARCH; CONFIGURATION CHECKING; GENETIC ALGORITHM; GRASP;
D O I：
10.1155/2020/3050714
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The set packing problem (SPP) is a significant NP-hard combinatorial optimization problem with extensive applications. In this paper, we encode the set packing problem as the maximum weighted independent set (MWIS) problem and solve the encoded problem with an efficient algorithm designed to the MWIS problem. We compare the independent set-based method with the state-of-the-art algorithms for the set packing problem on the 64 standard benchmark instances. The experimental results show that the independent set-based method is superior to the existing algorithms in terms of the quality of the solutions and running time obtained the solutions.
引用
收藏
页数：11
相关论文
共 50 条
  • [1] Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
    Klobucar, Ana
    Manger, Robert
    MATHEMATICS, 2020, 8 (02)
  • [2] ON SEQUENTIAL HEURISTIC METHODS FOR THE MAXIMUM INDEPENDENT SET PROBLEM
    Le, Ngoc C.
    Brause, Christoph
    Schiermeyer, Ingo
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (02) : 402 - 413
  • [3] A NATURAL MODEL AND A PARALLEL ALGORITHM FOR APPROXIMATELY SOLVING THE MAXIMUM WEIGHTED INDEPENDENT SET PROBLEM
    AFIF, M
    LIKAS, A
    PASCHOS, VT
    CHAOS SOLITONS & FRACTALS, 1995, 5 (05) : 739 - 746
  • [4] THE WEIGHTED MAXIMUM INDEPENDENT SET PROBLEM IN PERMUTATION GRAPHS
    YU, CW
    CHEN, GH
    BIT NUMERICAL MATHEMATICS, 1992, 32 (04) : 609 - 618
  • [5] A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
    Hifi, M
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (06) : 612 - 622
  • [6] An ant colony optimization heuristic for solving maximum independent set problems
    Li, YM
    Xul, ZB
    ICCIMA 2003: FIFTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, PROCEEDINGS, 2003, : 206 - 211
  • [7] An evolutionary algorithm for the robust maximum weighted independent set problem
    Klobucar, Ana
    Manger, Robert
    AUTOMATIKA, 2020, 61 (04) : 523 - 536
  • [8] A note on greedy algorithms for the maximum weighted independent set problem
    Sakai, S
    Togasaki, M
    Yamazaki, K
    DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 313 - 322
  • [9] A tolerance-based heuristic approach for the weighted independent set problem
    Goldengorin, B. I.
    Malyshev, D. S.
    Pardalos, P. M.
    Zamaraev, V. A.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (02) : 433 - 450
  • [10] A tolerance-based heuristic approach for the weighted independent set problem
    B. I. Goldengorin
    D. S. Malyshev
    P. M. Pardalos
    V. A. Zamaraev
    Journal of Combinatorial Optimization, 2015, 29 : 433 - 450
12345