• Title/Summary/Keyword: 수학적 최적화

Search Result 276, Processing Time 0.022 seconds

Crack Identification Using Optimization Technique (수학적 최적화기법을 이용한 결함인식 연구)

  • Seo, Myeong-Won;Yu, Jun-Mo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.1 s.173
    • /
    • pp.190-195
    • /
    • 2000
  • It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure. Nikolakopoulos et. al. used the intersection point of the superposed contours that correspond to the eigenfrequency caused by the crack presence. However the intersecting point of the superposed contours is not only difficult to find but also incorrect to calculate. A method is presented in this paper which uses optimization technique for the location and depth of the crack. The basic idea is to find parameters which use the structural eigenfrequencies on crack depth and location and optimization algorithm. With finite element model of the structure to calculate eigenfrequencies, it is possible to formulate the inverse problem in optimization format. Method of optimization is augmented lagrange multiplier method and search direction method is BFGS variable metric method and one dimensional search method is polynomial interpolation.

Mathematical Proof for Structural Optimization with Equivalent Static Loads Transformed from Dynamic Loads (동하중에서 변환된 등가정하중에 의한 최적화 방법의 수학적 고찰)

  • Park, Gyung-Jin;Kang, Byung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.2
    • /
    • pp.268-275
    • /
    • 2003
  • Generally, structural optimization is carried out based on external static loads. All forces have dynamic characteristics in the real world. Mathematical optimization with dynamic loads is extremely difficult in a large-scale problem due to the behaviors in the time domain. The dynamic loads are often transformed into static loads by dynamic factors, design codes, and etc. Therefore, the optimization results can give inaccurate solutions. Recently, a systematic transformation has been proposed as an engineering algorithm. Equivalent static loads are made to generate the same displacement field as the one from dynamic loads at each time step of dynamic analysis. Thus, many load cases are used as the multiple leading conditions which are not costly to include in modern structural optimization. In this research, it is mathematically proved that the solution of the algorithm satisfies the Karush-Kuhn-Tucker necessary condition. At first, the solution of the new algorithm is mathematically obtained. Using the termination criteria, it is proved that the solution satisfies the Karush-Kuhn-Tucker necessary condition of the original dynamic response optimization problem. The application of the algorithm is discussed.

Optimum Condition of HPLC by HCI Program (HCI 프로그램을 이용한 HPLC의 최적화 조건)

  • Jin, Chun Hua;Lee, Ju Weon;Row, Kyung Ho
    • Korean Chemical Engineering Research
    • /
    • v.44 no.6
    • /
    • pp.555-562
    • /
    • 2006
  • Recently, liquid chromatography (LC) has been used more frequently to separate drugs and natural substances. Especially, to selection of the solutes from the products, the operation condition of analytical chromatography should be necessarily determined. So accurate computer modeling and simulation of chromatographic performances has become a necessary part of the development and design of processes. High-Purity Separation Lab. Inha University developed the resulting HCI software for the purpose of the optimization of chromatographic performances. The HCI program was utilized to find the optimum operating condition more accurately and rapidly, reducing the number of many possible experiments. The elution profiles were calculated by the plate theory based on the three retention mechanism of capacity factor.

Best Choice in Loans Problem (대출 문제에서의 최선의 선택)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.189-195
    • /
    • 2021
  • This paper discusses choice of loans problem(CLP) that is to minimize annual payment from which bank's borrows in multi-banks multi-nations with distinct interests. For the CLP, there is impossible to obtain the optimal solution actually without the help of mathematical software package as linear programming(LP). This paper applies the method used in transportation problem(TP) that finds initial feasible solution with selects minimum interest first, least cost method(LCM), to CLP. Result of experiment, the proposed algorithm can be obtains the optimal solution with at most two exchange optimization for LCM's initial feasible solution.

Optimum Design Based on Sequential Design of Experiments and Artificial Neural Network for Enhancing Occupant Head Protection in B-Pillar Trim (센터 필라트림의 FMH 충격성능 향상을 위한 순차적 실험계획법과 인공신경망 기반의 최적설계)

  • Lee, Jung Hwan;Suh, Myung Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.11
    • /
    • pp.1397-1405
    • /
    • 2013
  • The optimal rib pattern design of B-pillar trim considering occupant head protection can be determined by two methods. One is the conventional approximate optimization method that uses the statistical design of experiments (DOE) and response surface method (RSM). Generally, approximated optimum results are obtained through the iterative process by trial-and-error. The quality of results strongly depends on the factors and levels assigned by a designer. The other is a methodology derived from previous work by the authors, called the sequential design of experiments (SDOE), to reduce the trial-and-error procedure and to find an appropriate condition for using artificial neural network (ANN) systematically. An appropriate condition is determined from the iterative process based on the analysis of means. With this new technique and ANN, it is possible to find an optimum design accurately and efficiently.

Gradient Descent Training Method for Optimizing Data Prediction Models (데이터 예측 모델 최적화를 위한 경사하강법 교육 방법)

  • Hur, Kyeong
    • Journal of Practical Engineering Education
    • /
    • v.14 no.2
    • /
    • pp.305-312
    • /
    • 2022
  • In this paper, we focused on training to create and optimize a basic data prediction model. And we proposed a gradient descent training method of machine learning that is widely used to optimize data prediction models. It visually shows the entire operation process of gradient descent used in the process of optimizing parameter values required for data prediction models by applying the differential method and teaches the effective use of mathematical differentiation in machine learning. In order to visually explain the entire operation process of gradient descent, we implement gradient descent SW in a spreadsheet. In this paper, first, a two-variable gradient descent training method is presented, and the accuracy of the two-variable data prediction model is verified by comparison with the error least squares method. Second, a three-variable gradient descent training method is presented and the accuracy of a three-variable data prediction model is verified. Afterwards, the direction of the optimization practice for gradient descent was presented, and the educational effect of the proposed gradient descent method was analyzed through the results of satisfaction with education for non-majors.

