A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems

被引:0
|
作者
Hifi, M
机构
关键词
combinatorial optimization; genetic algorithms; heuristics; independent set;
D O I
暂无
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we present a genetic algorithm-based heuristic especially for the weighted maximum independent set problem (IS). The proposed approach treats also some equivalent combinatorial optimization problems. We introduce several modifications to the basic genetic algorithm, by (i) using a crossover called two-fusion operator which creates two new different children and (ii) replacing the mutation operator by the heuristic-feasibility operator tailored specifically for the weighted independent set. The performance of our algorithm was evaluated on several randomly generated problem instances for the weighted independent set and on some instances of the DIMACS Workshop for the particular case: the unweighted maximum clique problem. Computational results show that the proposed approach is able to produce high-quality solutions within reasonable computational times. This algorithm is easily parallelizable and this is one of its important features.
引用
收藏
页码:612 / 622
页数:11
相关论文
共 50 条
  • [1] Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic
    Li, Ruizhi
    Wang, Yupan
    Hu, Shuli
    Jiang, Jianhua
    Ouyang, Dantong
    Yin, Minghao
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020
  • [2] A genetic algorithm for maximum independent set problems
    Liu, XZ
    Sakamoto, A
    Shimamoto, T
    [J]. INFORMATION INTELLIGENCE AND SYSTEMS, VOLS 1-4, 1996, : 1916 - 1921
  • [3] An ant colony optimization heuristic for solving maximum independent set problems
    Li, YM
    Xul, ZB
    [J]. ICCIMA 2003: FIFTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, PROCEEDINGS, 2003, : 206 - 211
  • [4] A Modified Genetic Algorithm for Maximum Independent Set Problems
    刘兴钊
    坂本明雄
    岛本隆
    [J]. Journal of Harbin Institute of Technology(New series), 1999, (02) : 5 - 10
  • [5] HEURISTIC ALGORITHM FOR FINDING THE MAXIMUM INDEPENDENT SET
    Plotnikov, A. D.
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (05) : 673 - 680
  • [6] A NATURAL MODEL AND A PARALLEL ALGORITHM FOR APPROXIMATELY SOLVING THE MAXIMUM WEIGHTED INDEPENDENT SET PROBLEM
    AFIF, M
    LIKAS, A
    PASCHOS, VT
    [J]. CHAOS SOLITONS & FRACTALS, 1995, 5 (05) : 739 - 746
  • [8] A Genetic Algorithm-Based Heuristic Method for Test Set Generation in Reversible Circuits
    Nagamani, A. N.
    Anuktha, S. N.
    Nanditha, N.
    Agrawal, Vinod Kumar
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2018, 37 (02) : 324 - 336
  • [9] Using a Genetic Algorithm-based Hyper-heuristic to Tune MOEA/D for a Set of Various Test Problems
    Pang, Lie Meng
    Ishibuchi, Hisao
    Shang, Ke
    [J]. 2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 1486 - 1494
  • [10] A genetic approach for maximum independent set problems
    Sakamoto, A
    Liu, XZ
    Shimamoto, T
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03) : 551 - 556