• Title/Summary/Keyword: penalty functions

Search Result 85, Processing Time 0.027 seconds

Minimum-weight design of stiffened shell under hydrostatic pressure by genetic algorithm

  • Ghasemi, A.R.;Hajmohammad, M.H.
    • Steel and Composite Structures
    • /
    • v.19 no.1
    • /
    • pp.75-92
    • /
    • 2015
  • In this paper, optimization of cylindrical shells under external pressure to minimize its weight has been studied. Buckling equations are based on standard of ABS underwater vehicles. Dimension and type of circumferential stiffeners, and its distance from each other are assumed as variables of optimization problem. Considering the extent of these variables, genetic algorithms have been used for optimization. To study the effect of hydrostatic pressure on the shell and its fabrication according to the existing standards, geometrical and construction as well as stress and buckling constraints have been used in optimization algorithm and also penalty functions are applied to eliminate weak model. Finally, the best model which has the minimum weight considering the applied pressure has been presented.

Dynamic response optmization using approximate search (근사 선탐색을 이용한 동적 반응 최적화)

  • Kim, Min-Soo;Choi, Dong-hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.22 no.4
    • /
    • pp.811-825
    • /
    • 1998
  • An approximate line search is presented for dynamic response optimization with Augmented Lagrange Multiplier(ALM) method. This study empolys the approximate a augmented Lagrangian, which can improve the efficiency of the ALM method, while maintaining the global convergence of the ALM method. Although the approximate augmented Lagragian is composed of only the linearized cost and constraint functions, the quality of this approximation should be good since an approximate penalty term is found to have almost second-order accuracy near the optimum. Typical unconstrained optimization algorithms such as quasi-Newton and conjugate gradient methods are directly used to find exact search directions and a golden section method followed by a cubic polynomial approximation is empolyed for approximate line search since the approximate augmented Lagrangian is a nonlinear function of design variable vector. The numberical performance of the proposed approach is investigated by solving three typical dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested approach is robust and efficient.

Ethernet Ring Protection Using Filtering Database Flip Scheme For Minimum Capacity Requirement

  • Rhee, June-Koo Kevin;Im, Jin-Sung;Ryoo, Jeong-Dong
    • ETRI Journal
    • /
    • v.30 no.6
    • /
    • pp.874-876
    • /
    • 2008
  • Ethernet ring protection is a new technology introduced in ITU-T Recommendation G.8032, which utilizes the generic Ethernet MAC functions. We introduce an alternative enhanced protection switching scheme to suppress penalty in the switching transient, in which the Ethernet MAC filtering database (FDB) is actively and directly modified by information disseminated from the nodes adjacent to failure. The modified FDB at all nodes are guaranteed to be consistent to form a complete new ring network topology immediately. This scheme can reduce the capacity requirement of the G.8032 by several times. This proposed scheme can be also applied in IP protection rings.

  • PDF

Development of an Optimization Algorithm Using Orthogonal Arrays in Discrete Space (직교배열표를 이용한 이산공간에서의 최적화 알고리즘 개발)

  • Yi, Jeong-Wook;Park, Joon-Seong;Lee, Kwon-Hee;Park, Gyung-Jin
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.408-413
    • /
    • 2001
  • The structural optimization is carried out in the continuous design space or discrete design space. Methods for discrete variables such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions for constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

  • PDF

Genetic Programming Approach to Curve Fitting of Noisy Data and Its Application In Ship Design (유전적 프로그래밍을 이용한 노이지 데이터의 Curve Fitting과 선박설계에서의 적용)

  • Lee K. H.;Yeun Y S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.3
    • /
    • pp.183-191
    • /
    • 2004
  • This paper deals with smooth curve fitting of data corrupt by noise. Most research efforts have been concentrated on employing the smoothness penalty function with the estimation of its optimal parameter in order to avoid the 'overfilling and underfitting' dilemma in noisy data fitting problems. Our approach, called DBSF(Differentiation-Based Smooth Fitting), is different from the above-mentioned method. The main idea is that optimal functions approximately estimating the derivative of noisy curve data are generated first using genetic programming, and then their integral values are evaluated and used to recover the original curve form. To show the effectiveness of this approach, DBSP is demonstrated by presenting two illustrative examples and the application of estimating the principal dimensions of bulk cargo ships in the conceptual design stage.

