Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Metaheuristics in structural optimization and discussions on harmony search algorithm
Date
2016-06-01
Author
Saka, M. P.
Hasançebi, Oğuzhan
Geem, Z. W.
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
253
views
0
downloads
Cite This
Metaheuristic algorithms have provided efficient tools to engineering designers by which it became possible to determine the optimum solutions of engineering design optimization problems encountered in every day practice. Generally metaheuristics are based on metaphors that are taken from nature or some other processes. Because of their success of providing solutions to complex engineering design optimization problems the recent literature has flourished with a large number of new metaheuristics based on a variety of metaphors. Despite the fact that most of these techniques have numerically proven themselves as reliable and strong tools for solutions of design optimization problems in many different disciplines, some argue against these methods on account of not having mathematical background and making use of irrelevant and odd metaphors. However, so long as these efforts bring about computationally efficient and robust optimum structural tools for designers what type of metaphors they are based on becomes insignificant. After a brief historical review of structural optimization this article opens this issue up for discussion of the readers and attempts to answer some of the criticisms asserted in some recent publications related with the novelty of metaheuristics.
Subject Keywords
Metaheuristics
,
Harmony search
,
Evolution strategies
,
Structural optimization
,
Phenomenon mimicking algorithm
URI
https://hdl.handle.net/11511/47672
Journal
SWARM AND EVOLUTIONARY COMPUTATION
DOI
https://doi.org/10.1016/j.swevo.2016.01.005
Collections
Department of Civil Engineering, Article
Suggestions
OpenMETU
Core
Optimum design of steel frames using stochastic search techniques based on natural phenomena: A review
Saka, M. P. (2007-09-21)
Recent developments in optimization techniques that deal with finding the solution of combinatorial optimization problems has provided steel designers with new capabilities. These new optimization techniques use nature as a source of inspiration to develop new procedures for solving complex engineering problems. Among these, evolutionary algorithms mimic evolutionary biology and make use of the principle of the survival of the fittest to establish a numerical search algorithm. In the immune system algorithm...
Harmony search algorithms in structural engineering
Saka, M.P.; Aydogdu, I.; Hasançebi, Oğuzhan; Geem, Z.W. (2011-08-08)
Harmony search method is widely applied in structural design optimization since its emergence. These applications have shown that harmony search algorithm is robust, effective and reliable optimization method. Within recent years several enhancements are suggested to improve the performance of the algorithm. Among these Mandavi has presented two versions of harmony search methods. He named these as improved harmony search method and global best harmony search method. Saka and Hasancebi (2009) have suggested...
Optimum Design of Concrete Cantilever Retaining Walls using the Harmony Search Algorithm
Akin, A.; Saka, M. P. (2010-09-17)
Optimum cost design of reinforced concrete cantilever retaining walls with harmony search algorithm is presented in this paper. The reinforced concrete cantilever retaining wall is the most common type among the retaining wall structures. In the formulation of the optimum design problem the height and thickness of stem, length of toe projection and the thickness of stem at base level, the length and thickness of base, the depth and thickness of key and the distance from toe to the key are treated as design ...
Optimum Detailed Design of Reinforced Concrete Continuous Beams using the Harmony Search Algorithm
Akin, A.; Saka, M. P. (2010-09-17)
Design optimization of reinforced concrete structures is more challenging than that of steel structures due to the complexity associated with reinforcement design. In this study, optimum design algorithm is presented for reinforced concrete continuous beams. The design variables are selected as the width and the depth of beams in each span, the diameter and the number of longitudinal reinforcement bars along span and supports, and the diameter of ties. The design constraints are implemented from ACI 318-05 ...
An Efficient Metaheuristic Algorithm for Engineering Optimization: SOPT
Hasançebi, Oğuzhan (2012-06-01)
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps; namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependency on few parameters only are among the advantageous characteristics of the proposed SOPT algorithm. The efficienc...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. P. Saka, O. Hasançebi, and Z. W. Geem, “Metaheuristics in structural optimization and discussions on harmony search algorithm,”
SWARM AND EVOLUTIONARY COMPUTATION
, pp. 88–97, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47672.