메뉴 건너뛰기




Volumn 30, Issue 7, 1997, Pages 4529-4538

A new hybrid genetic algorithm for global optimization

Author keywords

Branch and bound; Genetic algorithms; Global optimization; Hybrid algorithm; Interval arithmetic; Termination criterion

Indexed keywords


EID: 0005553841     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0362-546X(96)00367-7     Document Type: Article
Times cited : (34)

References (20)
  • 4
    • 0004293209 scopus 로고
    • Prentice-Hall, Englewood Cliffs, New Jersey
    • MOORE R.E., Interval Analysis, Prentice-Hall, Englewood Cliffs, New Jersey, (1966).
    • (1966) Interval Analysis
    • Moore, R.E.1
  • 9
    • 0030129611 scopus 로고    scopus 로고
    • Hybrid methods using genetic algorithms for global optimization
    • RENDERS J. & FLASSE S., Hybrid Methods Using Genetic Algorithms for Global Optimization,IEEE Trans. Syst., Man, Cybern., 26, 243-258, (1996).
    • (1996) IEEE Trans. Syst., Man, Cybern. , vol.26 , pp. 243-258
    • Renders, J.1    Flasse, S.2
  • 10
  • 11
    • 0027701744 scopus 로고
    • What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
    • FORREST S. & MITCHELL M., What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation, Machine Learning, 13, 285-319, (1993).
    • (1993) Machine Learning , vol.13 , pp. 285-319
    • Forrest, S.1    Mitchell, M.2
  • 12
    • 0042996189 scopus 로고    scopus 로고
    • Effective backpropagation training with variable stepsize
    • in press
    • MAGOULAS G.D., VRAHATIS M.N. & ANDROULAKIS G.S., Effective backpropagation training with variable stepsize, Neural Networks, 9, No. 6, (1996), in press.
    • (1996) Neural Networks , vol.9 , Issue.6
    • Magoulas, G.D.1    Vrahatis, M.N.2    Androulakis, G.S.3
  • 13
    • 44049112575 scopus 로고
    • Genetic algorithms and very fast simulated reannealing: A comparison
    • INGBERG L. & ROSEN B., Genetic Algorithms and Very Fast Simulated Reannealing: A Comparison, J. Mathematical and Computer Modeling, 16, 87-100, (1992).
    • (1992) J. Mathematical and Computer Modeling , vol.16 , pp. 87-100
    • Ingberg, L.1    Rosen, B.2
  • 15
    • 0012929541 scopus 로고
    • Interval tools for global optimization
    • RATSCHEK H. & ROKNE J., Interval Tools for Global Optimization, Computers Math. Applic., 21, 41-50, (1991).
    • (1991) Computers Math. Applic. , vol.21 , pp. 41-50
    • Ratschek, H.1    Rokne, J.2
  • 18
    • 0000607541 scopus 로고
    • On the selection of subdivision directions in interval branch-and-bound methods for global optimization
    • RATZ D. & CSENDES T., On the Selection of Subdivision Directions in Interval Branch-and-Bound Methods for Global Optimization, J. Global Optimization , 7, 183-207, (1995).
    • (1995) J. Global Optimization , vol.7 , pp. 183-207
    • Ratz, D.1    Csendes, T.2
  • 19
    • 85033109877 scopus 로고    scopus 로고
    • Subdivision directions selection in interval methods for global optimization
    • CSENDES T. & RATZ D., Subdivision directions selection in interval methods for global optimization. To appear in SIAM Journal of Numerical Analysis.
    • SIAM Journal of Numerical Analysis
    • Csendes, T.1    Ratz, D.2


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