CGO and SNS Optimization Algorithm for the Structures with Discontinuous and Continuous Variables

Abstract

This study aims to find discontinuous and continuous approaches to reducing the size of planar truss structures with a specified shape and topology. The member’s section area has assumed to be a decision variable, and the objective function is to minimize their weight. The member stresses and node displacements are the constraints that must maintain within the allowed limits for each condition. Chaos game optimization (CGO) and social network search (SNS) algorithms were used to optimize four well-known planar truss structures. In discontinuous-size cases, the results of the social network search (SNS) algorithm are the most cost-effective. However, the results of the chaos game optimization (CGO) algorithm are the most cost-effective in continuous-size cases.