• Title/Summary/Keyword: optimization problems

Search Result 2,428, Processing Time 0.025 seconds

Optimal laminate sequence of thin-walled composite beams of generic section using evolution strategies

  • Rajasekaran, S.
    • Structural Engineering and Mechanics
    • /
    • v.34 no.5
    • /
    • pp.597-609
    • /
    • 2010
  • A problem formulation and solution methodology for design optimization of laminated thin-walled composite beams of generic section is presented. Objective functions and constraint equations are given in the form of beam stiffness. For two different problems one for open section and the other for closed section, the objective function considered is bending stiffness about x-axis. Depending upon the case, one can consider bending, torsional and axial stiffnesses. The different search and optimization algorithm, known as Evolution Strategies (ES) has been applied to find the optimal fibre orientation of composite laminates. A multi-level optimization approach is also implemented by narrowing down the size of search space for individual design variables in each successive level of optimization process. The numerical results presented demonstrate the computational advantage of the proposed method "Evolution strategies" which become pronounced to solve optimization of thin-walled composite beams of generic section.

Shape Optimization for Multi-Connected Structures (다연결체 구조물에 대한 형상 최적화)

  • 한석영;배현우
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.8 no.2
    • /
    • pp.151-158
    • /
    • 2000
  • The growth-strain method was used for shape optimization of multi-connected structures. It was verified that the growth-strain method is very effective for shape optimization of structures with only one free surface to be deformed. But it could not provide reasonable optimized shape for multi-connected structures, when the growth-strain method is applied as it is. The purpose of this study is to improve the growth-strain method for shape optimization of multi-connected two- and three- dimensional structures. In order to improve, the problems that occurred as the growth-strain method was applied to multi-connected structures were examined, and then the improved method was suggested. The effectiveness and practicality of the developed shape optimization system was verified by numerical examples.

  • PDF

Shape Optimization of High Voltage Gas Circuit Breaker Using Kriging-Based Model And Genetic Algorithm (크리깅 메타모델과 유전자 알고리즘을 이용한 초고압 가스차단기의 형상 최적 설계)

  • Kwak, Chang-Seob;Kim, Hong-Kyu;Cha, Jeong-Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.2
    • /
    • pp.177-183
    • /
    • 2013
  • We describe a new method for selecting design variables for shape optimization of high-voltage gas circuit breaker using a Kriging meta-model and a genetic algorithm. Firstly we sample balance design variables using the Latin Hypercube Sampling. Secondly, we build meta-model using the Kriging. Thirdly, we search the optimal design variables using a genetic algorithm. To obtain the more exact design variable, we adopt the boundary shifting method. With the proposed optimization frame, we can get the improved interruption design and reduce the design time by 80%. We applied the proposed method to the optimization of multivariate optimization problems as well as shape optimization of a high - voltage gas circuit breaker.

A Sequential Approximate Optimization Technique Using the Previous Response Values (응답량 재사용을 통한 순차 근사최적설계)

  • Hwang Tae-Kyung;Choi Eun-Ho;Lim O-Kaung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.1 s.232
    • /
    • pp.45-52
    • /
    • 2005
  • A general approximate optimization technique by sequential design domain(SDD) did not save response values for getting an approximate function in each step. It has a disadvantage at aspect of an expense. In this paper, previous response values are recycled for constructing an approximate function. For this reason, approximation function is more accurate. Accordingly, even if we did not determine move limit, a system is converged to the optimal design. Size and shape optimization using approximate optimization technique is carried out with SDD. Algorithm executing Pro/Engineer and ANSYS are automatically adopted in the approximate optimization program by SDD. Convergence criterion is defined such that optimal point must be located within SDD during the three steps. The PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information in the direction finding problem and uses the active set strategy.

Topology Design Optimization of a Magnetic System Consisting of Permanent Magnets and Yokes and its Application to the Bias Magnet System of a Magnetostrictive Sensor (영구자석과 요크를 포함한 자기 시스템의 위상최적설계 및 자기 변형 센서의 바이어스 자석 설계에의 응용)

  • Cho, Seung-Hyun;Kim, Yoon-Young;Yoo, Jeong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.11
    • /
    • pp.1703-1710
    • /
    • 2004
  • The objective of this investigation is to formulate and carry out the topology optimization of a magnetic system consisting of permanent magnets and yokes. Earlier investigations on magnetic field topology optimization have been limited on the design optimization of yokes or permanent magnets alone. After giving the motivation for the simultaneous design of permanent magnets and yokes, we develop the topology optimization formulation of the coupled system by extending the technique used in structural problems. In the present development, we will also examine the effects of the functional form for permeability penalization on the optimized topology.

