• Title/Summary/Keyword: optimization formulation

Search Result 536, Processing Time 0.025 seconds

System Optimization of Orthotropic Steel-Deck Bridges by Load and Resistance Factor Design (LRFD에 의한 강상판형교의 시스템 최적설계)

  • 조효남;민대홍;김현우
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.04a
    • /
    • pp.262-271
    • /
    • 1998
  • Recent, more and more steel deck bridges are adopted for the design of long span bridges and the upgrading of existing concrete deck bridges, mainly because of reduced self weight, higher stiffness and efficient erection compared to concrete decks. The main objective of this study is to propose on formulation of the design optimizations to develop an optimal desist program required for optimum desist for orthotropic steel-deck bridges. The objective function of the optimization is formulated as a minimum initial cost design problem. The behavior and design constraints are formulated based on the ASD and LRFD criteria of the Korean Bridge Design Code(1996). The optimum design program developed in this study consists of two steps. In the first step the system optimization of the steel box girder bridges is carried out. And in the second step the program provided the optimum design of the orthotropic steel-deck with close ribs. In the optimal design program the analysis module for the deck optimization is based on the Pelican Esslinger method. The optimizer module of the program utilizes the ADS(Automated Desist Synthesis) routines using the optimization techniques fuor constrained optimization. From the results of real application examples, The cost effectiveness of optimum orthotropic steel-deck bridges designs based on both ASD and LRFD methods is investigated by comparing the results with those of conventional designs, and it may be concluded that the design developed in this study seems efficient and robust for the optimization of orthotropic steel-deck bridges

  • PDF

Study of Reliability-Based Robust Design Optimization Using Conservative Approximate Meta-Models (보수적 근사모델을 적용한 신뢰성 기반 강건 최적설계 방법)

  • Sim, Hyoung Min;Song, Chang Yong;Lee, Jongsoo;Choi, Ha-Young
    • Journal of Ocean Engineering and Technology
    • /
    • v.26 no.6
    • /
    • pp.80-85
    • /
    • 2012
  • The methods of robust design optimization (RDO) and reliability-based robust design optimization (RBRDO) were implemented in the present study. RBRDO is an integrated method that accounts for the design robustness of an objective function and for the reliability of constraints. The objective function in RBRDO is expressed in terms of the mean and standard deviation of an original objective function. Thus, a multi-objective formulation is employed. The regressive approximate models are generated via the moving least squares method (MLSM) and constraint-feasible moving least squares method (CF-MLSM), which make it possible to realize the feasibility regardless of the multimodality/nonlinearity of the constraint function during the approximate optimization processes. The regression model based RBRDO is newly devised and its numerical characteristics are explored using the design of an actively controlled ten bar truss structure.

Numerical solution of beam equation using neural networks and evolutionary optimization tools

  • Babaei, Mehdi;Atasoy, Arman;Hajirasouliha, Iman;Mollaei, Somayeh;Jalilkhani, Maysam
    • Advances in Computational Design
    • /
    • v.7 no.1
    • /
    • pp.1-17
    • /
    • 2022
  • In this study, a new strategy is presented to transmit the fundamental elastic beam problem into the modern optimization platform and solve it by using artificial intelligence (AI) tools. As a practical example, deflection of Euler-Bernoulli beam is mathematically formulated by 2nd-order ordinary differential equations (ODEs) in accordance to the classical beam theory. This fundamental engineer problem is then transmitted from classic formulation to its artificial-intelligence presentation where the behavior of the beam is simulated by using neural networks (NNs). The supervised training strategy is employed in the developed NNs implemented in the heuristic optimization algorithms as the fitness function. Different evolutionary optimization tools such as genetic algorithm (GA) and particle swarm optimization (PSO) are used to solve this non-linear optimization problem. The step-by-step procedure of the proposed method is presented in the form of a practical flowchart. The results indicate that the proposed method of using AI toolsin solving beam ODEs can efficiently lead to accurate solutions with low computational costs, and should prove useful to solve more complex practical applications.

Solving Probability Constraint in Robust Optimization by Minimizing Percent Defective (불량률 최소화를 통한 강건 최적화의 확률제한조건 처리)

  • Lee, Kwang Ki;Park, Chan Kyoung;Kim, Geun Yeon;Lee, Kwon Hee;Han, Sang Wook;Han, Seung Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.8
    • /
    • pp.975-981
    • /
    • 2013
  • A robust optimization is only one of the ways to minimize the effects of variances in design variables on the objective functions at the preliminary design stage. To predict the variances and to formulate the probabilistic constraints are the most important procedures for the robust optimization formulation. Though several methods such as the process capability index and the six sigma technique were proposed for the prediction and formulation of the variances and probabilistic constraints, respectively, there are few attempts using a percent defective which has been widely applied in the quality control of the manufacturing process for probabilistic constraints. In this study, the robust optimization for a lower control arm of automobile vehicle was carried out, in which the design space showing the mean and variance sensitivity of weight and stress was explored before robust optimization for a lower control arm. The 2nd order Taylor expansion for calculating the standard deviation was used to improve the numerical accuracy for predicting the variances. Simplex algorithm which does not use the gradient information in optimization was used to convert constrained optimization into unconstrained one in robust optimization.

