• 대한전자공학회논문지SD
• /
• 제44권5호
• /
• pp.42-49
• /
• 2007

본 논문에서는 열전도 환경하의 MCM과 진공에서 작동하는 우주전자 장비의 신뢰도 최적화를 위한 부품 배치 연구에 관해 기술하고 있다. 최적배치를 위해 초기 부품 배치 후 FDM을 solver로 이용하여 부품의 접합온도를 계산하였으며 접합온도를 이용하여 전자장치의 신뢰도를 예측한 후 시뮬레이티드 어닐링 방법을 통해 신뢰도 최적배치 결과가 기술되었다. 시뮬레이티드 어닐링 적용 시 흔들기는 부품 치환방식을 이용하였으며 온도 감소계수 및 열 평형 계수의 변화에 따른 시뮬레이션 결과를 기술하였으며 특히 장치의 고장률 최소화 목적함수와 평균 접합온도 최소화 목적함수에 대해 각 적용결과에 대한 비교분석을 통하여 새로운 신뢰도 최적화 접근방법을 제안하였다.

• 한국시뮬레이션학회논문지
• /
• 제10권2호
• /
• pp.1-14
• /
• 2001

The layout design of component plays an important role in the design and usability of many engineering products. The Engineering artifacts of today are becoming increasingly complicated. The simulated annealing method has been applied effectively to the layout and packing problems of wafer. The main characteristics of simulated annealing method is that an optimum can be obtained from the many local optimums by controlling the temperature and introducing the statistic flickering. The objective of this study is to suggest a method to apply the simulated annealing method to the three dimensional layout design of submergible boat which has multiple constraint conditions and evaluation criteria. We describe an approach to define cost function, constraints and generate layouts using a computer. In this research three dimensional LAYout Design Optimization Program(LAYDOP ver.2) has been developed. The layout result(the total value of evaluation criteria) designed by a human layout expert has been improved by 31.0% using this program.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집A
• /
• pp.939-944
• /
• 2001

Genetic algorithm is modelled on natural evolution and simulated annealing is based on the simulation of thermal annealing. Both genetic algorithm and simulated annealing are stochastic method. So they can find global optimum values. For compare efficiency of SA and GA's, some function value was maximized. In the result, that was a little better than GA's.

• 한국컴퓨터정보학회논문지
• /
• 제6권1호
• /
• pp.25-30
• /
• 2001

본 논문에서는 Rural Postman Problem(RPP) 해법을 위한 향상된 Simulated Annealing(SA) 알고리즘을 제안한다. SA 알고리즘에서는 냉각 스케줄을 어떻게 설정하느냐에 따라 알고리즘의 성능에 영향을 준다. 따라서, 본 논문에서는 RPP를 위한 냉각 스케줄을 제안하고, 기존에 많이 적용되는 냉각스케줄을 적용한 결과와 비교하여 SA 알고리즘의 성능을 분석한다 실험 결과에서는 본 논문에서 제안한 알고리즘이 기존의 SA 알고리즘에 비해 문제의 크기가 클수록 좋은 결과를 얻는다는 것을 알 수 있었다.

• E2M - 전기 전자와 첨단 소재
• /
• 제10권9호
• /
• pp.881-888
• /
• 1997

This study demonstrats the profiles of phosphorus ions in silicon by MeV implantation(1∼3 MeV). Implanted profiles could be measured by SIMS(Cameca 4f) and compared with simulation results(TRIM program and analytical description method only using on Pearson function). The experimental result in the peak concentration region has a little bit deviation from simulation data. By RBS and Channeling measurements the defect distribution of implanted samples could be measured and spectrum are calibrated depth with RUMP simulation By XTEM measurement the thickness of defect zone also could be measured. Finally thermal annealing for the electrical activation of implanted ions carried out by RTA(rapid thermal annealing). The concentration-depth profiles after heat treatment was measured by SR(spreading resistance)-method.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1993년도 제3회 정기총회 및 추계학술발표회
• /
• pp.16-16
• /
• 1993

The efficient use of capital intensive FMS requires determination of effective dispatching priority with which the parts of the selected part types are to be inputed into the system. This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS, Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness, Computational performance of the algorithm shows that good solutions can be obtained within a reasonable amount of computations. The paper also compares the performance of the "optimal" or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules such as SPT, EDD and SLACK.

• 한국시뮬레이션학회논문지
• /
• 제5권1호
• /
• pp.91-106
• /
• 1996

Control Variate (CV) is very useful technique for variance reduction in a wide class of queueing network simulations. However, the loss in variance reduction caused by the estimation of the optimum control coefficients is an increasing function of the number of control variables. Therefore, in some situations, it is required to select an optimal set of control variables to maximize the variance reduction . In this paper, we develop the Adaptive Control Variates (ACV) method which selects an optimal set of control variates during the simulation adatively. ACV is useful to maximize the simulation efficiency when we need iterated simulations to find an optimal solution. One such an example is the Simulated Annealing (SA) because, in SA algorithm, we have to repeat in calculating the objective function values at each temperature, The ACV can also be applied to the queueing network optimization problems to find an optimal input parameters (such as service rates) to maximize the throughput rate with a certain cost constraint.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1041-1044
• /
• 1998

In this paper the cellular neural networks with annealing capability is designed. The annealing capability helps the networks escape from the local-minimum points and quickly search for the global-minimum point. A 6$\times$6 CNN chip is designed using a $0.8\mu\textrm{m}$ CMOS technology, and the chip area is 2.89mm$\times$2.89mm. The simulation results for hole filling image processing show that the general CNN has a local-minimum problem, but the annealed CNN finds the global-minimum solutions very efficiently.

• Communications for Statistical Applications and Methods
• /
• 제10권3호
• /
• pp.1025-1036
• /
• 2003

Variable selection algorithm for principal component analysis using penalty function is proposed. We use the fact that usual principal component problem can be expressed as a maximization problem with appropriate constraints and we will add penalty function to this maximization problem. Simulated annealing algorithm is used in searching for optimal solutions with penalty functions. Comparisons between several well-known penalty functions through simulation reveals that the HARD penalty function should be suggested as the best one in several aspects. Illustrations with real and simulated examples are provided.