2019
DOI: 10.1007/s00366-019-00848-4
|View full text |Cite
|
Sign up to set email alerts
|

A novel inverse procedure for load identification based on improved artificial tree algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 36 publications
0
5
0
Order By: Relevance
“…First, two optimization objectives are considered in the B-pillar and the rocker, that maximizing MCF and minimizing SM. We use the MOAT algorithm [51][52][53][54] to optimize the two-objective issues. The theory of MOAT algorithm is shown in supplementary file.…”
Section: Optimize the B-pillar And The Rockermentioning
confidence: 99%
“…First, two optimization objectives are considered in the B-pillar and the rocker, that maximizing MCF and minimizing SM. We use the MOAT algorithm [51][52][53][54] to optimize the two-objective issues. The theory of MOAT algorithm is shown in supplementary file.…”
Section: Optimize the B-pillar And The Rockermentioning
confidence: 99%
“…Since the calculation results are the pressure curves at sections 1 and 2, there are two IGD values (IGD 1 and IGD 2 ) that corresponding to the responses at sections 1 and 2. Based on AT algorithm [37,38], the inverse of the spring stiffness parameters is carried out with the goal of minimizing the IGD= IGD 1 +IGD 2 .…”
Section: Parameters Reverse Of the Wnls Based On At Algorithmmentioning
confidence: 99%
“…Therefore, the branch update operator should be selected before the branch is renewed. However, the basic crossover and self-evolution operators do not consider the information interaction between branches sufficiently [17] . When a branch is updated by the crossover operator, it has no information exchange with other branches.…”
Section: Improved Crossover Operator and Improved Self-evolution Operatormentioning
confidence: 99%
“…In AT [16] , two operators, namely the crossover operator and the self-evolution operator, are applied to update the branches. However, the basic AT algorithm does not consider the information interaction between branches sufficiently [17,18] . In this work, an improved crossover operator and an improved self-evolution operator are introduced to consider the information interaction between branches comprehensively.…”
Section: Introductionmentioning
confidence: 99%