An Analysis Techniques for Coatings Mixing using the R Data Analysis Framework (R기반 데이터 분석 프레임워크를 이용한 코팅제 배합 분석 기술)

  • Noh, Seong Yeo;Kim, Minjung;Kim, Young-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.6
    • /
    • pp.734-741
    • /
    • 2015
  • Coating is a type of paint. It protects a product forming a film layer on the product and assigns various properties to the product. Coating is one of the fields which is being studied actively in the polymer industry. Importance of coating in various industries is more increased. However, mixing process has been performing in dependence on operator's experience. In this paper, we found the relationship between each data from coating formulation process. We propose a framework to analyze the coating formulation process as well. It can improve the coating formulation process. In particular, the suggested framework may reduce degradation and loss costs due to absence of standard data which is accurate formulation criteria. Also it suggests responses to errors which can be occurred in the future through the analysis of the error data generated in mixing step.

An Efficient Solution Method to MDO Problems in Sequential and Parallel Computing Environments (순차 및 병렬처리 환경에서 효율적인 다분야통합최적설계 문제해결 방법)

  • Lee, Se-Jung
    • Korean Journal of Computational Design and Engineering
    • /
    • v.16 no.3
    • /
    • pp.236-245
    • /
    • 2011
  • Many researchers have recently studied multi-level formulation strategies to solve the MDO problems and they basically distributed the coupling compatibilities across all disciplines, while single-level formulations concentrate all the controls at the system-level. In addition, approximation techniques became remedies for computationally expensive analyses and simulations. This paper studies comparisons of the MDO methods with respect to computing performance considering both conventional sequential and modem distributed/parallel processing environments. The comparisons show Individual Disciplinary Feasible (IDF) formulation is the most efficient for sequential processing and IDF with approximation (IDFa) is the most efficient for parallel processing. Results incorporating to popular design examples show this finding. The author suggests design engineers should firstly choose IDF formulation to solve MDO problems because of its simplicity of implementation and not-bad performance. A single drawback of IDF is requiring more memory for local design variables and coupling variables. Adding cheap memories can save engineers valuable time and effort for complicated multi-level formulations and let them free out of no solution headache of Multi-Disciplinary Analysis (MDA) of the Multi-Disciplinary Feasible (MDF) formulation.

Comparative studies on numerical optimal design techniques (수치해석에 의한 최적화 설계 기법의 비교 연구)

  • 조선휘;박종근
    • Journal of the korean Society of Automotive Engineers
    • /
    • v.4 no.2
    • /
    • pp.79-85
    • /
    • 1982
  • Computer codes on two numerical optimization methods-Sequentially Unconstrained Minimization Technique (SUMT) and Gradient Projection Method-are constructed and tested with several test problems. Design formulation of tension - compression coil spring is set up and the solution is obtained. Consequently, the feature, the advantage and the limitation of these methods, made clear through the tests, are discussed.

  • PDF

A Study of New Evolutionary Approach for Multiobjective Optimization (다목적함수 최적화를 위한 새로운 진화적 방법 연구)

  • Shim, Mun-Bo;Suh, Myung-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.6
    • /
    • pp.987-992
    • /
    • 2002
  • In an attempt to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. In this paper, pareto-based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. This algorithm is based on Continuous Evolutionary Algorithms to solve single objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche-formation method fur fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto-optimal tradeoff surface. Finally, the validity of this method has been demonstrated through a numerical example.

A Tailless UAV Multidisciplinary Design Optimization Using Global Variable Fidelity Modeling

  • Tyan, Maxim;Nguyen, Nhu Van;Lee, Jae-Woo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.18 no.4
    • /
    • pp.662-674
    • /
    • 2017
  • This paper describes the multidisciplinary design optimization (MDO) process of a tailless unmanned combat aerial vehicle (UCAV) using global variable fidelity aerodynamic analysis. The developed tailless UAV design framework combines multiple disciplines that are based on low-fidelity and empirical analysis methods. An automated high-fidelity aerodynamic analysis is efficiently integrated into the MDO framework. Global variable fidelity modeling algorithm manages the use of the high-fidelity analysis to enhance the overall accuracy of the MDO by providing the initial sampling of the design space with iterative refinement of the approximation model in the neighborhood of the optimum solution. A design formulation was established considering a specific aerodynamic, stability and control design features of a tailless aircraft configuration with a UCAV specific mission profile. Design optimization problems with low-fidelity and variable fidelity analyses were successfully solved. The objective function improvement is 14.5% and 15.9% with low and variable fidelity optimization respectively. Results also indicate that low-fidelity analysis overestimates the value of lift-to-drag ratio by 3-5%, while the variable fidelity results are equal to the high-fidelity analysis results by algorithm definition.