Uniformly sampled genetic algorithm with gradient search for structural identification - Part II: Local search

Authors:
Z. Zhang;C. G. Koh;W. H. Duan
Affiliations:
Department of Civil Engineering, National University of Singapore, 117576 Singapore, Singapore;Department of Civil Engineering, National University of Singapore, 117576 Singapore, Singapore;Department of Civil Engineering, Monash University, Clayton, VIC 3800, Australia
Venue:
Computers and Structures
Year:
2010

Citing 7
Cited 0

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Damage detection by an adaptive real-parameter simulated annealing genetic algorithm

Computers and Structures
Differential evolution strategy for structural system identification

Computers and Structures
A hybrid Particle Swarm Optimization - Simplex algorithm (PSOS) for structural damage identification

Advances in Engineering Software
Modified genetic algorithm strategy for structural identification

Computers and Structures
Uniformly sampled genetic algorithm with gradient search for structural identification - Part I: Global search

Computers and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates several gradient local search methods as an enhancement to Part I, to further improve the computational efficiency while achieving the same identification accuracy. The present study is significant in several ways. First, this study reveals the characteristics of structural identification from the optimization perspective. Second, the ''switch point'' from global search to local search is determined with due consideration in convergence speed and avoidance of local optima. Finally, the combined strategy based on Part I and Part II with a particular local search (BFGS) is found to achieve substantial improvement in identification efficiency and accuracy.