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

• Journal of Mechanical Science and Technology
• /
• 제15권9호
• /
• pp.1257-1267
• /
• 2001

For efficient mechanical system optimization, a new two-point approximation method is presented. Unlike the conventional two-point approximation methods such as TPEA, TANA, TANA-1, TANA-2 and TANA-3, this introduces the shifting level into each exponential intervening variable to avoid the lack of definition of the conventional exponential intervening variables due to zero-or negative-valued design variables. Then a new quadratic approximation whose Hessian matrix has only diagonal elements of different values is proposed in terms of these shifted exponential intervening variables. These diagonal elements are determined in a closed form that corrects the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the previous point. Finally, in order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve six typical design problems. These optimization results are compared with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• 한국공간구조학회논문집
• /
• 제10권4호
• /
• pp.59-66
• /
• 2010

본 연구는 스페이스 트러스 구조물의 초기 형상을 결정하기 위해 밀도법을 이용한 위상최적화 기술을 고려하고자 한다. 대부분의 초기 형상설계는 다양한 최적화 방법을 활용하지 않고 설계자의 경험이나 시행착오적인 방법을 바탕으로 수행되고 있다. 이런 이유로 합리적이고 경제적인 최적화기술이 초기 형상설계에 도입되어야 한다. 따라서 본 연구에서는 스페이스 트러스 구조물을 대상으로 설계영역을 설정하고 위상최적화를 수행하여 최적의 재료분포를 찾은 뒤 크기최적화를 이용하여 최적부재 크기를 찾고자 한다. 이와 같이 밀도법을 이용한 위상 및 크기최적화를 병행하여 수행할 경우 합리적인 스페이스 트러스 구조물의 초기 형상을 도출할 수 있다.

• 대한전자공학회논문지SP
• /
• 제44권2호
• /
• pp.108-115
• /
• 2007

본 논문에서는 최적화 알고리즘의 속도를 향상시킬 수 있는 방안으로 설계자가 원하는 목적함수들의 수렴 범위를 Goal로 설정하여 최적화를 수행하는 GBNSGA(Goal-Pareto based Non-dominated Sorting Genetic Algorithm)를 제안한다. 많은 공학문제들은 하나의 목표치를 충족하는 해를 찾는 것이 아니라 다수 목적함수들을 충족하는 해를 찾는 것이 일반적이다 특히, 이러한 목적함수들은 서로 상충적인 관계를 갖는 경우가 대부분이기 때문에 모든 목적함수들을 만족하는 유일해를 찾는 것은 거의 불가능하다. 그 대안으로 일부 목적을 희생하며 설계에 부합되는 최적해를 찾는 파레토(Pareto) 방식의 최적화 알고리즘들에 대한 많은 연구가 진행되었다. 본 논문에서는 이러한 파레토 기반의 최적화 알고리즘들의 성능 향상을 도모하기 위하여 설계자의 목적을 파레토 할당에 반영하는 GBNSGA를 제안하고, 그 성능을 NSGA와 weighted-sum 접근 방식과의 비교를 통해 그 우수성을 검증하였다.

• Journal of Mechanical Science and Technology
• /
• 제16권8호
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• 소성∙가공
• /
• 제17권7호
• /
• pp.481-485
• /
• 2008

The subframe type rear suspension consisting of a side member and a front/rear cross member is widely used in a medium car and full car. In the small car case, the beam of tubular type without independent suspension system is used to reduce manufacturing cost. In this study, a subframe type rear suspension by hydroforming has been developed. In designing suspension, a driving stability and durability should be considered as an important factor for the performance improvement, respectively. Thus, we focus on increasing the stiffness of suspension and decreasing the maximum stress affecting a durability cycle life. Several optimization design techniques such as shape, size, and topology optimization are implemented to meet these requirements. The shapes of rear suspension obtained from optimization are formed by using hydroforming process. Through commercial software based on the finite element, the superiority of this design method is demonstrated.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집C
• /
• pp.559-564
• /
• 2001

The design of an automobile mirror actuator system needs a systematic optimization due to several variables, constraints, geometric limitations, moving angle, and so on. Therefore, this article provides the procedure of a genetic algorithm(GA) based optimization with finite element analysis for design of a mirror actuator considering design constraints, geometric limitations, moving angle. Local optimum problem in optimization design with sensitivity analysis is overcome by using zero-order overall searching method which is new optimization design method using a genetic algorithm.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.522-527
• /
• 2004

Resealed Simulated Annealing (RSA) has been devised for improving the disadvantage of Simulated Annealing (SA) which require tremendous amount of computation time. RSA and SA have been for optimization of satellite structures and for comparison of results from two algorithms. As a practical application, a satellite structure is optimized by the two algorithms. Weights of satellite upper platform and propulsion module are minimized. MSC/NASTRAN is used for the static and dynamic analysis. The optimization results of the RSA are compared with results of the classical SA. The numbers of optimization iterations could be effectively reduced by the RSA.

• 한국경영과학회지
• /
• 제40권3호
• /
• pp.49-61
• /
• 2015

We study the problem of multiple response optimization (MRO) and focus on the selection of input levels which will produce desirable output quality. We propose an interactive multiple objective optimization approach to the input design. The earlier interactive methods utilized for MRO communicate with the decision maker only using the response variable values, in order to improve the current response values, thereby resulting in the corresponding design solution automatically. In their interaction steps of preference articulation, no account is taken of any active changes in design variable values. On the contrary, our approach permits the decision maker to change the design variable values in its interaction stage, which makes possible the consideration of the preference or economics of the design variable side. Using some typical value functions, we also demonstrate that our method converges reasonably well to the known optimal solutions.

• 한국항공운항학회지
• /
• 제26권2호
• /
• pp.54-60
• /
• 2018

This paper contains the multi-mission scheduling optimization of UAV within a given operating time. Mission scheduling optimization problem is one of combinatorial optimization, and it has been shown to be NP-hard(non-deterministic polynomial-time hardness). In this problem, as the size of the problem increases, the computation time increases dramatically. So, we applied the genetic algorithm to this problem. For the application, we set the mission scenario, objective function, and constraints, and then, performed simulation with MATLAB. After 1000 case simulation, we evaluate the optimality and computing time in comparison with global optimum from MILP(Mixed Integer Linear Programming).