• 제목/요약/키워드: SA(Simulated Annealing)

검색결과 179건 처리시간 0.024초

메탈부쉬 누락예방을 위한 데이터마이닝 기법의 적용 및 비교 (Application and Comparison of Data Mining Technique to Prevent Metal-Bush Omission)

  • 고상현;이동주
    • 산업경영시스템학회지
    • /
    • 제46권3호
    • /
    • pp.139-147
    • /
    • 2023
  • The metal bush assembling process is a process of inserting and compressing a metal bush that serves to reduce the occurrence of noise and stable compression in the rotating section. In the metal bush assembly process, the head diameter defect and placement defect of the metal bush occur due to metal bush omission, non-pressing, and poor press-fitting. Among these causes of defects, it is intended to prevent defects due to omission of the metal bush by using signals from sensors attached to the facility. In particular, a metal bush omission is predicted through various data mining techniques using left load cell value, right load cell value, current, and voltage as independent variables. In the case of metal bush omission defect, it is difficult to get defect data, resulting in data imbalance. Data imbalance refers to a case where there is a large difference in the number of data belonging to each class, which can be a problem when performing classification prediction. In order to solve the problem caused by data imbalance, oversampling and composite sampling techniques were applied in this study. In addition, simulated annealing was applied for optimization of parameters related to sampling and hyper-parameters of data mining techniques used for bush omission prediction. In this study, the metal bush omission was predicted using the actual data of M manufacturing company, and the classification performance was examined. All applied techniques showed excellent results, and in particular, the proposed methods, the method of mixing Random Forest and SA, and the method of mixing MLP and SA, showed better results.

PSO(Particle Swarm Optinization)탐색과정의 가시화 툴 ((Visualization Tool of searching process of Particle Swarm Optimization))

  • 유명련;김현철
    • 융합신호처리학회논문지
    • /
    • 제3권4호
    • /
    • pp.35-41
    • /
    • 2002
  • 복잡한 문제들의 근사해를 구하기 위하여 최근 다양한 방법들이 소개되고 있다. 이러한 방법들은 주로 금속의 서랭(Annealing)에 의해 금속분자의 에너지가 최저점에 도달하는 과정을 모의실험한 최적화 기법(Simulated Annealing), 생물의 적자생존(Survival of Fittest)과정을 이용한 최적화 기법인 유전적 알고리즘(Genetic Algorithm)등 물리적 현상이나 생물 ?생명에 관련된 모의를 최적화 문제에 응용한 방법들이다. 최근에 소개된 Particle Swarm Optimization(PSO)는 주로 조류나 어류등의 생물의 무리가 각각의 개체가 가지고 있는 정보를 공유해가며 먹이를 찾아가는 과정을 모의한 기법이다. 하지만, 이 기법의 탐색과정이 명확하게 밝혀져 있지 않다. 본 논문에서는 PSO의 탐색과정을 가시화 하는 것을 목적으로 한다. 탐색과정을 가시화 하는 작업을 통해 그 탐색 능력을 시각적으로 파악하는 것이 가능하며 기법에 관한 이해를 돕고 교육적 효과도 기대 가능하다.

  • PDF

