2020
DOI: 10.1016/j.jsv.2020.115315
|View full text |Cite
|
Sign up to set email alerts
|

An efficient approach to model updating for a multispan railway bridge using orthogonal diagonalization combined with improved particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0
1

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 61 publications
(22 citation statements)
references
References 38 publications
0
21
0
1
Order By: Relevance
“…After that, an optimization-based model updating technique is used to minimize the difference between modal characteristics of cables with the numerical counterpart, including eigenfrequencies and mode shapes. As detailed solutions for similar problems can be found in the optimization literature [33], [34], thus for brevity, one only presents measured forces in cables in Table V.…”
Section: B Case Study 2: My Thuan Stayed-bridgementioning
confidence: 99%
“…After that, an optimization-based model updating technique is used to minimize the difference between modal characteristics of cables with the numerical counterpart, including eigenfrequencies and mode shapes. As detailed solutions for similar problems can be found in the optimization literature [33], [34], thus for brevity, one only presents measured forces in cables in Table V.…”
Section: B Case Study 2: My Thuan Stayed-bridgementioning
confidence: 99%
“…7, and at this time the population is in the global search stage; When 1 | E | ≤ , the agents move according to Eq. (10), (11), (14) and (16). At this time, the population can choose a variety of movement methods, which expands the movement range of the agents in a certain local area and increases exploitation of the agents.…”
Section: B Henry Gas Solubility Optimization Algorithm Based On Harrmentioning
confidence: 99%
“…When HHO-HGSO is executed, all agents will select a position update strategy based on Eq. (7), (10), (11), (14), (16) in each iteration. The complexity of these location update strategies are the same, so the time complexity of HHO-HGSO will not increase, which is still o(obj) * d) * n * o(t .…”
Section: ) Time Complexitymentioning
confidence: 99%
See 1 more Smart Citation
“…rough adopting lots of benchmarks with different characteristics in the experiments, it is proved that PSOCO is a competitive PSO variant for some benchmark functions. Tran-Ngoc et al [47] improved the calculation method of PSO's inertia weight factor by introducing contraction factor K to improve the disadvantage of premature convergence of PSO. en, the best local position of particles in PSO based on orthogonal diagonalization (OD) was arranged, which greatly reduced the calculation cost of PSO.…”
Section: Introductionmentioning
confidence: 99%