• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.853-866
• /
• 2011

We propose a multi-objective space search algorithm (MSSA) and introduce the identification of fuzzy inference systems based on the MSSA and information granulation (IG). The MSSA is a multi-objective optimization algorithm whose search method is associated with the analysis of the solution space. The multi-objective mechanism of MSSA is realized using a non-dominated sorting-based multi-objective strategy. In the identification of the fuzzy inference system, the MSSA is exploited to carry out parametric optimization of the fuzzy model and to achieve its structural optimization. The granulation of information is attained using the C-Means clustering algorithm. The overall optimization of fuzzy inference systems comes in the form of two identification mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and the polynomial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by the MSSA and C-Means, whereas the parameter identification is realized via the MSSA and least squares method. The evaluation of the performance of the proposed model was conducted using three representative numerical examples such as gas furnace, NOx emission process data, and Mackey-Glass time series. The proposed model was also compared with the quality of some "conventional" fuzzy models encountered in the literature.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권1호
• /
• pp.20-28
• /
• 2016

In this study, an efficient method of designing laminate composite radar absorbing structures (RAS) is proposed with consideration given to the structural shape so as to improve aircraft stealth performance. The calculation of the radar cross section (RCS) should be decreased to enhance the efficiency of the stochastic optimization when designing an RAS. In the proposed method, RAS are optimized to match up the input impedance of the minimal RCS, which is obtained by using physical optics and the transmission line theory. Single and double layer dielectric RAS for aircraft wings are employed as numerical examples and designed using the proposed method, RCS minimization and reflection coefficient minimization. The availability of the proposed method is assessed by comparing the similarity of the results and computation time with other design methods. According to the results, the proposed method produces the same results as the stochastic optimization, which adopts the RCS as the objective function, and can improve RAS design efficiency by reducing the number of RCS analyses.

• 한국항공우주학회지
• /
• 제32권6호
• /
• pp.34-48
• /
• 2004

본 연구에서는 대형 구조물의 최적설계에서 문제되는 많은 계산시간과 컴퓨터의 계산능력을 최소화할 수 있도록 부분구조합성법의 하나인 구속모드법을 이용한 연성하중해석 모델 및 모달과도해석을 포함한 최적화 절차를 제시하였다. 제안된 방법의 수치모사를 위한 프로그램을 개발하여 위성체 주요 구조부재인 플랫폼에 대한 최적화를 수행함으로써 그 타당성을 검증하였다. 제안된 기법을 통해 초기설계 단계에서 정확성을 유지하면서 계산시간을 단축할 수 있었고 위성체 구조부재에 대한 최적화를 수행하여 각각의 구조부재에 대한 특성을 파악함으로써 설계 활용방안을 제시하였다.

• 한국항공우주학회지
• /
• 제34권1호
• /
• pp.74-80
• /
• 2006

본 논문은 레이더와 같은 지상의 다수위협이 존재하는 상황에서 무인항공기의 비행경로 최적화에 관한 것이다. 레이더에 의한 피탐성, 즉 비행체에 의해 반사되는 레이더 신호강도를 최소화하면서 목적지까지의 비행시간을 최소화하는 관점에서 성능지수를 제안하였다. 1차의 시간지연 시스템으로 가정된 비행체의 경사각을 제어입력으로 고려하였으며, Sequential Quadratic Programming기법에 기반한 입력 파라미터 최적화 기법을 사용하여 궤적최적화를 수행하였다. 제안된 무인 항공기 경로계획 기법은 Voronoi 선도기법과 비교하였을 때, 생존성을 증대시키면서도 항공기의 역학적 특성을 고려한 비행경로를 제공한다.

• 한국통신학회논문지
• /
• 제23권8호
• /
• pp.2113-2119
• /
• 1998

BOD의 최적화 문제는 논리합성과 형식검증 영역에서 필수적인 것으로 인식되고 있다. 변수 순서화 문제는 BOD의 크기와 형태에 직접적인 영향을 미치므로, 적절한 변수 순서를 구하는 문제는 매우 중요한 문제이다, 본 논문에서 는 점진적 시프팅이라 부르는 새로운 변수 순서화 알고리듬을 소개한다. 제안된 알고리듬은 기존의 시프팅 알고리듬에서의 탐색공간을 절반이하로 줄이며, 성능의 저하없이 계산시간을 크게 감소시킬 수 있다. 더욱이 점진적 시프팅 알고리듬은 시프팅 알고리듬을 비롯한 다른 변수 순서화 알고리듬에 비해 매우 단순하다. 제안된 알고리듬은 많은 벤치마크 회로를 이용한 실험에서 그 효율성이 입증되었다.

• Nuclear Engineering and Technology
• /
• 제51권1호
• /
• pp.284-292
• /
• 2019

