Theoretical and Empirical Analyses of Evolutionary Negative Selection Algorithms for a Combinational Optimization Problem

被引:0
作者
Pei, Xingxin [1 ]
Luo, Wenjian [1 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Nat Inspired Computat & Applicat Lab, Hefei 230027, Anhui, Peoples R China
来源
2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS | 2009年
关键词
TIME; COMPLEXITY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary Negative Selection Algorithms (ENSAs) could be regarded as hybrid algorithms of Evolutionary Algorithms (EAs) and Negative Selection Algorithms (NSAs). The average time complexity of ENSAs on combinational optimization problems has never been studied before. In this paper, the average time complexity of ENSAs on one combinational optimization problem is analyzed. The theoretical results demonstrate that, for the Two Max function, the ENSA with an appropriate matching threshold could perform better than the traditional (N+N) EA. Some simulation experiments on the combinational problem are also done, and the experimental results are consistent with theoretical results.
引用
收藏
页码:270 / 277
页数:8
相关论文
共 30 条
  • [1] Clark E, 2005, LECT NOTES COMPUT SC, V3627, P318
  • [2] On the convergence of immune algorithms
    Cutello, Vincenzo
    Nicosia, Giuseppe
    Romeo, Mario
    Oliveto, Pietro S.
    [J]. 2007 IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTATIONAL INTELLIGENCE, VOLS 1 AND 2, 2007, : 409 - +
  • [3] Artificial immune system (AIS) research in the last five years
    Dasgupta, D
    Ji, Z
    González, F
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 123 - 130
  • [4] Dasgupta D., 2008, IMMUNOLOGICAL COMPUT
  • [5] de Castro LeandroN., 2002, ARTIFICIAL IMMUNE SY
  • [6] Learning and optimization using the clonal selection principle
    de Castro, LN
    Von Zuben, FJ
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (03) : 239 - 251
  • [7] An immunological approach to change detection: Algorithms, analysis and implications
    Dhaeseleer, P
    Forrest, S
    Helman, P
    [J]. 1996 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 1996, : 110 - 119
  • [8] Drosdowsky W, 2002, AUST METEOROL MAG, V51, P1
  • [9] A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs
    Droste, S
    Jansen, T
    Wegener, I
    [J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 499 - 504
  • [10] Forrest S., 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy (Cat. No.94CH3444-7), P202, DOI 10.1109/RISP.1994.296580