메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Robust optimization over time - A new perspective on dynamic optimization problems

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; COMPARING ALGORITHM; DYNAMIC OPTIMIZATION PROBLEMS; ON DYNAMICS; OPTIMAL SOLUTIONS; PERFORMANCE MEASURE; ROBUST OPTIMIZATION; ROOT PROBLEMS; TEST PROBLEM;

EID: 79959460003     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586024     Document Type: Conference Paper
Times cited : (84)

References (27)
  • 2
    • 21044438483 scopus 로고    scopus 로고
    • Evolutionary optimization in uncertain environments - A survey
    • Y. Jin and J. Branke, "Evolutionary optimization in uncertain environments - A survey," IEEE Transactions on Evolutionary Computation, vol. 9, no. 3, pp. 303-317, 2005.
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , Issue.3 , pp. 303-317
    • Jin, Y.1    Branke, J.2
  • 3
    • 65149101154 scopus 로고    scopus 로고
    • Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization
    • X. Yu, K. Tang, T. Chen, and X. Yao, "Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization," Memetic Computing, vol. 1, no. 1, pp. 3-24, 2009.
    • (2009) Memetic Computing , vol.1 , Issue.1 , pp. 3-24
    • Yu, X.1    Tang, K.2    Chen, T.3    Yao, X.4
  • 6
  • 9
    • 84901453819 scopus 로고    scopus 로고
    • Memory enhanced evolutionary algorithms for changing optimization problems
    • J. Branke, "Memory enhanced evolutionary algorithms for changing optimization problems," in Proceedings of the 1999 IEEE Congress on Evolutionary Computation, vol. 3, pp. 1875-1882, 1999.
    • (1999) Proceedings of the 1999 IEEE Congress on Evolutionary Computation , vol.3 , pp. 1875-1882
    • Branke, J.1
  • 15
    • 0031696684 scopus 로고    scopus 로고
    • Antioptimization of structures with large uncertain-but-non-random parameters via interval analysis
    • Z. Qiu and I. Elishakoff, "Antioptimization of structures with large uncertain-but-non-random parameters via interval analysis," Computer Methods in Applied Mechanics and Engineering, vol. 152, pp. 361-372, 1998.
    • (1998) Computer Methods in Applied Mechanics and Engineering , vol.152 , pp. 361-372
    • Qiu, Z.1    Elishakoff, I.2
  • 16
    • 0035255129 scopus 로고    scopus 로고
    • Anti-optimisation of uncertain structures using interval analysis
    • S. McWilliam, "Anti-optimisation of uncertain structures using interval analysis," Computers and Structures, vol. 79, pp. 421-430, 2001.
    • (2001) Computers and Structures , vol.79 , pp. 421-430
    • McWilliam, S.1
  • 17
    • 3543065005 scopus 로고    scopus 로고
    • On the behavior of (μ/μI, λ)-ES optimizing functions disturbed by generalized noise
    • K. De Jong, R. Poli, J. Rowe (Eds.) Morgan Kaufman, San Francisco, CA
    • H.-G. Beyer, M. Olhofer, and B. Sendhoff, "On the behavior of (μ/μI , λ)-ES optimizing functions disturbed by generalized noise," in K. De Jong, R. Poli, J. Rowe (Eds.), Foundations of Genetic Algorithms, vol. 7, Morgan Kaufman, San Francisco, CA, pp. 307-328, 2003.
    • (2003) Foundations of Genetic Algorithms , vol.7 , pp. 307-328
    • Beyer, H.-G.1    Olhofer, M.2    Sendhoff, B.3
  • 18
    • 84958976161 scopus 로고    scopus 로고
    • A robust solution searching scheme in genetic search
    • Springer-Verlag
    • S. Tsutsui, A. Ghosh, and Y. Fujimoto, "A robust solution searching scheme in genetic search," in Parallel Problem Solving from Nature, Springer-Verlag, pp.543-553, 1996.
    • (1996) Parallel Problem Solving from Nature , pp. 543-553
    • Tsutsui, S.1    Ghosh, A.2    Fujimoto, Y.3
  • 19
    • 33747440759 scopus 로고    scopus 로고
    • Max-min surrogate-assisted evolutionary algorithm for robust design
    • Y. S. Ong, P. B. Nair, and K. Y. Lum, "Max-min surrogate-assisted evolutionary algorithm for robust design," IEEE Transactions on Evolutionary Computation, vol. 10, no. 4, pp. 392-404, 2006.
    • (2006) IEEE Transactions on Evolutionary Computation , vol.10 , Issue.4 , pp. 392-404
    • Ong, Y.S.1    Nair, P.B.2    Lum, K.Y.3
  • 21
    • 35048825495 scopus 로고    scopus 로고
    • Constructing dynamic optimization test problems using the multi-objective optimization concept
    • EvoWorkshop 2004
    • Y. Jin and B. Sendhoff, "Constructing dynamic optimization test problems using the multi-objective optimization concept," EvoWorkshop 2004, Lecture Notes in Computer Science, vol. 3005, pp. 526-536, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3005 , pp. 526-536
    • Jin, Y.1    Sendhoff, B.2
  • 23
    • 27144484035 scopus 로고    scopus 로고
    • Experimental study on population-based incremental learning algorithms for dynamic optimization problems
    • S. Yang and X. Yao, "Experimental study on population-based incremental learning algorithms for dynamic optimization problems," Soft Computing, vol. 9, no. 11, pp. 815-834, 2005.
    • (2005) Soft Computing , vol.9 , Issue.11 , pp. 815-834
    • Yang, S.1    Yao, X.2
  • 24
    • 53349178106 scopus 로고    scopus 로고
    • Population-based incremental learning with associative memory for dynamic environments
    • S. Yang and X. Yao, "Population-based incremental learning with associative memory for dynamic environments," IEEE Transactions on Evolutionary Computation, vol. 12, no. 5, pp. 542-561, 2008.
    • (2008) IEEE Transactions on Evolutionary Computation , vol.12 , Issue.5 , pp. 542-561
    • Yang, S.1    Yao, X.2
  • 26
    • 67650694035 scopus 로고    scopus 로고
    • The dynamic knapsack problem revisited: A new benchmark problem for dynamic combinatorial optimisation
    • EvoWorkshops 2009, Springer-Verlag, Berlin
    • P. Rohlfshagen and X. Yao, "The dynamic knapsack problem revisited: A new benchmark problem for dynamic combinatorial optimisation," EvoWorkshops 2009, Lecture Notes in Computer Science, vol. 5484, Springer-Verlag, Berlin, pp. 745-754, 2009.
    • (2009) Lecture Notes in Computer Science , vol.5484 , pp. 745-754
    • Rohlfshagen, P.1    Yao, X.2


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