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 条
  • [41] A fast approximation algorithm for solving the complete set packing problem
    Tri-Dung Nguyen
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 237 (01) : 62 - 70
  • [42] An Evolutionary Algorithm Based Hyper-heuristic for the Set Packing Problem
    Chaurasia, Sachchida Nand
    Jung, Donghwi
    Lee, Ho Min
    Kim, Joong Hoon
    HARMONY SEARCH AND NATURE INSPIRED OPTIMIZATION ALGORITHMS, 2019, 741 : 259 - 268
  • [43] AN ALGORITHM FOR FINDING A MAXIMUM WEIGHTED INDEPENDENT SET IN AN ARBITRARY GRAPH
    PARDALOS, PM
    DESAI, N
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 38 (3-4) : 163 - 175
  • [44] Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
    Xiao, Mingyu
    Huang, Sen
    Zhou, Yi
    Ding, Bolin
    PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, : 3930 - 3940
  • [45] A causal approach for explaining why a heuristic algorithm outperforms another in solving an instance set of the Bin Packing problem
    Perez, Joaquin
    Cruz, Laura
    Pazos, Rodolfo
    Landero, Vanesa
    Reyes, Gerardo
    Zavala, Crispin
    Fraire, Hector
    Perez, Veronica
    FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS, 2008, 4994 : 591 - +
  • [46] A polytime preprocess algorithm for the maximum independent set problem
    Kroger, Samuel
    Validi, Hamidreza
    Hicks, Illya V.
    OPTIMIZATION LETTERS, 2024, 18 (02) : 651 - 661
  • [47] On the Power of Simple Reductions for the Maximum Independent Set Problem
    Strash, Darren
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 345 - 356
  • [48] On the maximum independent set problem in subclasses of subcubic graphs
    Lozin, Vadim
    Monnot, Jerome
    Ries, Bernard
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 31 : 104 - 112
  • [49] Fast local search for the maximum independent set problem
    Andrade, Diogo V.
    Resende, Mauricio G. C.
    Werneck, Renato F.
    JOURNAL OF HEURISTICS, 2012, 18 (04) : 525 - 547
  • [50] A priori optimization for the probabilistic maximum independent set problem
    Murat, C
    Paschos, VT
    THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) : 561 - 590
12345