메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 1831-1838

Promoting diversity using migration strategies in distributed genetic algorithms

Author keywords

[No Author keywords available]

Indexed keywords

BIODIVERSITY; CLONING; DISTRIBUTED COMPUTER SYSTEMS;

EID: 27144530232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (12)
  • 1
    • 85015307341 scopus 로고
    • On solving the travelling salesman problem by genetic algorithms
    • [Braun, 1990]
    • [Braun, 1990] Braun, H. (1990). On solving the travelling salesman problem by genetic algorithms. Parallel Problem Solving from Nature, pages 129-133.
    • (1990) Parallel Problem Solving from Nature , pp. 129-133
    • Braun, H.1
  • 4
    • 0344723024 scopus 로고    scopus 로고
    • An experimental study of benchmarking functions for genetic algorithms
    • [Digalakis and Margaritis, 2002]
    • [Digalakis and Margaritis, 2002] Digalakis, J. G. and Margaritis, K. G. (2002). An experimental study of benchmarking functions for genetic algorithms. Int. J. Comput. Math., 79(4):403-416.
    • (2002) Int. J. Comput. Math. , vol.79 , Issue.4 , pp. 403-416
    • Digalakis, J.G.1    Margaritis, K.G.2
  • 6
  • 7
    • 0002977436 scopus 로고
    • An efficient migration scheme for subpopulation-based asynchronously parallel genetic algorithms
    • [Munetomo et al., 1993]
    • [Munetomo et al., 1993] Munetomo, M., Takai, Y., and Y., S. (1993). An efficient migration scheme for subpopulation-based asynchronously parallel genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, pages 160-168.
    • (1993) Proceedings of the Fifth International Conference on Genetic Algorithms , pp. 160-168
    • Munetomo, M.1    Takai, Y.2    Y., S.3


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