Abstract
In the majority of structural engineering optimization problems, the objective is to minimize the cost of the structure. These problems use a variety of objective functions formulating cost as a function of the variables involved in the design of the structure. They also use a number of search mechanisms ranging from an exhaustive search to several heuristic searches. Typical search mechanisms include tabu search, simulated annealing, genetic algorithms, and branch-and-bound. The goal of this paper is to compare some of the search mechanisms in the light of their applicability to structural engineering optimization. Since practical structural engineering problems have discrete variables, only those search mechanisms capable of solving discrete structural optimization problems are considered.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