Development of Improved Clustering Harmony Search and its Application to Various Optimization Problems (개선 클러스터링 화음탐색법 개발 및 다양한 최적화문제에 적용)

  • Choi, Jiho;Jung, Donghwi;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.3
    • /
    • pp.630-637
    • /
    • 2018
  • Harmony search (HS) is a recently developed metaheuristic optimization algorithm. HS is inspired by the process of musical improvisation and repeatedly searches for the optimal solution using three operations: random selection, memory recall (or harmony memory consideration), and pitch adjustment. HS has been applied by many researchers in various fields. The increasing complexity of real-world optimization problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms and HS are required. We propose an improved clustering harmony search (ICHS) that uses a clustering technique to group solutions in harmony memory based on their objective function values. The proposed ICHS performs modified harmony memory consideration in which decision variables of solutions in a high-ranked cluster have higher probability of being selected than those in a low-ranked cluster. The ICHS is demonstrated in various optimization problems, including mathematical benchmark functions and water distribution system pipe design problems. The results show that the proposed ICHS outperforms other improved versions of HS.

A Mathematical Model for Coordinated Multiple Reservoir Operation (댐군의 연계운영을 위한 수학적 모형)

  • Kim, Seung-Gwon
    • Journal of Korea Water Resources Association
    • /
    • v.31 no.6
    • /
    • pp.779-793
    • /
    • 1998
  • In this study, for the purpose of water supply planning, we propose a sophisticated multi-period mixed integer programming model that can coordinate the behavior of multi-reservoir operation, minimizing unnecessary spill. It can simulate the system with operating rules which are self- generated by the optimization engine in the algorithm. It is an optimization model in structure, but it indeed simulates the coordinating behavior of multi-reservoir operation. It minimizes the water shortfalls in demand requirements, maintaining flood reserve volume, minimizing unnecessary spill, maximizing hydropower generation release, keeping water storage levels high for efficient hydroelectric turbine operation. This optimization model is a large scale mixed integer programming problem that consists of 3.920 integer variables and 68.658 by 132.384 node-arc incidence matrix for 28 years of data. In order to handle the enormous amount of data generated by a big mathematical model, the utilization of DBMS (data base management system)seems to be inevitable. It has been tested with the Han River multi-reservoir system in Korea, which consists of 2 large multipurpose dams and 3 hydroelectric dams. We demonstrated successfully that there is a good chance of saving substantial amount of water should it be put to use in real time with a good inflow forecasting system.

  • PDF

Sample Average Approximation Method for Task Assignment with Uncertainty (불확실성을 갖는 작업 할당 문제를 위한 표본 평균 근사법)

  • Gwang, Kim
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.28 no.1
    • /
    • pp.27-34
    • /
    • 2023
  • The optimal assignment problem between agents and tasks is known as one of the representative problems of combinatorial optimization and an NP-hard problem. This paper covers multi agent-multi task assignment problems with uncertain completion probability. The completion probabilities are generally uncertain due to endogenous (agent or task) or exogenous factors in the system. Assignment decisions without considering uncertainty can be ineffective in a real situation that has volatility. To consider uncertain completion probability mathematically, a mathematical formulation with stochastic programming is illustrated. We also present an algorithm by using the sample average approximation method to solve the problem efficiently. The algorithm can obtain an assignment decision and the upper and lower bounds of the assignment problem. Through numerical experiments, we present the optimality gap and the variance of the gap to confirm the performances of the results. This shows the excellence and robustness of the assignment decisions obtained by the algorithm in the problem with uncertainty.

Machine Tool Technology;The Present And The Future(6) (공작기계기술의 현재와 미래(6))

  • 강철희
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.9
    • /
    • pp.5-21
    • /
    • 1995
  • 공작기계의 가공 정밀도에 영향을 주는 주요 요인은 정적특성(Static behavior), 동적특성(Dynamic behavior), 그리고 열적특성(Thermal behavior)에 있다는 것은 이미 언급한 바 있다. 열적영향으로 인한 정밀도를 안정시키는 완전한 해결책은 아직 발견되지 못하고 있다. 그 이유는 공작기계 자체뿐만 아니라 부품들이 복잡하고 공작기계의 내부, 기계와 주위환경사이에 복잡한 열적상호작용이 존재하고 있기 때문이다. 그럼에도 불구하고 공작기계에는 더욱 높은 생산능력과 가공정도에 대한 요구가 점점 커지고 있다. 과거 40년 간에 걸쳐 공작기계의 열적거동에 대한 연구가 활발히 진행되어 왔지만 일반적으로 적용하여 만족할 만한 열적 불안정의 해결책은 아직 나오지 않고 있으며 단지 여러가지의 기계구성요소, 즉 Spindle, Column이나 Bed와 같은 본체의 구조나 Table이나 Slide에 대해서 열적 최적화를 얻는 노력이 집중적으로 행해지고 있다. 공작기계 의 열변형에 대한 연구는 1950년대부터 시작되었으며, 선반이나 연삭기의 열변형 측정기술과 해당하는 설계변경 방법 그리고 냉각을 함으로서 열적 불안정을 극복시키는 방법이 주요 연구과제였으나 1960년대 후반에는 구성 요소의 온도분포와 열의 흐름에 관한 수학적 모델을 한들어 해석적 수법올 열적 거동의 연구가 행하여졌었다.

  • PDF