Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

---

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelligence. It works with doing random search in the search space and creating the initial random population by modeling DNA-based computing operators and applies the operators derived from genetic algorithm to achieve the optimum solution of the objective function. Generalized Convex Approximation (GCA) method is a gradient-based method that with approximation of the main function and starting from a point, finds the optimum solution using information about functions and their gradient. In this research, in order to minimize the weight of truss, the cross-section areas of the elements as discrete variables are optimized by DNA computing algorithm, and the coordinates of truss nodes as continuous variables are optimized by Generalized Convex Approximation (GCA) method. Therefore, to simultaneously optimize the size and geometry of truss structures, these two methods are used in combination. The results of numerical examples show the proper functioning of this process.

Keywords: Optimization, Truss, DNA computing algorithm, Generalized Convex Approximation (GCA) method.

Full-Text [PDF 1194 kb]   (5766 Downloads)    

Add your comments about this article : Your username or Email:

---