• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2015, Vol. 37 ›› Issue (03): 534-538.

• 论文 • Previous Articles     Next Articles

A uniform immune clone based intelligent optimization
algorithm to solve the maximum clique problem  

WANG Honghai 1,2,ZHANG Zhengqiu3   

  1. (1.School of Computer,Xidian University,Xi’an 710071;
    2.Department of Computers Science,Ganzhou Teachers Colleage,Ganzhou 341000;
    3.Faculty of Software,Fujian Normal University,Fuzhou 350027,China)
  • Received:2013-11-01 Revised:2014-02-24 Online:2015-03-25 Published:2015-03-25

Abstract:

The maximum clique problem is a typical combinatorial optimization problem,which has wide application background.For the NP characteristic of the maximum clique problem, an immune clone based on intelligent optimization algorithm is proposed to solve it. The mathematical model of the maximum clique problem is described.For solving the maximum clique problem,antibody encoding, affinity function, mutation operator and antibody correction method are designed. To reduce  the number of parameter setting for the experiment, it is converted into a uniform design problem of multifactor and multilevel.The Benchmark experimental results show that the algorithm has better performance and rapid solving speed.

Key words: immune optimization;maximum clique problem;antibody encoding;uniform design