Abstract: In the present study the efficiency of Big Bang-Big
Crunch (BB-BC) algorithm is investigated in discrete structural
design optimization. It is shown that a standard version of the BB-BC
algorithm is sometimes unable to produce reasonable solutions to
problems from discrete structural design optimization. Two
reformulations of the algorithm, which are referred to as modified
BB-BC (MBB-BC) and exponential BB-BC (EBB-BC), are
introduced to enhance the capability of the standard algorithm in
locating good solutions for steel truss and frame type structures,
respectively. The performances of the proposed algorithms are
experimented and compared to its standard version as well as some
other algorithms over several practical design examples. In these
examples, steel structures are sized for minimum weight subject to
stress, stability and displacement limitations according to the
provisions of AISC-ASD.