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

Optimizing frequencies of skew composite laminates with metaheuristic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 32 publications
(11 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…Based on past research works on the same finite element formulation [30][31][32], it is revealed that an 18 × 18 mesh discretization of the composite plate using 9-node isoparametric elements is sufficiently accurate for the considered problems. To demonstrate the accuracy of the current FEM formulation, a validation example is included in Figure A1, Appendix A.…”
Section: Finite Element Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on past research works on the same finite element formulation [30][31][32], it is revealed that an 18 × 18 mesh discretization of the composite plate using 9-node isoparametric elements is sufficiently accurate for the considered problems. To demonstrate the accuracy of the current FEM formulation, a validation example is included in Figure A1, Appendix A.…”
Section: Finite Element Methodsmentioning
confidence: 99%
“…These three natural frequencies are treated here as the responses. The detailed formulation of the FEM used in this paper can be available in [30][31][32]. The FE formulation adopts a 9-node isoparametric element and is based on first-order shear deformation theory (FSDT).…”
Section: Problem 1: Low-dimensional (Ld) Problemmentioning
confidence: 99%
“…Initially in the CHP algorithm, a random population of “ n h ” hosts and “ n p ” parasites are created, and their fitness is measured. For this research, the number of initial host and parasite population is selected as 50 each as the recommendations of Kalita et al [ 24 ]. Each m th parasite tries to update its position at the th iteration by taking a Lévy flight, where are the fitness of k th host and m th parasite at the t th iteration.…”
Section: Methodsmentioning
confidence: 99%
“…This helps the RPSOLC algorithm to avoid getting trapped in local optima pits. The pseudocode of the current RPSOLC can be retrieved from authors' previous work [30].…”
Section: Rpsolc (Repulsive Particle Swarm Optimization With Local Sea...mentioning
confidence: 99%