A hybrid algorithm coupling genetic programming and Nelder–Mead for topology and size optimization of trusses with static and dynamic constraints

• Published in: Expert systems with applications Vol. 95; pp. 127 - 141
• Main Authors: Assimi, Hirad, Jamali, Ali
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.04.2018; Elsevier BV
• Subjects: Connectivity; Continuity (mathematics); Convergence; Cross-sections; Dynamic stability; Genetic algorithms; Genetic programming; Nelder–Mead; Optimization; Searching; Static and dynamic constraints; Structural stability; Studies; Topology; Topology optimization; Truss; Trusses; Topology optimization; Nelder–Mead; Truss; Static and dynamic constraints; Genetic programming
• DOI: 10.1016/j.eswa.2017.11.035
• ISSN: 0957-4174

•Genetic programming used for truss optimization with static and dynamic constraints.•Nelder–Mead used to improve the convergence of the proposed algorithm.•The proposed algorithm performed on discrete sizing optimization of trusses.•The proposed approach outperformed other reported methods in most of the cases. Truss optimization aims to provide the lightest truss to gain the maximum benefit out of available resources. Truss optimization may subject to static and dynamic constraints. Static constraints include structural kinematic stability, maximum allowable stress in truss members, maximum allowable deflection in the truss nodes and critical buckling load. However, dynamic constraints impose limits on the natural frequency of the desired truss to avoid the destructive resonance phenomenon. Taking both static and dynamic constraints into account may lead to growth in the search space but dwindling its feasible region; the search space becomes very non-convex and may subterfuge the solver to trap in a local optimum. Another design consideration may include fabricational constraints to present design variables from a set of available cross-sections to satisfy the design codes. This paper proposes a hybrid genetic programming algorithm to deal with the barriers of this complex problem. It looks for the optimum connectivity table (among the truss nodes) and optimal cross-sectional areas for its members subject to design constraints. It also benefits from a Nelder–Mead local search operator to improve the competence and true convergence of the algorithm. Our algorithm has been applied to some numerical examples considering both types of continuous and discrete design variables; It proved its efficiency to find better solutions (lighter trusses) in comparison with other methods in the literature for most of the cases.