페이저 측정 시스템의 측정기 최적배치 (Meter Optimal Placement in Measurement System with Phasor Measurement Unit)

  • 김재훈;조기선;김회철;신중린
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1195-1198
    • /
    • 1999
  • This paper presents optimal placement of minimal set of phasor measurement units(PMU's) and observability of measurement system with PMU. By using the incidence matrix symbolic method which directly assigns measurement and pseudo-measurement to incidence matrix, it is much simpler and easier to analyze observability. The optimal PMU set is found through the simulated-annealing(SA) and the direct combinational method. The cooling schedule parameter which is suitable to the property of problem to solve is specified and optimal placement is proven by presented direct combinational method. Search spaces are limited within reasonable feasible solution region to reduce a unnecessary one in the SA implementation based on global search. The proposed method presents to save CPU time and estimate state vectors based on optimal PMU set.

  • PDF

글로벌 라우팅 유전자 알고리즘의 설계와 구현 (Design and Implementation of a Genetic Algorithm for Global Routing)

  • 송호정;송기용
    • 융합신호처리학회논문지
    • /
    • 제3권2호
    • /
    • pp.89-95
    • /
    • 2002
  • 글로벌 라우팅(global routing)은 VLSI 설계 과정중의 하나로, 네트리스트의 모든 네트들을 연결하기 위하여 각 네트들을 라우팅 영역(routing area)에 할당시키는 문제이며, 글로벌 라우팅에서 최적의 해를 얻기 위해 maze routing 알고리즘, line-probe 알고리즘, shortest path 기반 알고리즘, Steiner tree 기반 알고리즘등이 이용된다. 본 논문에서는 라우팅 그래프에서 최단 경로 Steiner tree 탐색방법인 weighted network heuristic(WNH)과 이를 기반으로 하는 글로벌 라우팅 유전자 알고리즘(genetic algorithm; GA)을 제안하였으며, 제안한 방식을 시뮬레이티드 어닐링(SA) 방식과 비교, 분석하였다.

  • PDF

SDS 알고리즘을 이용한 비선형 파라미터 최적화에 관한 연구 (A Study on Nonlinear Parameter Optimization Problem using SDS Algorithm)

  • 이영진;장용훈;이권순
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 B
    • /
    • pp.623-625
    • /
    • 1998
  • This paper focuses on the fast convergence in nonlinear parameter optimization which is necessary for the fitting of nonlinear models to data. The simulated annealing(SA) and genetic algorithm(GA), which are widely used for combinatorial optimization problems, are stochastic strategy for search of the ground state and a powerful tool for optimization. However, their main disadvantage is the long convergence time by unnecessary extra works. It is also recognised that gradient-based nonlinear programing techniques would typically fail to find global minimum. Therefore, this paper develops a modified SA which is the SDS(Stochastic deterministic stochastic) algorithm can minimize cost function of optimal problem.

  • PDF

Efficient Block Packing to Minimize Wire Length and Area

  • Harashima, Katsumi;Ootaki, Yousuke;Kutsuwa, Toshirou
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1539-1542
    • /
    • 2002
  • In layout of LSI and PWB, block pack- ing problem is very important in order to reduce chip area. Sequence-pair is typical one of conventional pack- ing method and can search nearly-optimal solution by using Simulated Annealing(SA). SA takes huge computation time due to evaluating of various packing results. Therefore, Sequence-pair is not effective enough for fast layout evaluation including estimation of wire length and rotation of every blocks. This paper proposes an efficient block packing method to minimize wire length and chip area. Our method searches an optimal packing efficient- ly by using a cluster growth algorithm with changing the most valuable packing score on packing process.

  • PDF

비선형 최적화의 수렴속도 개선에 관한 연구 (A Study on Development of Convergence Time in Nonlinear Optimization Problem)

  • 이영진;이권순;이준탁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1993년도 하계학술대회 논문집 A
    • /
    • pp.348-351
    • /
    • 1993
  • The simulated annealing(SA) algorithm is a stochastic strategy for search of the ground state and a powerful tool for optimization. based on the anneal ins process used for the crystallization in physical systems. It's main disadvantage is the long convergence time. Therefore, this paper shows that the new algorithm using SA can be applied to reduce the computation time. This idea has been used to solve the estimation problem of the nonlinear parameter.

  • PDF

레이더 파형 연구 - 다위상 시퀀스 (A Study on Radar Waveform - Polyphase Sequence)

  • 양진모;김환우
    • 한국군사과학기술학회지
    • /
    • 제13권4호
    • /
    • pp.673-682
    • /
    • 2010
  • This paper describes and analyzes a various generation methods of the mutually orthogonal polyphase sequences with low cross-correlation peak sidelobe and low autocorrelation peak sidelobe levels. The mutual orthogonality is the key requirement of multi-static or MIMO(Multi-Input Multi-Output) radar systems which provides the good target detection and tracking performance. The polyphase sequences, which are generated by SA(Simulated Annealing) and GA(Genetic Algorithm), have been analyzed with ACF(Autocorrelation Function) PSL(Peak Sidelobe Level) and CCF(Crosscorrelation Function) level at the matched filter output. Also, the ambiguity function has been introduced and simulated for comparing Doppler properties of each sequence. We have suggested the phase selection rule for applying multi-static or MIMO systems.

Automatic Parameter Tuning for Simulated Annealing based on Threading Technique and its Application to Traveling Salesman Problem

  • Fangyan Dong;Iyoda, Eduardo-Masato;Kewei Chen;Hajime Nobuhara;Kaoru Hirota
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.439-442
    • /
    • 2003
  • In order to solve the difficulties of parameter settings in SA algorithm, an improved practical SA algorithm is proposed by employing the threading techniques, appropriate software structures, and dynamic adjustments of temperature parameters. Threads provide a mechanism to realize a parallel processing under a disperse environment by controlling the flux of internal information of an application. Thread services divide a process by multiple processes leading to parallel processing of information to access common data. Therefore, efficient search is achieved by multiple search processes, different initial conditions, and automatic temperature adjustments. The proposed are methods are evaluated, for three types of Traveling Salesman Problem (TSP) (random-tour, fractal-tour, and TSPLIB test data)are used for the performance evaluation. The experimental results show that the computational time is 5% decreased comparing to conventional SA algorithm, furthermore there is no need for manual parameter settings. These results also demonstrate that the proposed method is applicable to real-world vehicle routing problems.

  • PDF

A DFT and QSAR Study of Several Sulfonamide Derivatives in Gas and Solvent

  • Abadi, Robabeh Sayyadi kord;Alizadehdakhel, Asghar;Paskiabei, Soghra Tajadodi
    • 대한화학회지
    • /
    • 제60권4호
    • /
    • pp.225-234
    • /
    • 2016
  • The activity of 34 sulfonamide derivatives has been estimated by means of multiple linear regression (MLR), artificial neural network (ANN), simulated annealing (SA) and genetic algorithm (GA) techniques. These models were also utilized to select the most efficient subsets of descriptors in a cross-validation procedure for non-linear -log (IC50) prediction. The results obtained using GA-ANN were compared with MLR-MLR, MLR-ANN, SA-ANN and GA-ANN approaches. A high predictive ability was observed for the MLR-MLR, MLR-ANN, SA-ANN and MLR-GA models, with root mean sum square errors (RMSE) of 0.3958, 0.1006, 0.0359, 0.0326 and 0.0282 in gas phase and 0.2871, 0.0475, 0.0268, 0.0376 and 0.0097 in solvent, respectively (N=34). The results obtained using the GA-ANN method indicated that the activity of derivatives of sulfonamides depends on different parameters including DP03, BID, AAC, RDF035v, JGI9, TIE, R7e+, BELM6 descriptors in gas phase and Mor 32u, ESpm03d, RDF070v, ATS8m, MATS2e and R4p, L1u and R3m in solvent. In conclusion, the comparison of the quality of the ANN with different MLR models showed that ANN has a better predictive ability.