GENERALIZATIONS OF ISERMANN'S RESULTS IN VECTOR OPTIMIZATION

  • Lee, Gue-Myung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.30 no.1
    • /
    • pp.1-7
    • /
    • 1993
  • Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

  • PDF

Multi-criteria Structural Optimization Methods and their Applications (다목적함수 최적구조설계 기법 및 응용)

  • Kim, Ki-Sung;Jin, Jin
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.46 no.4
    • /
    • pp.409-416
    • /
    • 2009
  • The structural design problems are acknowledged to be commonly multi-criteria in nature. The various multi-criteria optimization methods are reviewed and the most efficient and easy-to-use Pareto optimal solution methods are applied to structural optimization of a truss and a beam. The result of the study shows that Pareto optimal solution methods can easily be applied to structural optimization with multiple objectives, and the designer can have a choice from those Pareto optimal solutions to meet an appropriate design environment.

Optimal Design of a Heat Sink using the Sequential Approximate Optimization Algorithm (순차적 근사최적화 기법을 이용한 방열판 최적설계)

  • Park Kyoungwoo;Choi Dong-Hoon
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.16 no.12
    • /
    • pp.1156-1166
    • /
    • 2004
  • The shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. In constrained nonlinear optimization problems of thermal/fluid systems, three fundamental difficulties such as high computational cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are commonly confronted. Thus, a sequential approximate optimization (SAO) algorithm has been introduced because it is very hard to obtain the optimal solutions of fluid/thermal systems by means of gradient-based optimization techniques. In this study, the progressive quadratic response surface method (PQRSM) based on the trust region algorithm, which is one of sequential approximate optimization algorithms, is used for optimization and the heat sink is optimized by combining it with the computational fluid dynamics (CFD).

Optimization of hybrid composite plates using Tsai-Wu Criteria

  • Mehmet Hanifi Dogru;Ibrahim Gov;Eyup Yeter;Kursad Gov
    • Structural Engineering and Mechanics
    • /
    • v.88 no.4
    • /
    • pp.369-377
    • /
    • 2023
  • In this study, previously developed algorithm is used for Optimization of hybrid composite plates using Tsai-Wu criteria. For the stress-based Design Optimization problems, Von-Mises stress uses as design variable for isotropic materials. Maximum stress, maximum strain, Tsai Hill, and Tsai-Wu criteria are generally used to determine failure of composite materials. In this study, failure index value is used as design variable in the optimization algorithm and Tsai-Wu criteria is utilized to calculate this value. In the analyses, commonly used design domains according to different hybrid orientations are optimized and results are presented. When the optimization algorithm was applied, 50% material reduction was obtained without exceeding allowable failure index value.

Soft Computing Optimized Models for Plant Leaf Classification Using Small Datasets

  • Priya;Jasmeen Gill
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.8
    • /
    • pp.72-84
    • /
    • 2024
  • Plant leaf classification is an imperative task when their use in real world is considered either for medicinal purposes or in agricultural sector. Accurate identification of plants is, therefore, quite important, since there are numerous poisonous plants which if by mistake consumed or used by humans can prove fatal to their lives. Furthermore, in agriculture, detection of certain kinds of weeds can prove to be quite significant for saving crops against such unwanted plants. In general, Artificial Neural Networks (ANN) are a suitable candidate for classification of images when small datasets are available. However, these suffer from local minima problems which can be effectively resolved using some global optimization techniques. Considering this issue, the present research paper presents an automated plant leaf classification system using optimized soft computing models in which ANNs are optimized using Grasshopper Optimization algorithm (GOA). In addition, the proposed model outperformed the state-of-the-art techniques when compared with simple ANN and particle swarm optimization based ANN. Results show that proposed GOA-ANN based plant leaf classification system is a promising technique for small image datasets.