A New Genetic Algorithm for the Maximum Clique Problem

被引:0
|
作者
Evin, Gozde Kizilates [1 ]
机构
[1] Ege Univ, Fac Sci, Dept Math, Izmir, Turkey
关键词
Maximum clique problem; Graph theory; Optimization problems; Heuristic algorithms; Hybrid genetic algorithms; BOUND ALGORITHM; SEARCH;
D O I
10.1007/978-3-030-36178-5_66
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Maximum Clique Problem is widely studied optimization problem and plays an essential part in computer science. In the literature, therefore, there are many exact and heuristic approaches and new strategies are continuously being proposed. In this paper, the maximum clique problem is studied, and a new hybrid genetic algorithm is proposed for finding the maximum clique in a graph. The proposed algorithm is tested on the DIMACS and BHOSLIB benchmark instances. The computational results are compared with similar literature researches. The results prove the effectiveness of proposed algorithm.
引用
收藏
页码:766 / 774
页数:9
相关论文
共 50 条
  • [41] A heuristic based harmony search algorithm for maximum clique problem
    Assad A.
    Deep K.
    OPSEARCH, 2018, 55 (2) : 411 - 433
  • [42] MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
    Guo, Ping
    Wang, Xuekun
    Zeng, Yi
    Chen, Haizhu
    IEEE ACCESS, 2019, 7 : 108360 - 108370
  • [43] An exact bit-parallel algorithm for the maximum clique problem
    San Segundo, Pablo
    Rodriguez-Losada, Diego
    Jimenez, Agustin
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (02) : 571 - 581
  • [44] A parallel branch and bound algorithm for the maximum labelled clique problem
    McCreesh, Ciaran
    Prosser, Patrick
    OPTIMIZATION LETTERS, 2015, 9 (05) : 949 - 960
  • [45] IMPLEMENTATION OF GROVER'S ALGORITHM TO SOLVE THE MAXIMUM CLIQUE PROBLEM
    Haverly, A.
    Lopez, S.
    2021 IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI (ISVLSI 2021), 2021, : 441 - 446
  • [46] A LOCAL CORE NUMBER BASED ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
    Mohammadi, Neda
    Kadivar, Mehdi
    TRANSACTIONS ON COMBINATORICS, 2021, 10 (03) : 149 - 163
  • [47] A parallel branch and bound algorithm for the maximum labelled clique problem
    Ciaran McCreesh
    Patrick Prosser
    Optimization Letters, 2015, 9 : 949 - 960
  • [48] A new upper bound for the maximum weight clique problem
    Li, Chu-Min
    Liu, Yanli
    Jiang, Hua
    Manya, Felip
    Li, Yu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (01) : 66 - 77
  • [49] Annealed replication: a new heuristic for the maximum clique problem
    Bomze, IM
    Budinich, M
    Pelillo, M
    Rossi, C
    DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 27 - 49
  • [50] Solving Maximal Clique Problem through Genetic Algorithm
    Rajawat, Shalini
    Hemrajani, Naveen
    Menghani, Ekta
    INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN SCIENCE AND TECHNOLOGY (ICM2ST-10), 2010, 1324 : 235 - +