메뉴 건너뛰기




Volumn , Issue , 2006, Pages 1521-1528

Directed evolutionary programming: Towards an improved performance of evolutionary programming

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED EVOLUTIONARY PROGRAMMING; DIVERSIFICATION; INTENSIFICATION SCHEMES;

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

References (25)
  • 2
    • 0003913211 scopus 로고    scopus 로고
    • T. Bäck, D.B. Fogel and Z. Michalewicz Eds, Institute of Physics Publishing
    • T. Bäck, D.B. Fogel and Z. Michalewicz (Eds.), Evolutionary Computation 1: Basic Algorithms and Operators, Institute of Physics Publishing, 2000.
    • (2000) Evolutionary Computation 1: Basic Algorithms and Operators
  • 3
    • 0037592480 scopus 로고    scopus 로고
    • Evolution strategies: A comprehensive introduction
    • H.-G. Beyer and H.-P. Schwefel. Evolution strategies: A comprehensive introduction. Natural Computing, 1:3-52, 2002.
    • (2002) Natural Computing , vol.1 , pp. 3-52
    • Beyer, H.-G.1    Schwefel, H.-P.2
  • 4
    • 0038612858 scopus 로고    scopus 로고
    • The balance between proximity and diversity in multiobjective evolutionary algorithms
    • P. Bosman, and D. Thierens. The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 7:174-188, 2003.
    • (2003) IEEE Transactions on Evolutionary Computation , vol.7 , pp. 174-188
    • Bosman, P.1    Thierens, D.2
  • 6
    • 34547244335 scopus 로고    scopus 로고
    • N. Hansen. The CMA evolution strategy: A comparing review, in Towards a new evolutionary computation, Edited by J.A. Lozano, P. Larraaga, I. Inza, and E. Bengoetxea (Eds.), Springer-Verlag, Berlin, 2006.
    • N. Hansen. "The CMA evolution strategy: A comparing review," in Towards a new evolutionary computation, Edited by J.A. Lozano, P. Larraaga, I. Inza, and E. Bengoetxea (Eds.), Springer-Verlag, Berlin, 2006.
  • 7
    • 0041344305 scopus 로고    scopus 로고
    • Minimizing multimodal functions by simplex coding genetic algorithm
    • A. Hedar, and M. Fukushima. Minimizing multimodal functions by simplex coding genetic algorithm. Optimization Methods and Software, 18: 265-282, 2003.
    • (2003) Optimization Methods and Software , vol.18 , pp. 265-282
    • Hedar, A.1    Fukushima, M.2
  • 8
    • 3042681636 scopus 로고    scopus 로고
    • A. Hedar, and M. Fukushima. Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optimization Methods and Software 19:29.1-308, 2004.
    • A. Hedar, and M. Fukushima. Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optimization Methods and Software 19:29.1-308, 2004.
  • 9
    • 26844575560 scopus 로고    scopus 로고
    • Tabu search directed by direct search methods for nonlinear global optimization
    • A. Hedar, and M. Fukushima. Tabu search directed by direct search methods for nonlinear global optimization. European Journal of Operational Research, 170:329-349, 2006.
    • (2006) European Journal of Operational Research , vol.170 , pp. 329-349
    • Hedar, A.1    Fukushima, M.2
  • 10
    • 33746031813 scopus 로고    scopus 로고
    • Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization
    • to appear
    • A. Hedar, and M. Fukushima. Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization. Journal of Global. Optimization, to appear.
    • Journal of Global. Optimization
    • Hedar, A.1    Fukushima, M.2
  • 11
    • 0141860955 scopus 로고    scopus 로고
    • The niching method for obtaining global optima and local optima in multimodal functions
    • M. Himeno, and R. Himeno. The niching method for obtaining global optima and local optima in multimodal functions. System and Computers in Japan, 34:1015-1027, 2003.
    • (2003) System and Computers in Japan , vol.34 , pp. 1015-1027
    • Himeno, M.1    Himeno, R.2
  • 12
    • 0142058675 scopus 로고    scopus 로고
    • F. Glover and G.A. Kochenberger Eds, Kluwer Academic Publishers, Boston, MA
    • F. Glover and G.A. Kochenberger (Eds.). Handbook of Metaheursitics. Kluwer Academic Publishers, Boston, MA, 2003.
    • (2003) Handbook of Metaheursitics
  • 13
    • 0033274347 scopus 로고    scopus 로고
    • Detection, and remediation, of stagnation in the Nelder-Mead algorithm, using a sufficient decrease condition
    • C. T. Kelley. Detection, and remediation, of stagnation in the Nelder-Mead algorithm, using a sufficient decrease condition, SIAM J. Optim., 10:43-55, 1999.
    • (1999) SIAM J. Optim , vol.10 , pp. 43-55
    • Kelley, C.T.1
  • 15
    • 32444448107 scopus 로고    scopus 로고
    • O. Kramer, C-K. Ting and H.K. Büning. A. mutation operator for evolution strategies to handle constrained problems. GECCO'05, June 25-29, 2005, Washington, DC, USA.
    • O. Kramer, C-K. Ting and H.K. Büning. A. mutation operator for evolution strategies to handle constrained problems. GECCO'05, June 25-29, 2005, Washington, DC, USA.
  • 16
    • 34547269999 scopus 로고    scopus 로고
    • M. Laguna and R. Marti. Scatter Search: Methodology and Implementations in C, Kluwer Academic Publishers, Boston., 2003.
    • M. Laguna and R. Marti. Scatter Search: Methodology and Implementations in C, Kluwer Academic Publishers, Boston., 2003.
  • 17
    • 1542273610 scopus 로고    scopus 로고
    • Evolutionary programming using the mutations based on the Levy probability distribution
    • C.Y. Lee and X. Yao. Evolutionary programming using the mutations based on the Levy probability distribution. IEEE Transactions on Evolutionary Computation, 8:1-13, 2004.
    • (2004) IEEE Transactions on Evolutionary Computation , vol.8 , pp. 1-13
    • Lee, C.Y.1    Yao, X.2
  • 18
    • 33751383531 scopus 로고    scopus 로고
    • J.A. Lozano, P. Larraaga, I. Inza, and E. Bengoetxea Eds, Springer-Verlag, Berlin
    • J.A. Lozano, P. Larraaga, I. Inza, and E. Bengoetxea (Eds.). Towards a new evolutionary computation. Springer-Verlag, Berlin, 2006.
    • (2006) Towards a new evolutionary computation
  • 21
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • J.A. Neider and R. Mead. A simplex method for function minimization, Comput. J., 7:308-313, 1965.
    • (1965) Comput. J , vol.7 , pp. 308-313
    • Neider, J.A.1    Mead, R.2
  • 23
    • 28244475963 scopus 로고    scopus 로고
    • Evolving better population distribution, and exploration in evolutionary multi-ojective optimization
    • K.C. Tan, C.K. Goh, Y.J. Yang and T.H. Lee. Evolving better population distribution, and exploration in evolutionary multi-ojective optimization. European Journal of Operational Research, 171:463-495, 2006.
    • (2006) European Journal of Operational Research , vol.171 , pp. 463-495
    • Tan, K.C.1    Goh, C.K.2    Yang, Y.J.3    Lee, T.H.4
  • 24
    • 34547346154 scopus 로고    scopus 로고
    • Y.Z. Tzypkin. Information theory of Identification. Nauka: Fizmatlit, Moskow, 1995. (In Russian)
    • Y.Z. Tzypkin. Information theory of Identification. Nauka: Fizmatlit, Moskow, 1995. (In Russian)


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