메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1005-1012

Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm

Author keywords

Decomposable problems; Genetic algorithms; Linkage learning; Linkage tree genetic algorithm; Prior problem specific knowledge; Problem decomposition

Indexed keywords

DECOMPOSABLE PROBLEMS; LINKAGE LEARNING; LINKAGE TREE GENETIC ALGORITHM; PROBLEM DECOMPOSITION; PROBLEM-SPECIFIC KNOWLEDGE;

EID: 84860417120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001713     Document Type: Conference Paper
Times cited : (22)

References (21)
  • 1
    • 0002589531 scopus 로고
    • An empirical study of bit vector function optimization
    • D. H. Ackley. An empirical study of bit vector function optimization. Genetic Algorithms and Simulated Annealing, pages 170-204, 1987.
    • (1987) Genetic Algorithms and Simulated Annealing , pp. 170-204
    • Ackley, D.H.1
  • 6
    • 56549124449 scopus 로고    scopus 로고
    • Enhancing efficiency of hierarchical BOA via distance-based model restrictions
    • M. Hauschild and M. Pelikan. Enhancing efficiency of hierarchical BOA via distance-based model restrictions. Parallel Problem Solving from Nature, pages 417-427, 2008.
    • (2008) Parallel Problem Solving from Nature , pp. 417-427
    • Hauschild, M.1    Pelikan, M.2
  • 9
    • 0000794587 scopus 로고
    • Adaptation on rugged fitness landscapes
    • D. L. Stein, editor Addison Wesley
    • S. Kauffman. Adaptation on rugged fitness landscapes. In D. L. Stein, editor, Lecture Notes in the Sciences of Complexity, pages 527-618. Addison Wesley, 1989.
    • (1989) Lecture Notes in the Sciences of Complexity , pp. 527-618
    • Kauffman, S.1
  • 12
    • 77955866788 scopus 로고    scopus 로고
    • NK landscapes, problem difficulty, and hybrid evolutionary algorithms
    • M. Pelikan. NK landscapes, problem difficulty, and hybrid evolutionary algorithms. Genetic and Evol. Comp. Conf. (GECCO-2010), pages 665-672, 2010.
    • (2010) Genetic and Evol. Comp. Conf. (GECCO-2010) , pp. 665-672
    • Pelikan, M.1
  • 14
    • 0036856568 scopus 로고    scopus 로고
    • Scalability of the Bayesian optimization algorithm
    • DOI 10.1016/S0888-613X(02)00095-6, PII S0888613X02000956
    • M. Pelikan, K. Sastry, and D. E. Goldberg. Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258, 2002. (Pubitemid 35411832)
    • (2002) International Journal of Approximate Reasoning , vol.31 , Issue.3 , pp. 221-258
    • Pelikan, M.1    Sastry, K.2    Goldberg, D.E.3
  • 16
    • 4344572502 scopus 로고    scopus 로고
    • Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL
    • K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
    • (2001) Evaluation-relaxation Schemes for Genetic and Evolutionary Algorithms
    • Sastry, K.1
  • 17
    • 0033258368 scopus 로고    scopus 로고
    • Scalability problems of simple genetic algorithms
    • D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331-352, 1999.
    • (1999) Evolutionary Computation , vol.7 , Issue.4 , pp. 331-352
    • Thierens, D.1
  • 21


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.