• 한국농공학회지
• /
• 제36권2호
• /
• pp.111-122
• /
• 1994

In this study, an algorithm which can be applied to the optimum design of simple steel plate girders was developed, and efficient optimization strategies for the solution of algorithm were found out. The optimum design algorithm consists of 3-levels of optimization. In the first and second levels of optimization, the absolute maximum bending moment and shearing force are extracted and in the third level of optimization, the optimum cross section of steel plate girder is determined. For the optimum design of cross section, the objective function is formulated as the total area of cross section and constraints are derived in consideration of the various stresses and the minimum dimension of flange and web based on the part of steel bridge in the Korea standard code of road bridge. Sequential unconstrained minimization technique using the exterior penalty function method(SUMT-EP), sequential linear programming(SLP) and sequential quadratic programming (SQP) are proved to be efficient and robust strategies for the optimum design of simple plate girder cross section. From the reliable point of view, SLP is the most efficient and robust strategy and SQP is the most efficient one from the viewpoint of converguency and computing time.

• International Journal of Aeronautical and Space Sciences
• /
• 제2권2호
• /
• pp.95-107
• /
• 2001

This paper is devoted to the parameter optimization of unmanned aerial vehicle's (UAV) flight control laws. Optimization procedure is based on the ideas of mixed $H_2/H_{\infty}$ control of multi-model plants. By using this approach, some partial $H_2$-terms defining the performance of nominal and parametrically perturbed Flight Control System (FCS) responses to deterministic command signals in stochastic atmosphere as well as $H_{\infty}$-terms defining robustness of the FCS can be incorporated in the composite cost function. Special penalty function imposed on the location of closed-loop system's poles keeps the speed of response and oscillatory properties for both nominal and perturbed FCS in reasonable limits. That is the reason why this procedure may provide reasonable trade-off between the performance and robustness of FCS that are very important especially for UAV. Its practical importance is illustrated by case studies of lateral and longitudinal control of small UAV.

• 전기학회논문지
• /
• 제66권3호
• /
• pp.513-521
• /
• 2017

Robust optimal operation of a microgrid is required since the increase of the penetration level of renewable generators in the microgrid raises uncertainty due to their intermittent power output. In this paper, an application of probabilistic optimization method to economical operation of a microgrid is studied. To simplify the treatment of the uncertainties of renewable generations and load, the new 'band of virtual equivalent load variation' is introduced considering their uncertainties. A simplified robust optimization methodology to generate the scenarios within the band of virtual equivalent load variation and to obtain the optimal solution for the worst scenario is presented based on Monte Carlo method. The microgrid to be studied here is composed of distributed generation system(DGs), battery systems and loads. The distributed generation systems include combined heat and power(CHP) and small generators such as diesel generators and the renewable energy generators such as photovoltaic(PV) systems and wind power systems. The modeling of the objective function for considering interruption cost by the penalty function is presented. Through the case study for a microgrid with uncertainties, the validity of proposed robust optimization methodology is evaluated.

• Nuclear Engineering and Technology
• /
• 제55권11호
• /
• pp.4102-4111
• /
• 2023

In order to better perform thermal hydraulic calculation and analysis of supercritical water reactor, based on the experimental data of supercritical water, the model training and predictive analysis of the heat transfer coefficient of supercritical water were carried out by using the support vector machine (SVM) algorithm. The changes in the prediction accuracy of the supercritical water heat transfer coefficient are analyzed by the changes of the regularization penalty parameter C, the slack variable epsilon and the Gaussian kernel function parameter gamma. The predicted value of the SVM model obtained after parameter optimization and the actual experimental test data are analyzed for data verification. The research results show that: the normalization of the data has a great influence on the prediction results. The slack variable has a relatively small influence on the accuracy change range of the predicted heat transfer coefficient. The change of gamma has the greatest impact on the accuracy of the heat transfer coefficient. Compared with the calculation results of traditional empirical formula methods, the trained algorithm model using SVM has smaller average error and standard deviations. Using the SVM trained algorithm model, the heat transfer coefficient of supercritical water can be effectively predicted and analyzed.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 제11회 음성통신 및 신호처리 워크샵 논문집 (SCAS 11권 1호)
• /
• pp.358-363
• /
• 1994

This paper presents the improvement of the SCHMM using discrete VQ and One-Pass algorithm for keywords recognition in Korean continuous speech. The SCHMM using discrete VQ is a simple model that is composed of a variable mixture gaussian probability density function with dynamic mixture number. One-Pass algorithm is improved such that recognition rates are enhanced by fathoming any undesirable semisyllable with the low likelihood and the high duration penalty, and computation time is reduced by testing only the frame which is dissimilar to the previously testd frame. In recognition experiments for speaker-dependent case, the improved One-Pass algorithm has shown recognition rates as high as 99.7% and has reduced compution time by about 30% compared with the currently abailable one-pass algorithm.

• 품질경영학회지
• /
• 제18권2호
• /
• pp.81-92
• /
• 1990

This paper considers a scheduling of a set of jobs on single and multiple processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. The objective is to determine the optimal value of a common due date and an optimal scheduling to minimize a total penalty function. It is also shown that a schedule having minimum weighted completion time variances must be V-shaped. For identical processors, a polynomial scheduling algorithm with the secondary objectives of minimizing makespan and machine occupancy is developed and a numerical example is presented.

• 소성∙가공
• /
• 제4권1호
• /
• pp.48-58
• /
• 1995

In this study, a contact algorithm for the finite element analysis of free surface contact problem in materials forming is presented. The proposed contact algorithm consists of two parts. The first is the contact searching part, and the second, the constraint part. The contact searching algorithm does not require any a priori knowledge of the pairs of contact nodes or segments and the impenetrability constraint is satisfied using the penalty function scheme. void colsure in open-die forging was simulated to verify the accuracy and capability of the currently developed contact algorithm. The simulation results, obtained from ABAQUS simulation, were compared well to the experimental data available in the literature.

• 대한기계학회논문집A
• /
• 제22권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.

• 산업경영시스템학회지
• /
• 제9권13호
• /
• pp.29-32
• /
• 1986

A decision procedure to determine when computer software should be released after testing is described. This paper extends optimum release policies minimizing the total expected software cost with a scheduled software delivery time under reliability requirement constraint. Such cost considerations enable us to make a release decision as to when transfer a software system from testing phase to operational phase. The underlying model is software reliability growth model described by a nonhomogeneous poisson process. It is assumed that the penalty cost function due to delay for a scheduled software delivery time is linearly proportional to time. Numerical examples are shown to illustrate the results.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1998년도 공동추계학술대회 경제위기 극복을 위한 정보기술의 효율적 활용
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.