Elitist Self-Adaptive Step-Size Search in Optimum Sizing of Steel Structures

This paper covers application of an elitist selfadaptive step-size search (ESASS) to optimum design of steel skeletal structures. In the ESASS two approaches are considered for improving the convergence accuracy as well as the computational efficiency of the original technique namely the so called selfadaptive step-size search (SASS). Firstly, an additional randomness is incorporated into the sampling step of the technique to preserve exploration capability of the algorithm during the optimization. Moreover, an adaptive sampling scheme is introduced to improve the quality of final solutions. Secondly, computational efficiency of the technique is accelerated via avoiding unnecessary analyses during the optimization process using an upper bound strategy. The numerical results demonstrate the usefulness of the ESASS in the sizing optimization problems of steel truss and frame structures.

Reformulations of Big Bang-Big Crunch Algorithm for Discrete Structural Design Optimization

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.