Abstract
Two different coding algorithms are used to find optimal support locations for an indeterminate structure using a Genetic Algorithm. The objective is to equalize the load distribution among the supports while maximizing the enclosed polygonal area by the supports to increase stability of the structure. In the first approach, called the continuous method, the candidate surface for the support locations was used as a continuum of space. In the second approach, called the discretized method, the solution space is broken into rectangular grids and the index number of the nodal points are used as genes in coding the problem. The average value of the objective function in the discretized method is found to be 0.0147 compared to the average value of 0.405 in the continuous method. The discretized method also outperformed the continuous method in each component of the multi-objective problem and showed faster convergence towards the optima.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Engineering and Technology Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
