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
Bi-directional evolutionary algorithm for volume constrained topology optimization of axisymmetric solids
Download
index.pdf
Date
2015
Author
Tikenoğulları, Oğuz Ziya
Metadata
Show full item record
Item Usage Stats
252
views
95
downloads
Cite This
In this thesis, topology optimization of axisymmetric solids is studied. Analysis of the axisymmetric problem is performed by coding an axisymmetric finite element formulation in association with the optimization code which is based on Bi-Directional Evolutionary Optimization (BESO) method. The optimization method used in this study includes recent improvements to the evolutionary optimization algorithms. These are bi-directional evolution, sensitivity number filtering and sensitivity-time averaging. In the optimization process, mean compliance of the overall structure is minimized while gradually removing material in order to reach volume constraint. Removal of the material is decided according to the strain energy stored within the volume of the finite element. In this study, hard-kill method is used for the element removal. Therefore removed material has no contribution to the stiffness of the structure. In the analysis of the structure, iso-parametric axisymmetric finite element formulation is used.Both the analysis and optimization codes are run in a successive manner. Sample problems are chosen from the literature and solved with the present optimization method. Results are compared and performance of the method is discussed.
Subject Keywords
Topology.
,
Algorithms.
,
Structural optimization.
URI
http://etd.lib.metu.edu.tr/upload/12619334/index.pdf
https://hdl.handle.net/11511/24926
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Exotic smooth structures on non-simply connected 4-manifolds
Topkara, Mustafa; Ozan, Yıldıray; Department of Mathematics (2010)
In this thesis, we study exotic smooth structures on 4-manifolds with finite fundamental groups. For an arbitrary finite group G, we construct an infinite family of smooth 4-manifolds with fundamental group G, which are all homeomorphic but mutually non-diffeomorphic, using the small symplectic manifold with arbitrary fundamental group constructed by S. Baldridge and P. Kirk, together with the methods of A. Akhmedov, R.Ý. Baykur and D. Park for constructing infinite families of exotic simply connected 4-man...
Open book decompositions of links of quotient surface singularities
Yılmaz, Elif; Korkmaz, Mustafa; Department of Mathematics (2009)
In this thesis, we write explicitly the open book decompositions of links of quotient surface singularities that support the corresponding unique Milnor fillable contact structures. The page-genus of these Milnor open books are minimal among all Milnor open books supporting the corresponding unique Milnor fillable contact structures. That minimal page-genus is called Milnor genus. In this thesis we also investigate whether the Milnor genus is equal to the support genus for links of quotient surface singular...
Derivative free algorithms for large scale non-smooth optimization and their applications
Tor, Ali Hakan; Karasözen, Bülent; Department of Mathematics (2013)
In this thesis, various numerical methods are developed to solve nonsmooth and in particular, nonconvex optimization problems. More specifically, three numerical algorithms are developed for solving nonsmooth convex optimization problems and one algorithm is proposed to solve nonsmooth nonconvex optimization problems. In general, main differences between algorithms of smooth optimization are in the calculation of search directions, line searches for finding step-sizes and stopping criteria. However, in nonsmoo...
Multisymplectic Schemes for the Complex Modified Korteweg-de Vries Equation
AYDIN, AYHAN; Karasözen, Bülent (2008-09-20)
In this paper, the multisymplectic formulation of the CMKdV(complex modified Korteweg-de Vries equation) is derived. Based on the multisymplectic formulation, the eight-point multisymplectic Preissman scheme and a linear-nonlinear multisymplectic splitting scheme are developed. Both methods are compared numerically with respect to the conservation of local and global quantities of the CMKdV equation.
GPU accelerated high-order discontinuous galerkin level set methods for incompressible multiphase flows
Karakuş, Ali; Aksel, Mehmet Haluk; Sert, Cüneyt; Department of Mechanical Engineering (2015)
This thesis study focuses on the development of GPU accelerated, high-order discontinuous Galerkin methods for the solution of unsteady incompressible and immiscible multiphase flows with level set interface representation. Nodal discontinuous Galerkin framework is used for Navier-Stokes, level set evolution and reinitialization equations on unstructured elements. Computations are localized mostly near the interface location with an adaptive method to reduce computational cost without sacrificing the accura...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Z. Tikenoğulları, “Bi-directional evolutionary algorithm for volume constrained topology optimization of axisymmetric solids,” M.S. - Master of Science, Middle East Technical University, 2015.
