Journal
COMPUTERS & STRUCTURES
Volume 88, Issue 15-16, Pages 949-962Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compstruc.2010.05.001
Keywords
Structural identification; Genetic algorithms; Sampling methods; Quasi-random sequence
Ask authors/readers for more resources
This paper is the first of two-part series on a uniformly sampled genetic algorithm with gradient search devised to efficiently solve the optimization-based structural identification. The strategy involves multi-species exploration, adaptive search space reduction and quasi-random sequence sampling. The use of a small number of uniform samples enables preliminary exploration in the solution space so as to shorten the learning curve considerably. The proposed strategy is shown by numerical study to give much better identification accuracy than the original search space reduction method, while using much less computational time for identification of known-mass and unknown-mass systems. (C) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available