An exponential big bang-big crunch algorithm for discrete design optimization of steel frames

Date

2012-11-01

Author

Hasançebi, Oğuzhan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

194
views

0
downloads

In the present study an enhanced variant of the big bang-big crunch (BB-BC) technique, namely exponential BB-BC algorithm (EBB-BC) is developed for code based design optimization of steel frame structures. It is shown that the standard version of the BB-BC algorithm is sometimes unable to produce reasonable solutions to problems from discrete design optimization of steel frames. Hence, through investigating the shortcomings of BB-BC algorithm, it is aimed to reinforce the performance of the technique for this class of problems in particular. The study provides numerical evidences of how the performance of a well-known metaheuristic technique (BB-BC) can significantly be improved through simple yet effective modifications in its formulation to achieve a more robust and reliable variant (EBB-BC). Further, a comparison of the optimum solutions with those of other well-known metaheuristics reveals that the EBB-BC algorithm can efficiently be used as a novel tool for code based design optimization of steel frames.

Subject Keywords

Optimum design, Performance

URI

https://hdl.handle.net/11511/41295

Journal

COMPUTERS & STRUCTURES

DOI

https://doi.org/10.1016/j.compstruc.2012.07.014

Collections

Department of Civil Engineering, Article

Suggestions

OpenMETU
Core

A reformulation of the ant colony optimization algorithm for large scale structural optimization Hasançebi, Oğuzhan; Saka, M.p. (2011-01-01) This study intends to improve performance of ant colony optimization (ACO) method for structural optimization problems particularly with many design variables or when design variables are chosen from large discrete sets. The algorithm developed with ACO method employs the so-called pheromone scaling approach to overcome entrapment of the search in a poor local optimum and thus to recover efficiency of the method for large-scale optimization problems. Besides, a new formulation is proposed for the local upda...
A Methodology for cross-resolution modeling in DEVS using event-B refinement Kara, Ahmet; Oğuztüzün, Mehmet Halit S.; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2014) This thesis proposes a software engineering solution for implementing simulations via composition of models at different resolution levels with the help of formal methods. Our solution provides a systematic methodology that offers a well-defined sequence of stages to obtain executable converters for entity resolution mapping, given the types of entity attributes that are exchanged at model interfaces and the mapping specifications. Our methodology relies on Event-B as the formal specification language and D...
A Meta-Heuristic Paradigm for solving the Forward Kinematics of 6-6 General Parallel Manipulator Chandra, Rohitash; Frean, Marcus; Rolland, Luc (2009-12-18) The forward kinematics of the general Gough platform, namely the 6-6 parallel manipulator is solved using hybrid meta-heuristic techniques in which the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results are compared with the standard simulated annealing and genetic algorithm. It shows that the standard simulated annealing algorithm outperforms standard genetic algorithm in terms of computation time and overall accuracy of the solution on this problem. However, t...
Adaptive Harmony Search Algorithm for Design Code Optimization of Steel Structures Saka, M. P.; Hasançebi, Oğuzhan (2009-01-01) In this chapter an improved version of harmony search algorithm called an adaptive harmony search algorithm is presented. The harmony memory considering rate and pitch adjusting rate are conceived as the two main parameters of the technique for generating new solution vectors. In the standard implementation of the technique, appropriate constant values are assigned to these parameters following a sensitivity analysis for each problem considered. The success of the optimization process is directly related to...
A New Design Approach for Rapid Evaluation of Structural Modifications Using Neural Networks Demirkan, O.; Olceroglu, E.; BAŞDOĞAN, FATMA İPEK; Özgüven, Hasan Nevzat (2013-02-01) Design optimization of structural systems is often iterative, time consuming and is limited by the knowledge of the designer. For that reason, a rapid design optimization scheme is desirable to avoid such problems. This paper presents and integrates two design methodologies for efficient conceptual design of structural systems involving computationally intensive analysis. The first design methodology used in this paper is structural modification technique (SMT). The SMT utilizes the frequency response funct...

Citation Formats

O. Hasançebi, “An exponential big bang-big crunch algorithm for discrete design optimization of steel frames,” COMPUTERS & STRUCTURES, pp. 167–179, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41295.