• DocumentCode
    2865101
  • Title

    A Hybrid Genetic Algorithm for Cable Forces Optimization of CFST Arch Bridge

  • Author

    Sun, Guo-fu ; Li, Ji-hua ; Li, Shu-cai ; Zhang, Bo

  • fYear
    2009
  • fDate
    11-13 Dec. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In traditional simulation calculation of concrete filled steel tubular (CFST) arch bridge, to find out the initial state of the backward analysis is very difficult due to the force-bearing characteristics of CFST arch bridge. Genetic algorithm (GA), as a general-purposed global optimization algorithm, has the disadvantages of the premature phenomenon and poor performance in local optimization. In the present paper, a hybrid genetic algorithm (HGA), which combines the conjugate gradient method (CGM) with GA, is proposed to improve the performance of GA for cable forces optimization in a CFST arch bridge. The advantages of GA in global optimization and CGM in local searching ability are both included in the HGA method. Numerical example indicates that the results based on the method may be used to the backward analysis of the initial state, and that the proposed HGA has excellent features of quick convergence rate and best global performance.
  • Keywords
    bridges (structures); cables (mechanical); concrete; genetic algorithms; gradient methods; pipes; CFST arch bridge; HGA method; backward analysis; cable forces optimization; concrete filled steel tubular arch bridge; conjugate gradient method; force-bearing characteristics; general-purposed global optimization algorithm; hybrid genetic algorithm; simulation calculation; Analytical models; Bridges; Concrete; Convergence of numerical methods; Genetic algorithms; Gradient methods; Optimization methods; Performance analysis; Steel; User-generated content;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-4507-3
  • Electronic_ISBN
    978-1-4244-4507-3
  • Type

    conf

  • DOI
    10.1109/CISE.2009.5366302
  • Filename
    5366302