For the continuous operation of a nuclear reactor, burnt fuel needs to be replaced with fresh fuel, where appropriate (ex-vessel) fuel handling is required. Particularly for the Sodium-cooled Fast Reactor (SFR) refueling, its process has unique challenges due to liquid sodium coolant. The ex-vessel spent fuel transportation should concern several design features such as the radiation shielding, decay-heat removal, and inert space separated from air. This paper proposes a new design optimization methodology of cask shielding to transport the spent fuel assembly in a prototype SFR for the first time. The Particle Swarm Optimization (PSO) algorithm had been applied to design trade-offs between shielding and cask weight. The cask is designed as a double-cylinder structure to block an inert sodium region from the air-cooling space. The PSO process yielded the optimum shielding thickness of 26 cm, considering the weight as well. To confirm the shielding performance, the radiation dose of spent fuel removed at its peak burnup and after 1-year cooling was calculated. Two different fuel positions located during transportation were also investigated to consider a functional disorder in a cask drive system. This study concludes the current cask design in normal operations is satisfactory in accordance with regulatory rules.

• ETRI Journal
• /
• 제30권1호
• /
• pp.129-140
• /
• 2008

In this paper, we propose a novel ant colony optimization (ACO)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip (SoCs), on the assumption that the test platform, including specific methods and configurations such as test packet routing, generation, and absorption, is installed. The ACO metaheuristic model, inspired by the ant's foraging behavior, can autonomously find better results by exploring more solution space. The proposed method efficiently combines the rectangle packing method with ACO and improves the scheduling results by dynamically choosing the test-access-mechanism widths for cores and changing the testing orders. The power dissipation and variable test clock mode are also considered. Experimental results using ITC'02 benchmark circuits show that the proposed algorithm can efficiently reduce overall test time. Moreover, the computation time of the algorithm is less than a few seconds in most cases.

• 산업경영시스템학회지
• /
• 제23권61호
• /
• pp.105-114
• /
• 2000

Job Shop Problem which consists of the m different machines and n jobs is a NP-hard problem of the combinatorial optimization. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. Each machine can process at most one operation at a time. The purpose of this paper is to develop the heuristic method to solve large scale scheduling problem using Constraint Satisfaction Problem method and Simulated Annealing. The proposed heuristic method consists of the search algorithm and optimization algorithm. The search algorithm is to find the solution in the solution space using CSP concept such as backtracking and domain reduction. The optimization algorithm is to search the optimal solution using SA. This method is applied to MT06, MT10 and MT20 Job Shop Problem, and compared with other heuristic method.

• 제어로봇시스템학회논문지
• /
• 제8권1호
• /
• pp.28-36
• /
• 2002

Regarding efficient development of computer graphic animations, lots of techniques for editing or transforming existing motion data have been developed. Basically, the motion transformation techniques follow optimization process. To make the animation be natural, almost all the techniques utilize kinematics and dynamics in constructing constraints for the optimization. Since the kinematic and dynamic structures of virtual characters to be animated are very complex, the most time-consuming part is known to the optimization process. In order to suggest some guide lines to engineers involved in the motion transformation, in this paper, we analyze the computational complexities for typical motion transformation in quantitative manner as well as the possibility for parallel computation.

• Journal of Astronomy and Space Sciences
• /
• 제22권1호
• /
• pp.13-20
• /
• 2005

지상 및 우주 천체 망원경용 비구면 반사경면 초기 제작공정에는 고정입자 휠을 사용하는 연삭이 있다. 본 연구에서는 매 연삭 가공 이전에 설정한 목표 표면조도를 달성할 수 있도록 입력 연삭변수들을 결정하고, 표면 가공오차를 추적하며 , 가공 경과시간을 최소화하는 새로운 연삭공정을 개발하였다. 특별히 이 공정 기법은 이전 연삭 가공 작업시 까지 수집된 입력 변수 및 가공 결과 표면조도 자료를 다 변수 회귀분석 방법에 대입하여 목표 표면조도에 따른 최적 연삭가공 입력변수를 매 가공 작업 시 진화적으로 제시하는 지능형 공정 조절 능력을 갖추고 있다. 개발된 공정기법과 초정밀 컴퓨터 수치제어 연삭기를 사용하여 $96.1\~65.0nm(Ra)$ 범위 의 목표 표면조도를 갖는 제로듀어 소재에 대하여 10회 가공 실험을 수행 한 결과 $=-0.906{\pm}3.38(\sigma)nm(Ra)$의 가공 정밀도를 달성하여, 지능형 연삭공정의 효율을 입증하였다. 이러한 연구결과는 천체망원경용 반사경면 연삭 가공 시 정성적 경험에 의존하여 가공하는 기존 기술을 극복하고 정량적 수치 모형에 의하여 가공소요시간 최소화 및 나노미터 급 표면조도를 달성하는 진화형 공정 최적화 기술의 확립이라는 의의를 가지고 있다.