Analysis of an embedded crossover scheme on a GA-hard problem

被引：0
|
作者：
Venkatachalam, A.R.
机构：
来源：
Computers & Operations Research | 1995年 / 22卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] AN ANALYSIS OF AN EMBEDDED CROSSOVER SCHEME ON A GA-HARD PROBLEM
    VENKATACHALAM, AR
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (01) : 149 - 157
  • [2] AN ANALYSIS OF A REORDERING OPERATOR ON A GA-HARD PROBLEM
    GOLDBERG, DE
    BRIDGES, CL
    BIOLOGICAL CYBERNETICS, 1990, 62 (05) : 397 - 405
  • [3] An analysis of a reordering operator with tournament selection on a GA-hard problem
    Chen, YP
    Goldberg, DE
    GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2003, PT I, PROCEEDINGS, 2003, 2723 : 825 - 836
  • [4] Solving GA-Hard Problems with EMMRS and GPGPUs
    Hidalgo, J. Ignacio
    Colmenar, J. Manuel
    Risco-Martin, Jose L.
    Sanchez-Lacruz, Carlos
    Lanchares, Juan
    Garnica, Oscar
    GECCO'14: PROCEEDINGS OF THE 2014 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2014, : 1007 - 1014
  • [5] Why DGAs work well on GA-hard functions?
    Kuo, T
    Hwang, SY
    NEW GENERATION COMPUTING, 1996, 14 (04) : 459 - 479
  • [6] Why DGAs work well on GA-hard functions?
    Natl Chiao Tung Univ, Hsinchu, Taiwan
    New Gener Comput, 4 (459-479):
  • [7] The unscented genetic algorithm for fast solution of GA-hard optimization problems
    Aguilar-Rivera, Anton
    APPLIED SOFT COMPUTING, 2023, 139
  • [8] Digital Signature Scheme Based on a New Hard Problem
    Moldovyan, Nikolay A.
    COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2008, 16 (02) : 163 - 182
  • [9] A novel crossover operator of GA - Schemata analysis and experiments
    Chen, XF
    Jaing, L
    Wang, J
    Song, Y
    Zhuang, ZQ
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2003, : 269 - 274
  • [10] Controlled Content Crossover: A new crossover scheme and its application to optical network component allocation problem
    Dallaali, MA
    Premaratne, M
    GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS, 2004, 3103 : 387 - 389
12345