A New Genetic Algorithm for the Maximum Clique Problem

被引：0
|
作者：
Evin, Gozde Kizilates [1 ]
机构：
[1] Ege Univ, Fac Sci, Dept Math, Izmir, Turkey
来源：
ARTIFICIAL INTELLIGENCE AND APPLIED MATHEMATICS IN ENGINEERING PROBLEMS | 2020年 / 43卷
关键词：
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 条
  • [21] SUBGRAPH EXTRACTION AND MEMETIC ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
    Duc-Cuong Dang
    Moukrim, Aziz
    ICEC 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION, 2010, : 77 - 84
  • [22] An algorithm in tile assembly model for maximum clique problem
    Li, Kenli
    Luo, Xing
    Wu, Fan
    Zhou, Xu
    Huang, Xin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (03): : 666 - 675
  • [23] A Simple and Efficient Heuristic Algorithm For Maximum Clique Problem
    Singh, Krishna Kumar
    Govinda, Lakkaraju
    2014 IEEE 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO), 2014, : 269 - 273
  • [24] An exact algorithm for the maximum quasi-clique problem
    Ribeiro, Celso C.
    Riveaux, Jose A.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (06) : 2199 - 2229
  • [25] Subgraph extraction and memetic algorithm for the maximum clique problem
    Université de Technologie de Compiègne, Laboratoire Heudiasyc, UMR UTC-CNRS 6599, BP 20529, 60205 Compiègne, France
    ICEC - Proc. Int. Conf. Evol. Comput., (77-84):
  • [26] An improved branch and bound algorithm for the maximum clique problem
    Konc, Janez
    Janezic, Dusanka
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2007, 58 (03) : 569 - 590
  • [27] A simple simulated annealing algorithm for the maximum clique problem
    Geng, Xiutang
    Xu, Jin
    Xiao, Jianhua
    Pan, Linqiang
    INFORMATION SCIENCES, 2007, 177 (22) : 5064 - 5071
  • [28] A Hybrid Algorithm with Simulated Annealing for the Maximum Clique Problem
    Zhang Zhijie
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2013, 10 (04) : 1044 - 1047
  • [29] An evolutionary algorithm with guided mutation for the maximum clique problem
    Zhang, QF
    Sun, JY
    Tsang, E
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (02) : 192 - 200
  • [30] New approach for solving the maximum clique problem
    Taillon, P. J.
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 4041 : 279 - 290
12345