Experimental comparison of two evolutionary algorithms for the independent set problem

被引：0
|
作者：
Borisovsky, PA
Zavolovskaya, MS
机构：
[1] Sobolev Inst Math, Omsk Branch, Omsk 644099, Russia
[2] Omsk State Univ, Dept Math, Omsk 644077, Russia
来源：
APPLICATIONS OF EVOLUTIONARY COMPUTING | 2003年 / 2611卷
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This work presents an experimental comparison of the steady-state genetic algorithm to the (1+1)-evolutionary algorithm applied to the maximum vertex independent set problem. The penalty approach is used for both algorithms and tuning of the penalty function is considered in the first part of the paper. In the second part we give some reasons why one could expect the competitive performance of the (1+1)-EA. The results of computational experiment are presented.
引用
收藏
页码：154 / 164
页数：11
相关论文
共 50 条
  • [1] Approximation algorithms for the weighted independent set problem
    Kako, A
    Ono, T
    Hirata, T
    Halldórsson, MM
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 341 - 350
  • [2] Algorithms for the Independent Feedback Vertex Set Problem
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (06): : 1179 - 1188
  • [3] A Novel Evolutionary Formulation of the Maximum Independent Set Problem
    Valmir C. Barbosa
    Luciana C. D. Campos
    Journal of Combinatorial Optimization, 2004, 8 : 419 - 437
  • [4] A novel evolutionary formulation of the maximum independent set problem
    Barbosa, VC
    Campos, LCD
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (04) : 419 - 437
  • [5] EXPERIMENTAL COMPARISON OF ALGORITHMS FOR THE PROBLEM OF THE MAXIMUM SET OF PAIRWISE INCOMPARABLE VERTICES IN A DIGRAPH
    VOITISHIN, YV
    CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (05) : 788 - 791
  • [6] EXPERIMENTAL COMPARISON OF ALGORITHMS FOR THE SET COVERING PROBLEM AND THE OPTIMIZATION PROBLEM OF A PSEUDO-BOOLEAN FUNCTION
    BILLIONNET, A
    CARADOT, I
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1983, 17 (01): : 15 - 20
  • [7] Deterministic Algorithms for the Independent Feedback Vertex Set Problem
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 351 - 363
  • [8] A Comparison of Evolutionary Algorithms on a Set of Antenna Design Benchmarks
    Basak, Aniruddha
    Lohn, Jason D.
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 598 - 604
  • [9] On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms
    Vecek, Niki
    Crepinsek, Matej
    Mernik, Marjan
    APPLIED SOFT COMPUTING, 2017, 54 : 23 - 45
  • [10] An experimental comparison of two approximation algorithms for the shortest common superstring problem
    Romero, HJ
    Brizuela, CA
    Tchernykh, A
    PROCEEDINGS OF THE FIFTH MEXICAN INTERNATIONAL CONFERENCE IN COMPUTER SCIENCE (ENC 2004), 2004, : 27 - 34
12345