Fitness estimation based particle swarm optimization algorithm for layout design of truss structures (Q1718898): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q59068742, #quickstatements; #temporary_batch_1710326039812
Property / Wikidata QID
 
Property / Wikidata QID: Q59068742 / rank
 
Normal rank

Revision as of 11:34, 13 March 2024

scientific article
Language Label Description Also known as
English
Fitness estimation based particle swarm optimization algorithm for layout design of truss structures
scientific article

    Statements

    Fitness estimation based particle swarm optimization algorithm for layout design of truss structures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: Due to the fact that vastly different variables and constraints are simultaneously considered, truss layout optimization is a typical difficult constrained mixed-integer nonlinear program. Moreover, the computational cost of truss analysis is often quite expensive. In this paper, a novel fitness estimation based particle swarm optimization algorithm with an adaptive penalty function approach (FEPSO-AP) is proposed to handle this problem. FEPSO-AP adopts a special fitness estimate strategy to evaluate the similar particles in the current population, with the purpose to reduce the computational cost. Further more, a laconic adaptive penalty function is employed by FEPSO-AP, which can handle multiple constraints effectively by making good use of historical iteration information. Four benchmark examples with fixed topologies and up to 44 design dimensions were studied to verify the generality and efficiency of the proposed algorithm. Numerical results of the present work compared with results of other state-of-the-art hybrid algorithms shown in the literature demonstrate that the convergence rate and the solution quality of FEPSO-AP are essentially competitive.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references