review

STRUCTURAL OPTIMIZATION USING BIG BANG-BIG CRUNCH ALGORITHM: A REVIEW

  • Iran University of Science & Technology
Research footprint

At a glance

Citations
10
References
36
Comments
0
Paper overview

Abstract

The big bang-big crunch (BB-BC) algorithm is a popular metaheuristic optimization technique proposed based on one of the theories for the evolution of the universe. The algorithm utilizes a two-phase search mechanism: big-bang phase and big-crunch phase. In the big-bang phase the concept of energy dissipation is considered to produce disorder and randomness in the candidate population while in the big-crunch phase the randomly created solutions are shrunk into a single point in the design space. In recent years, numerous studies have been conducted on application of the BB-BC algorithm in solving structural design optimization instances. The objective of this review study is to identify and summarize the latest promising applications of the BB-BC algorithm in optimal structural design. Different variants of the algorithm as well as attempts to reduce the total computational effort of the technique in structural optimization problems are covered and discussed. Furthermore, an empirical comparison is performed between the runtimes of three different variants of the algorithm. It is worth mentioning that the scope of this review is limited to the main applications of the BB-BC algorithm and does not cover the entire literature.

Record transparency

Publication details

OpenAlex
W2368249544
Document type
review
Language
EN
Source
Iran University of Science & Technology
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.