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

As a trend toward multi-product batch processes is increasing in Chemical Process Industry (CPI), multi-product batch scheduling has been actively studied. But the optimal production scheduling problems for multi-product batch processes are known as NP-complete. Recently Ku and Karimi [5] have studied Simulated Annealing(SA) and Jung et al.[6] have developed Modified Simulated Annealing (MSA) method which was composed of two stage search algorithms for scheduling of batch processes with UIS and NIS. Jung et al.[9] also have studied the Common Intermediate Storage(CIS) policy which have accepted as a high efficient intermediate storage policy. It can be also applied to pipeless mobile intermediate storage pacilities. In spite of these above researches, there have been no contribution of scheduling of CIS policy for chemical batch processes. In this paper, we have developed another MSA for scheduling chemical batch processes with searching the suitable control parameters for CIS policy and have tested the this algorithm with randomly generated various scheduling problems. From these tests, MSA is outperformed to general SA for CIS batch process system.

• 대한기계학회논문집A
• /
• 제20권6호
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• 한국컴퓨터그래픽스학회논문지
• /
• 제4권1호
• /
• pp.31-40
• /
• 1998

활성외곽선모델(active contour model)은 물체의 경계를 분할하기 위한 효과적인 방법으로 사용되고 있다. 그런데, 기존 활성외곽선모텔에서는 초기곡선을 분할하고자하는 물체의 경계면에 위치시키고 지역적으로 에너지를 최소화 함에 따라 결과가 초기 곡선의 위치와 형태에 따라 달라지는 단점이 있었다. 본 논문에서는 활성외곽선모델을 B-Spline 곡선에 의해 표현하고, 에너지 최소화 과정에 유전자 알고리즘(Genetic Algorithm: GA)과 시뮬레이티드 어닐링 (Simulated Annealing : SA)을 적용함으로써 기존 활성외곽선모델이 갖는 초기 곡선에 대한 제약성을 개선하고자 했으며, 두가지 방법에 따른 분할 결과와 문제점을 비교하고자 하였다. 제안한 방법의 성능비교를 위하여 이진 합성 영상과 CT 영상, MR 영상을 대상으로 실험을 수행하였다.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• pp.464-469
• /
• 1999

Recently, the need for designing multi-stage gear drive has been increased as the hear drives are used more in the applications with high-speed and small volume. The design of multi-stage gear drives includes not only dimensional design but also configuration design of various machine elements. Until now, however, the researches on the design of gear drives are mainly focused on the single-stage gear drives and the design practices for multi-stage gear drives, especially in configuration design activity, mainly depend on the experiences and 'sense' of the designer by trial and error. We propose a design algorithm to automate the dimension design and the configuration design of multi-stage gear drives. The design process consists of four steps. The number of stage should be determined in the first step. In second step, the gear ratios of each reduction stage are determined using random search, and the ratios are basic input for the dimension design of gears, which is performed by the exhaustive search in third step. The designs of gears are guaranteed by the pitting resistance and bending strength rating practices by AGMA rating formulas. In configuration design, the positions of gears are determined to minimize the volume of gearbox using simulated annealing algorithm. The effectiveness of the algorithm is assured by the design example of a 4-stage gear drive.

• 한국전산구조공학회논문집
• /
• 제21권2호
• /
• pp.189-197
• /
• 2008

본 연구에서는 3개 이상의 기둥그룹에 대해서도 일반적으로 적용 가능한 기둥축소량의 최적보정기법을 제안하고, 이를 실제 시공된 건물에 적용하여 그 적용성을 평가하였다. 제안된 최적보정기법은 성능 및 시공상의 제약조건을 만족하면서 보정개소를 최소한으로 할 수 있는 층그룹 및 이때의 보정량을 산정하며, 상대보정뿐만 아니라 절대보정을 고려한 혼합보정도 가능하다. 최적보정에는 시뮬레이티드 어닐링(simulated annealing)이 주요 알고리즘으로 사용되었다. 제안된 기법을 실제 축소량 보정이 수행된 61층 건물에 적용한 결과, 보정량을 쉽게 산출할 수 있고 또한 실무방식보다 보정개소를 줄일 수 있어 적용성이 뛰어남을 확인하였다.

• Nuclear Engineering and Technology
• /
• 제53권4호
• /
• pp.1304-1310
• /
• 2021

Two-phase flow, especially gas-liquid two-phase flow, has a wide application in industrial field. The diagnosis of two-phase flow parameters, which directly determine the flow and heat transfer characteristics, plays an important role in providing the design reference and ensuring the security of online operation of two-phase flow system. Computer tomography (CT) is a good way to diagnose such parameters with imaging method. This paper has proposed a novel image reconstruction method for thermal neutron CT of two-phase flow with improved simulated annealing (ISA) algorithm, which makes full use of the prior information of two-phase flow and the advantage of stochastic searching algorithm. The reconstruction results demonstrate that its reconstruction accuracy is much higher than that of the reconstruction algorithm based on weighted total difference minimization with soft-threshold filtering (WTDM-STF). The proposed method can also be applied to other types of two-phase flow CT modalities (such as X(𝛄)-ray, capacitance, resistance and ultrasound).

• 제어로봇시스템학회논문지
• /
• 제5권4호
• /
• pp.394-402
• /
• 1999

In this paper, we present an effective RLS algorithm with forgetting factor of Erlang function for the system identification. In the proposed algorithm, the forgetting factor decreases monotonically in the first stage, and then it increases monotonically in the second stage in contrary to the conventional forgetting factor RLS algorithms. In addition, annealing effect and an asymptotically stability of the proposed algorithm is discussed based on the analysis of convergency property on. Simulation results for the system identification problem indicate the superiority of the proposed algorithm in comparison to the RLS algorithm such as NLMS and Kalman filter based algorithm.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1436-1441
• /
• 2003

Recently, simulated annealing algorithms have widely been applied to many structural optimization problems. In this paper, simulated annealing, boltzmann annealing, fast annealing and adaptive simulated annealing are applied to optimization of truss structures for improvement quality of objective function and number of function evaluation. These algorithms are classified by cooling schedule. The authors have changed parameters of ASA's cooling schedule and the influence of cooling schedule parameters on structural optimization obtained is discussed. In addition, cooling schedule of BA and ASA mixed is applied to 10 bar-truss structure.

• 한국전자파학회논문지
• /
• 제14권5호
• /
• pp.499-505
• /
• 2003

이동 무선 통신 시스템을 설계할 때 기지국의 위치는 매우 중요한 파라미터 중 하나이다. 기지국 위치를 설계할 때 여러 가지 복잡한 변수들을 잘 조합하여 코스트가 최소가 되도록 설계해야 한다. 이러한 문제를 해결하는데 필요한 알고리즘이 조합 최적화 알고리즘이며, 지금까지 조합 최적화 기술로 Random Walk, Simulated Annealing, Tabu Search, Genetic Algorithm과 같은 전역 최적화 기술이 사용되어 왔다. 본 논문은 이동 통신시스템의 기지국 위치 최적화에 위의 4가지 알고리즘들을 적용하여 각 알고리즘의 결과를 비교 분석하며 알고리즘에 의한 최적화 과정을 보여준다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• pp.513-516
• /
• 2002

In electrical impedance tomography(EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents two intelligent optimization algorithm techniques such as genetic algorithm and simulated annealing for the solution of the static EIT inverse problem. We summarize the simulation results for the three algorithm forms: modified Newton-Raphson, genetic algorithm, and simulated annealing.