• 터널과지하공간
• /
• 제15권2호
• /
• pp.145-156
• /
• 2005

도심지 지하철 및 산악 터널의 굴착과 관련한 지하수유동 해석 및 환경 영향 평가를 위해 3차원 유한 차분 모형인 MODFLOW가 널리 이용되고 있는 추세이다. 수치해석 결과는 일반적으로 경계조건, 초기조건, 개념 모델 설정 및 수리 물성치 등에 의해 차이가 난다. 따라서 대상 해석 영역의 실제 상황을 반영한 지하수 모델링은 매우 중요하다. 일반적으로 지하수 유동 해석과 관련한 많은 경우, 경계 조건 설정보다는 수리 물성치의 결정에 어려움이 많으며, 이는 제한된 조사나 실험 결과로부터 전체 대상 영역의 매질을 결정하기 때문이다. 본 연구에서는 모의 담금질(SA : Simulated Annealing) 기법을 활용하여 지반 조사 자료, 특히 물리탐사 결과 이미지와 제한된 개소의 수리 전도도 자료를 병합하여 수리 매질들을 실현시켰다. 지구통계학적 등가 매질들을 대상으로 하여 수리 전도도의 불확실성을 고려한 지하수 유동 해석을 수행하였다. 지하수 환경 영향 평가 및 터널 내 유입 지하수 문제에 있어 수리 전도도의 불확실성을 고려함으로써 확률론적 접근이 가능하였다.

• Industrial Engineering and Management Systems
• /
• 제10권2호
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• 한국해양공학회지
• /
• 제17권6호
• /
• pp.38-46
• /
• 2003

Aim of this article is to propose Micro-Genetic Simulated Annealing (${\mu}GSA$) as a hybrid metaheuristics approach to find the global optimum of nonlinear optimisation problems. This approach combines the features of modern metaheuristics such as micro-genetic algorithm (${\mu}GAs$) and simulated annealing (SA) with the general robustness of parallel exploration and asymptotic convergence, respectively. Therefore, ${\mu}GSA$ approach can help in avoiding the premature convergence and can search for better global solution, because of its wide spread applicability, global perspective and inherent parallelism. For the superior performance of the ${\mu}GSA$, the five well-know benchmark test functions that were tested and compared with the two global optimisation approaches: scatter search (SS) and hybrid scatter genetic tabu (HSGT) approach. A practical application to structural sandwich panel is also examined by optimism the weight function. From the simulation results, it has been concluded that the proposed ${\mu}GSA$ approach is an effective optimisation tool for soloing continuous nonlinear global optimisation problems in suitable computational time frame.

• 한국군사과학기술학회지
• /
• 제15권3호
• /
• pp.322-333
• /
• 2012

AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability. For this reason, Radar Resource Management(RRM) becomes new challenging issue. RRM is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed a rule-based scheduling algorithm and Simulated Annealing(SA) based scheduling algorithm, which are alternatively selected and applied to beam scheduler according radar load status in real-time. The performance of the proposed algorithm was evaluated on the multi-function radar scenario. As a result, we showed that our proposed algorithm can process a lot of beams at the right time with real time capability, compared with applying only rule-based scheduling algorithm. Additionally, we showed that the proposed algorithm can save scheduling time remarkably, compared with applying only SA-based scheduling algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제11권1호
• /
• pp.192-199
• /
• 2016

With changes in insulated defects, the environment, and so on, new partial discharge (PD) data are highly different from the original samples. It leads to a decrease in on-line recognition rate. The UHF signal and pulse current signal of four kinds of typical artificial defect models in gas insulated switchgear (GIS) are obtained simultaneously by experiment. The relationship map of ultra-high frequency (UHF) cumulative energy and its corresponding apparent discharge of four kinds of typical artificial defect models are plotted. UHF cumulative energy and its corresponding apparent discharge are used as inputs. The support vector machine (SVM) incremental method is constructed. Examples show that the PD SVM incremental method based on simulated annealing (SA) effectively speeds up the data update rate and improves the adaptability of the classifier compared with the original method, in that the total sample is constituted by the old and new data. The PD SVM incremental method is a better pattern recognition technology for PD on-line monitoring.

• Journal of Mechanical Science and Technology
• /
• 제20권8호
• /
• pp.1125-1138
• /
• 2006

The optimal design of the squeeze film damper (SFD) for rotor system has been studied in previous researches. However, these researches have not been considering jumping or nonlinear phenomena of a rotor system with SFD. This paper represents an optimization technique for linear and nonlinear response of a simple rotor system with SFDs by using a hybrid GA-SA algorithm which combined enhanced genetic algorithm (GA) with simulated annealing algorithm (SA). The damper design parameters are the radius, length and radial clearance of the damper. The objective function is to minimize the transmitted load between SFD and foundation at the operating and critical speeds of the rotor system with SFD which has linear and nonlinear unbalance responses. The numerical results show that the transmitted load of the SFD is greatly reduced in linear and nonlinear responses for the rotor system.

