• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.488-491
• /
• 1995

The paper presents a new global maximum search method for multimodal unknown functions of two variables. The search method is composed of two stages and sequentially samples the candidate point in a subdomain selected using a priority function in each stage. The search domain is auto-similarly divided into triangular subdomains, or cells, during the search process. A measure of accuracy of local maximum search is introduced to check if a local search has converged to a specified accuracy or the maximum of a local peak cannot be the global maximum. A criterion for switching from the first to the second stage, is proposed using a ratio of the observed peak width to the largest cell in the domain. By numerical simulations, the required number of trials is evaluated for some function models with different peak parameters, and the switching criterion is optimally determined. The results show that the proposed method obtains global maximum points with certainty and saves largely computation time even for functions with extremely steep peaks.

• 한국유체기계학회 논문집
• /
• 제2권1호
• /
• pp.29-34
• /
• 1999

To develop the efficient numerical optimization method for the design of an airfoil, an evaluation of various methods coupled with two-dimensional Naviev-Stokes analysis is presented. Simplex method and Hook-Jeeves method we used as direct search methods, and steepest descent method, conjugate gradient method and DFP method are used as indirect search methods and are tested to determine the search direction. To determine the moving distance, the golden section method and cubic interpolation method are tested. The finite volume method is used to discretize two-dimensional Navier-Stokes equations, and SIMPLEC algorithm is used for a velocity-pressure correction method. For the optimal design of two-dimensional airfoil, maximum thickness, maximum ordinate of camber line and chordwise position of maximum ordinate are chosen as design variables, and the ratio of drag coefficient to lift coefficient is selected as an objective function. From the results, it is found that conjugate gradient method and cubic interpolation method are the most efficient for the determination of search direction and the moving distance, respectively.

• 경영과학
• /
• 제22권1호
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(5)
• /
• pp.9-12
• /
• 2001

Optical aligning process to archive the maximum optical coupling is crucial in many optical device manufacturing line such as laser diode module. Due to the three-dimensional nature of housing module and the aligning process for laser diode coupler, large amount of the manufacturing time, typically ranging from tens of minutes to an hour has to be devoted to the aligning process alone. In this thesis, we propose a new optical aligning process that employee a two-pass algorithm: coarse-to-fine search. Coarse search is a kind of blind search that finds the candidate region where the maximum optical coupling might mostly occur, followed by a fine searching that finds the maximum within the candidate region. The algorithm has been tested on 50 samples of cam-type laser diode modules, and the experimental results are analyzed in terms of aligning time and coupling efficiency.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.311-314
• /
• 2004

The 2 DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical rectangular bins. The 2 DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• 설비공학논문집
• /
• 제7권4호
• /
• pp.566-576
• /
• 1995

A Computational code has been developed in order to design axial fans by the numerical optimization techniques incorporated with flow analysis code solving three-dimensional Navier-Stokes equation. The steepest descent method and the conjugate gradient method are used to look for the search direction in the design space, and the golden section method is used for one-dimensional search. To solve the constrained optimization problem, sequential unconstrained minimization technique, SUMT, is used with imposed quadratic extended interior penalty functions. In the optimization of two-dimensional cascade design, the ratio of drag coefficient to lift coefficient is minimized by the design variables such as maximum thickness, maximum ordinate of camber and chord wise position of maximum ordinate. In the application of this numerical optimization technique to the design of an axial fan, the efficiency is maximized by the design variables related to the sweep angle distributed by quadratic function along the hub to tip of fan.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제12권1호
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• 대한기계학회논문집B
• /
• 제30권11호
• /
• pp.1131-1138
• /
• 2006

Aerodynamic shape design of a partial admission turbine using CFD has been performed. Two step approaches are adopted in this study. Firstly, two-dimensional blade shape is optimized using CFD and genetic algorithm. Initially, the turbine cascade shape is represented by four design parameters. By controlling the design parameters as variables, the non-gradient search is analyzed for obtaining the maximum efficiency. The final two-dimensional blade proved to have a more blade power than the initial blade. Secondly, the three-dimensional CFD analysis including the nozzle, rotor and stator has been conducted. To avoid a heavy computational load due to an unsteady calculation, the frozen rotor method is implemented in steady calculation. The frozen rotor method can detect a variation of the flow-field dependent upon the blade's circumferential position relative to the nozzle. It gives a better idea of wake loss mechanism starting from the lip of the nozzle than the mixing plane concept. Finally, the combination of two and three dimensional design method of the partial admission turbine in this study has proven to be a robust tool in development phase.

• 한국항공우주학회지
• /
• 제30권8호
• /
• pp.10-20
• /
• 2002

본 논문에서는 최적화 방법을 이용하여 동적 실속을 제어하는 방법을 제시하고자 한다. 비정상 공력 민감도 해석코드는 2 방정식 난류 모델을 사용한 비정상 압축성 Navier-Stokes 해석코드로부터 직접 미분법을 사용하여 개발되었다. 목적함수는 해석이 수행되는 전시간에 대한 것보다는 매 순간의 값을 사용하였다. 매 순간의 목적함수에 대한 구배값은 민감도 해석코드를 사용하여 얻었고, 최적화는 매 시간마다 간단한 건형 직선 조사방법(linear line search)을 이용하였다. 제어 변수는 익형의 노즈 반경, 최대 두께와 흡입을 사용하였다. 계산결과는 동적 실속을 제어하는데, 본 논문에서 제시한 최적화 방법이 효과적이라는 것을 보여주고 있다.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2000년도 추계 학술대회논문집
• /
• pp.176-182
• /
• 2000

This paper presents methods for dynamic stall control utilizing an optimization approach. Unsteady aerodynamic sensitivity code is developed using a direct diffentiation method from a discrete two-dimensional unsteady compressible Navier-Stokes code including a two-equation turbulence model. Dynamic stall control is conducted by minimizing an objective function defined at an instant instead of integrating a response for a period of time. Unsteady sensitivity derivative of the objective function is calculated by the sensitivity code, and optimization is conducted using a linear line search method at every physical time level. Examples of dynamic stall control utilizing airfoils nose radius or maximum thickness variation show very satisfactory results.