Investigating the Statical Stability of Pin-jointed Structures Using Genetic Algorithm

El-Lishani, Sana; Nooshin, Hoshyar; Disney, P

doi:10.1260/0266351054214335

Cited by 19 publications

(13 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the minimum eigenvalue of the tangent stiffness matrix K is needed to be optimized, it is equivalent to maximize variable η in equation (13) in the optimization process. To realize this purpose, η in equation (13) can be treated as an optimization variable, and the objective function f 2 can be expressed as…”

Section: Objective Functionmentioning

confidence: 99%

“…e system consists of eight nodes and seven members and has three mechanism modes and two selfstress states. It has been analytically studied by Calladine and Pellegrino [7] and later used as an example in numerical prestress design by the heuristic algorithms [13,15,17].…”

Section: Example 1: Planar Pin-jointed Assembly Imentioning

confidence: 99%

“…Besides these deterministic algorithms, many stochastic or heuristic algorithms have also been used to solve this problem. El-Lishani et al [13] and Lee et al [14] used a genetic algorithm (GA) to find feasible self-stresses of pin-jointed structures. Xu and Luo [15], Zhang and Ohsaki [16] both used a simulated annealing algorithm (SAA) to find optimal prestress of tensegrity structures.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Prestress Design of Tensegrity Structures Using Semidefinite Programming

Wang

2019

Advances in Civil Engineering

View full text Add to dashboard Cite

Finding appropriate prestresses which can stabilize the system is a key step in the design of tensegrity structures. A semidefinite programming- (SDP-) based approach is developed in this paper to determine appropriate prestresses for tensegrity structures. Three different stability criteria of tensegrity structures are considered in the proposed approach. Besides, the unilateral property of members and the evenness of internal forces are taken into account. The stiffness of the whole system can also be optimized by maximizing the minimum eigenvalue of the tangent stiffness matrix. Deterministic algorithms are used to solve the semidefinite programming problem in polynomial time. The applicability of the proposed approach is verified by three typical examples. Compared to previous stochastic-based approaches, the global optimality of the solution of the proposed approach is theoretically guaranteed and the solution is exactly reproducible.

show abstract

Section: Objective Functionmentioning

confidence: 99%

Section: Example 1: Planar Pin-jointed Assembly Imentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Prestress Design of Tensegrity Structures Using Semidefinite Programming

Wang

2019

Advances in Civil Engineering

View full text Add to dashboard Cite

show abstract

“…Subsequently, Sultan (2013) presented the necessary and sufficient conditions for the exponential stability of prestressable pin-jointed structures, and discussed the advantages of the formulation of the tangent stiffness matrix in analytical manipulations and computations. Meanwhile, some studies have evaluated the geometric stability of a pin-jointed structure by heuristic optimization methods such as genetic algorithms and the ant colony algorithms (El-Lishani et al, 2005;Chen et al, 2012a,b;Koohestani, 2013). Nevertheless, the above methods usually concern the mobility and geometric stability of a structure with a specific and fixed geometry and connectivity.…”

Section: Introductionmentioning

confidence: 99%

Effective insights into the geometric stability of symmetric skeletal structures under symmetric variations

Chen

Sareh

Feng

2015

International Journal of Solids and Structures

View full text Add to dashboard Cite

a b s t r a c tGeometric stability is a necessary criterion to guarantee stable equilibrium in engineering structures. However, we generally encounter enormous calculations to examine the geometric stability when we make variations on the geometry or the connectivity of a given kinematically and statically indeterminate structure. This study describes how symmetry is utilized to enhance the mobility and geometric stability analysis of symmetric skeletal structures. Symmetry-extended mobility distinguishes representations of the internal mechanisms and self-stress states from relative mobility based on their inherent symmetries using group-theoretic method. Thus, it acts as an efficient tool to evaluate the order of internal mechanisms that may be indistinguishable by traditional structural approaches. Further, it is used to gain effective insights into the mobility and geometric stability of a symmetric skeletal structure with symmetrically perturbed connectivity or geometry. The first-order changes of symmetry-extended mobility are deduced to describe the changes induced by the variations of nodal coordinates, members, and kinematic constraints, respectively. Examples are given to verify the correctness and effectiveness of the proposed method. We show that the geometry or connectivity of kinematically indeterminate symmetric skeletal structures can be altered while at the same time retaining geometric stability and some or all of the original symmetry. The results have potential application in the design of novel deployable structures.

show abstract

“…To overcome this difficulty, some studies have introduced optimization algorithms for investigating the stability of pin-jointed structures, e.g., the genetic algorithm (El-Lishani et al, 2005;Koohestani, 2012Koohestani, , 2013, and the ant colony systems (Chen et al, 2012a,b). These algorithms have powerful heuristic searching ability, however, become inefficient for large-scale structures with a large number of nodes and self-stress states.…”

Section: Introductionmentioning

confidence: 99%