• 한국정보과학회 언어공학연구회:학술대회논문집(한글 및 한국어 정보처리)
• /
• 한국정보과학회언어공학연구회 2002년도 제14회 한글 및 한국어 정보처리 학술대회
• /
• pp.199-206
• /
• 2002

언어가 아닌 다양한 지식원으로부터 그것을 설명하는 텍스트를 생성하는 텍스트 생성 (text generation)은 여러 가지 복합적이고 단계적인 과정을 거쳐 이루어진다. 자연스러운 텍스트를 생성하기 위한 여러 단계 중, 지식원으로부터 텍스트에 포함되기 위해 뽑힌 정보들간의 순서를 적절히 결정하는 과정을 텍스트 구조화(text structuring)라고 한다. 텍스트 구조화는 생성될 텍스트의 결속성(coherence)을 크게 좌우하므로, 양질의 텍스트를 생성하기 위해서는 텍스트 구조화를 다루기 위한 정교한 방법론이 요구된다. 본 논문에서는 SA(simulated annealing) 알고리즘을 이용해 추계적 텍스트 구조화 방안을 제안하며 특히, SA의 평가 함수(evaluation function)로서, 총 4가지의 방법론-중심화 이론(centering theory)을 이용한 센터 전이 유형의 선호도, 추론 비용에 근거한 전이 유형간의 선호도, 서두 문장을 결정하기 위한 가중치 할당에 따른 선호도, 인접한 문장간의 유사도에 따른 선호도-을 제안하고 실험을 통해, 그 효용성을 보였다.

• 융합신호처리학회논문지
• /
• 제12권1호
• /
• pp.62-66
• /
• 2011

본 논문에서는 퍼지 제어기를 최적화하기 위하여 시뮬레이티드 어닐링(simulated annealing)과 결합한 병렬형 랜덤 신호 기반 학습법을 제안하였다. 랜덤 신호 기반 학습은 직렬 탐색구조로 되어 있어서 지역 탐색 능력은 뛰어나지만 전역 탐색 능력은 부족하다. 이러한 문제점을 극복하기 위하여 다양한 탐색 영역을 가지는 병렬형 랜덤 신호 기반 학습법이 소개 되었으며, 시뮬레이티드 어닐링을 랜덤 신호 기반 학습과 결합하여 학습 능력을 향상시켰다. 제안된 최적화 알고리즘을 도립진자 제어를 위한 퍼지 제어기 설계 최적화에 적용하여 그 유효성을 보였다.

• Structural Engineering and Mechanics
• /
• 제36권6호
• /
• pp.759-783
• /
• 2010

In this paper, compressive strength of carbon fiber reinforced polymer (CFRP) confined concrete cylinders is formulated using a hybrid method coupling genetic programming (GP) and simulated annealing (SA), called GP/SA, and a robust variant of GP, namely multi expression programming (MEP). Straightforward GP/SA and MEP-based prediction equations are derived for the compressive strength of CFRP-wrapped concrete cylinders. The models are constructed using two sets of predictor variables. The first set comprises diameter of concrete cylinder, unconfined concrete strength, tensile strength of CFRP laminate, and total thickness of CFRP layer. The most widely used parameters of unconfined concrete strength and ultimate confinement pressure are included in the second set. The models are developed based on the experimental results obtained from the literature. To verify the applicability of the proposed models, they are employed to estimate the compressive strength of parts of test results that were not included in the modeling process. A sensitivity analysis is carried out to determine the contributions of the parameters affecting the compressive strength. For more verification, a parametric study is carried out and the trends of the results are confirmed via some previous studies. The GP/SA and MEP models are able to predict the ultimate compressive strength with an acceptable level of accuracy. The proposed models perform superior than several CFRP confinement models found in the literature. The derived models are particularly valuable for pre-design purposes.

• 대한산업공학회지
• /
• 제24권1호
• /
• pp.145-156
• /
• 1998

In a classical clustering problem, grouping is done on the basis of similarities or distances (dissimilarities) among the elements. Therefore, the objective is to minimize the variance within each group while maximizing the between-group variance among all groups. In this paper, however, a new class of clustering problem is introduced. We call this a laydown grouping problem (LGP). In LGP, the objective is to minimize both the within-group and between-group variances. Furthermore, the problem is expanded to a multi-dimensional case where the two-way minimization process must be considered for each dimension simultaneously for all measurement characteristics. At first, the problem is assessed by analyzing its variance structures and their complexities by conjecturing that LGP is NP-complete. Then, the simulated annealing (SA) algorithm is applied and the results are compared against that from others.