Variable-Node Element for Adaptive Finite Element Analysis of Stokes Flow around Structure (구조물 주변의 Stokes 흐름에 대한 적응적 유한요소 해석을 위한 변절점 요소)

  • 최창근;유원진;정근영
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1996.10a
    • /
    • pp.168-175
    • /
    • 1996
  • This paper deals with the variable-node element for fluid flow and the adaptive h-version mesh refinement algorithm. The transient element has been formulated by the Galerkin approach in which the pressure term is replaced with the penalty function. The present element having variable mid-side node and is suitable for constructing a locally refined mesh avoiding the use of the highly distorted elements. A modified Gauss quadrature is needed to integrate the element matrices to solve the trouble associated with the discontinuity of derivatives of shape functions. Several numerical examples show that the proposed element can be effectively used in the h-version adapt ive mesh refinement

  • PDF

Iterative search for a combined pricing and (S-1,S) inventory policy in a two-echelon supply chain with lost sales allowed

  • Sung Chang Sup;Park Sun Hoo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.8-13
    • /
    • 2003
  • This paper considers a continuous-review two-echelon inventory control problem with one-to-one replenishment policy incorporated and with lost sales allowed where demand arrives In a stationary Poisson process The problem Is formulated using METRIC-approximation in a combined approach of pricing and (S-1.S) Inventory policy, for which an iterative solution algorithm is derived with respect to the corresponding one-warehouse multi-retailor supply chain. Specifically, decisions on retail pricing and warehouse inventory policies are made in integration to maximize total profit in the supply chain. The objective function of the model consists of sub-functions of revenue and cost (holding cost and penalty cost). To test the effectiveness and efficiency of the proposed algorithm, numerical experiments are performed The computational results show that the proposed algorithm is efficient and derives quite good decisions

  • PDF

Design of a knowledge-based controller for job scheduling in assembly (조립 작업에서의 생산계획 수립을 위한 지식베이스형 제어기의 설계)

  • 김성수;서기성;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.514-518
    • /
    • 1990
  • This paper describes an experimental Knowledge-Based Control System, named KBCS, for manufacturing and assembly. The KBCS of five parts and function : data-base, knowledge acquisition, optimization, and graphic monitoring. The KBCS is utilized for a FMS which is of five machine centers and automatic assembly lines. Each machine can perform almost all manufacturing functions which some difference in efficiency. Buffers store temporarily the incoming components and the outing components. Parts arrive at assembly lines after many steps of manufacturing, and the transfer path and time are determined by procedural knowledge of control systems. Nine different incoming components are set up. The total control system is expected to perform four algorithms, timing algorithm ,sequencing algorithm, penalty algorithm, and cart algorithm. The construction of controller require basic components of manufacturing systems in which knowledges are formulated on the base of the results and the repeated simulation of KBCS with graphic monitoring system. Simulation results by KBCS are compared with those by the other rules of manufacturing.

  • PDF

Efficient Finite Element Heat Transfer Analysis by Decomposing a Domain and Radiation Boundaries (영역 및 복사 경계의 완전 분할을 통한 유한요소 열전달 해석의 효율화)

  • Shin, Eui-Sup;Kim, Yong-Uhn;Kim, Sung-Jun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.32 no.10
    • /
    • pp.836-843
    • /
    • 2008
  • An efficient domain/boundary decomposition method is applied for heat transfer problems with non-linear thermal radiation boundaries. The whole domain of solids or structures is considered as set of subdomains, an interface, and radiation interfaces. In a variational formulation, simple penalty functions are introduced to connect an interface or radiation interfaces with neighboring subdomains that satisfy continuity conditions. As a result, non-linear finite element computations due to the thermal radiation boundaries can be localized within a few subdomains or radiation interfaces. Therefore, by setting up suitable solution algorithms for the governing finite element equations, the computational efficiency can be improved considerably. Through a set of numerical examples, these distinguishing characteristics of the present method are investigated in detail.

Dynamic Performance Estimation and Optimization for the Power Transmission of a Heavy Duty Vehicle (중부하 차량 동력전달계의 성능평가와 최적화)

  • 조한상;임원식;이장무;김정윤
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.4 no.1
    • /
    • pp.63-74
    • /
    • 1996
  • Automatic transmission for heavy duty vehicles is a part of the power pack which includes steering and braking systems. This transmission in different from the one for passenger car. Therefore, in order to understand the trend of the important design parameters, maneuverability, acceleration performance and maximum speed, we need to analyze the total performance characteristics of the power transmission systems. In this study, modeling of the automatic transmission in heavy duty vehicle is carried out and the performance analysis method is presented. Results can be used for performance estimation data in the analysis for several combination method which determines the optimal parameters on the basis of penalty functions and weightings. And the estimation method of the important performance parameters such as engine inertia or power loss of engine by experiments is presented.

  • PDF