• Title/Summary/Keyword: simulated Annealing(SA)

Search Result 181, Processing Time 0.027 seconds

Blind Nonlinear Channel Equalization by Performance Improvement on MFCM (MFCM의 성능개선을 통한 블라인드 비선형 채널 등화)

  • Park, Sung-Dae;Woo, Young-Woon;Han, Soo-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.11
    • /
    • pp.2158-2165
    • /
    • 2007
  • In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, and placed at the center of a Radial Basis Function(RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

Simulated Annealing for Overcoming Data Imbalance in Mold Injection Process (사출성형공정에서 데이터의 불균형 해소를 위한 담금질모사)

  • Dongju Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.45 no.4
    • /
    • pp.233-239
    • /
    • 2022
  • The injection molding process is a process in which thermoplastic resin is heated and made into a fluid state, injected under pressure into the cavity of a mold, and then cooled in the mold to produce a product identical to the shape of the cavity of the mold. It is a process that enables mass production and complex shapes, and various factors such as resin temperature, mold temperature, injection speed, and pressure affect product quality. In the data collected at the manufacturing site, there is a lot of data related to good products, but there is little data related to defective products, resulting in serious data imbalance. In order to efficiently solve this data imbalance, undersampling, oversampling, and composite sampling are usally applied. In this study, oversampling techniques such as random oversampling (ROS), minority class oversampling (SMOTE), ADASYN(Adaptive Synthetic Sampling), etc., which amplify data of the minority class by the majority class, and complex sampling using both undersampling and oversampling, are applied. For composite sampling, SMOTE+ENN and SMOTE+Tomek were used. Artificial neural network techniques is used to predict product quality. Especially, MLP and RNN are applied as artificial neural network techniques, and optimization of various parameters for MLP and RNN is required. In this study, we proposed an SA technique that optimizes the choice of the sampling method, the ratio of minority classes for sampling method, the batch size and the number of hidden layer units for parameters of MLP and RNN. The existing sampling methods and the proposed SA method were compared using accuracy, precision, recall, and F1 Score to prove the superiority of the proposed method.

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

  • Sang-Hyun Ko;Dongju Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.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.

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

  • 유명련;김현철
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.4
    • /
    • pp.35-41
    • /
    • 2002
  • To solve the large scale optimization problem approximately, various approaches have been introduced. They are mainly based on recent research advancement of simulations for evolutions, flocking, annealing, and interactions among organisms on artificial environments. The typical ones are simulated annealing(SA), artificial neural network(ANN), genetic algorithms(GA), tabu search(TS), etc. Recently the particle swarm optimization(PSO) has been introduced. The PSO simulates the process of birds flocking or fish schooling for food, as with the information of each agent Is share by other agents. The PSO technique has been applied to various optimization problems of which variables are continuous. However, there are seldom trials for visualization of searching process. This paper proposes a new visualization tool for searching process particle swarm optimization(PSO) algorithm. The proposed tool is effective for understanding the searching process of PSO method and educational for students.

  • PDF

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

  • Kim, Jae-Hoon;Cho, Ki-Seon;Kim, Hoi-Cheol;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 1999.07c
    • /
    • 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 (글로벌 라우팅 유전자 알고리즘의 설계와 구현)

  • 송호정;송기용
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.2
    • /
    • pp.89-95
    • /
    • 2002
  • Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

  • PDF

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

  • Lee, Young-J.;Jang, Young-H.;Lee, Kwon-S.
    • Proceedings of the KIEE Conference
    • /
    • 1998.07b
    • /
    • 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
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • 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 (비선형 최적화의 수렴속도 개선에 관한 연구)

  • Lee, Young-J.;Lee, Kwon-S.;Lee, Jun-T.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • 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 (레이더 파형 연구 - 다위상 시퀀스)

  • Yang, Jin-Mo;Kim, Whan-Woo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.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.