메뉴 건너뛰기




Volumn , Issue , 2011, Pages 158-163

Novelty-based restarts for evolution strategies

Author keywords

black box optimization; evolution strategies; novelty search; restart strategies

Indexed keywords

BASIN OF ATTRACTION; BLACK BOXES; BLACK-BOX OPTIMIZATION; EVOLUTION STRATEGIES; LOCAL OPTIMA; MULTI-MODAL; NOVEL SOLUTIONS; NOVELTY SEARCH; RANDOM RESTART; RESTART STRATEGY; SEARCH ALGORITHMS; SEARCH SPACES; TEST PROBLEM; WORKING PRINCIPLES;

EID: 80052019354     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2011.5949613     Document Type: Conference Paper
Times cited : (15)

References (20)
  • 1
    • 27144512834 scopus 로고    scopus 로고
    • A restart CMA evolution strategy with increasing population size
    • 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
    • A. Auger and N. Hansen. A restart CMA evolution strategy with increasing population size. In B. McKay et al., editors, The 2005 IEEE International Congress on Evolutionary Computation (CEC'05), volume 2, pages 1769-1776, 2005. (Pubitemid 41496063)
    • (2005) 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings , vol.2 , pp. 1769-1776
    • Auger, A.1    Hansen, N.2
  • 2
    • 0000401181 scopus 로고
    • A sequential niche technique for multimodal function optimization
    • David Beasley, David R. Bull, and Ralph R. Martin. A Sequential Niche Technique for Multimodal Function Optimization. Evolutionary Computation, 1(2):101-125, 1993.
    • (1993) Evolutionary Computation , vol.1 , Issue.2 , pp. 101-125
    • Beasley, D.1    Bull, D.R.2    Martin, R.R.3
  • 3
    • 0037592480 scopus 로고    scopus 로고
    • Evolution strategiesa comprehensive introduction
    • H.-G. Beyer and H.-P. Schwefel. Evolution strategiesa comprehensive introduction. Natural Computing, 1:3-52, 2002.
    • (2002) Natural Computing , vol.1 , pp. 3-52
    • Beyer, H.-G.1    Schwefel, H.-P.2
  • 10
    • 0035377566 scopus 로고    scopus 로고
    • Completely derandom-ized self-adaptation in evolution strategies
    • N. Hansen and A. Ostermeier. Completely derandom-ized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195, 2001.
    • (2001) Evolutionary Computation , vol.9 , Issue.2 , pp. 159-195
    • Hansen, N.1    Ostermeier, A.2
  • 11
    • 84901404865 scopus 로고    scopus 로고
    • The pareto archived evolution strategy: A new baseline algorithm for pareto mul-tiobjective optimisation
    • J. D. Knowles and D. W. Corne. The pareto archived evolution strategy: A new baseline algorithm for pareto mul-tiobjective optimisation. In Proceedings of the Congress on Evolutionary Computation (CEC'99), pages 98-105, 1999.
    • (1999) Proceedings of the Congress on Evolutionary Computation (CEC'99) , pp. 98-105
    • Knowles, J.D.1    Corne, D.W.2
  • 12
    • 78751651094 scopus 로고    scopus 로고
    • Abandoning objectives: Evolution through the search for novelty alone
    • Joel Lehman and Kenneth Stanley. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary Computation Journal, 2010.
    • (2010) Evolutionary Computation Journal
    • Lehman, J.1    Stanley, K.2


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