• Title/Summary/Keyword: Simulated annealing neural network

Search Result 33, Processing Time 0.025 seconds

Quantification Analysis Problem using Mean Field Theory in Neural Network (평균장 이론을 이용한 전량화분석 문제의 최적화)

  • Jo, Gwang-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.3
    • /
    • pp.417-424
    • /
    • 1995
  • This paper describes MFT(Mean Field Theory) neural network with continuous with continuous variables is applied to quantification analysis problem. A quantification analysis problem, one of the important problems in statistics, is NP complete and arises in the optimal location of objects in the design space according to the given similarities only. This paper presents a MFT neural network with continuous variables for the quantification problem. Starting with reformulation of the quantification problem to the penalty problem, this paper propose a "one-variable stochastic simulated annealing(one-variable SSA)" based on the mean field approximation. This makes it possible to evaluate of the spin average faster than real value calculating in the MFT neural network with continuous variables. Consequently, some experimental results show the feasibility of this approach to overcome the difficulties to evaluate the spin average value expressed by the integral in such models.ch models.

  • PDF

Development of Well Placement Optimization Model using Artificial Neural Network and Simulated Annealing (인공신경망과 SA 알고리즘을 이용한 지능형 생산정 위치 최적화 전산 모델 개발)

  • Kwak, Tae-Sung;Jung, Ji-Hun;Han, Dong-Kwon;Kwon, Sun-Il
    • Journal of the Korean Institute of Gas
    • /
    • v.19 no.1
    • /
    • pp.28-37
    • /
    • 2015
  • This study presents the development of a well placement optimization model, combining an artificial neural network, which enables high-speed calculation, with a simulated annealing algorithm. The conventional FDM simulator takes excessive time when used to perform a field scale reservoir simulation. In order to solve this problem, an artificial neural network was applied to the model to allow the simulation to be executed within a short time. Also by using the given result, the optimization method, SA algorithm, was implemented to automatically select the optimal location without taking any subjective experiences into consideration. By comparing the result of the developed model with the eclipse simulator, it was found that the prediction performance of the developed model has become favorable, and the speed of calculation performance has also been improved. Especially, the optimum value was estimated by performing a sensitivity analysis for the cooling rate and the initial temperature, which is the control parameter of SA algorithm. From this result, it was verified that the calculation performance has been improved, as well. Lastly, an optimization for the well placement was performed using the model, and it concluded the optimized place for the well by selecting regions with great productivity.

Optimum Design of Midship Section by Artificial Neural Network (뉴랄 네트워크에 의한 선체 중앙단면 최적구조설계)

  • Yang, Y.S.;Moon, S.H.;Kim, S.H.
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.33 no.2
    • /
    • pp.44-55
    • /
    • 1996
  • Since the use of computer for the ship structural design around mid 1960``s, specially many researches on the midship section optimum design were carried out from 1980. For a rule-based optimum design case, there has been a problem of handling a discrete design variable such as plate thickness for a practical use. To deal with the discrete design variable problems and to develop an effective new method using artificial neural network for the ship structural design applications, Neuro-Optimizer combing Hopfield Neural Network and other Simulated Annealing is proposed as a new optimization method and then applied to the fundamental skeletal structures and Midship section of Tanker. From the numerical results, it is confirmed that Neuro-Optimizer could be used effectively as a new optimization method for the structural design.

  • PDF

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.

Predicting Corporate Bankruptcy using Simulated Annealing-based Random Fores (시뮬레이티드 어니일링 기반의 랜덤 포레스트를 이용한 기업부도예측)

  • Park, Hoyeon;Kim, Kyoung-jae
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.155-170
    • /
    • 2018
  • Predicting a company's financial bankruptcy is traditionally one of the most crucial forecasting problems in business analytics. In previous studies, prediction models have been proposed by applying or combining statistical and machine learning-based techniques. In this paper, we propose a novel intelligent prediction model based on the simulated annealing which is one of the well-known optimization techniques. The simulated annealing is known to have comparable optimization performance to the genetic algorithms. Nevertheless, since there has been little research on the prediction and classification of business decision-making problems using the simulated annealing, it is meaningful to confirm the usefulness of the proposed model in business analytics. In this study, we use the combined model of simulated annealing and machine learning to select the input features of the bankruptcy prediction model. Typical types of combining optimization and machine learning techniques are feature selection, feature weighting, and instance selection. This study proposes a combining model for feature selection, which has been studied the most. In order to confirm the superiority of the proposed model in this study, we apply the real-world financial data of the Korean companies and analyze the results. The results show that the predictive accuracy of the proposed model is better than that of the naïve model. Notably, the performance is significantly improved as compared with the traditional decision tree, random forests, artificial neural network, SVM, and logistic regression analysis.

Resolutions of NP-complete Optimization Problem (최적화 문제 해결 기법 연구)

  • Kim Dong-Yun;Kim Sang-Hui;Go Bo-Yeon
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.1
    • /
    • pp.146-158
    • /
    • 1991
  • In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

  • PDF

(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

A Study on Configuration Optimization for Rotorcraft Fuel Cells based on Neural Network (인공신경망을 이용한 연료셀 형상 최적화 연구)

  • Kim, Hyun-Gi;Kim, Sung-Chan;Lee, Jong-Won;Hwang, In-Hee
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.25 no.1
    • /
    • pp.51-56
    • /
    • 2012
  • Crashworthy fuel cells have been widely implemented to rotorcraft and rendered a great contribution for improving the survivability of crews and passengers. Since the embryonic stage of military rotorcraft history began, the US army has developed and practised a detailed military specification documenting the unique crashworthiness requirements for rotorcraft fuel cells to prevent most fatality due to post-crash fire. Foreign manufacturers have followed their long term experience to develop their fuel cells, and have reflected the results of crash impact tests on the trial-and-error based design and manufacturing procedures. Since the crash impact test itself takes a long-term preparation efforts together with costly fuel cell specimens, a series of numerical simulations of the crash impact test with digital mock-ups is necessary even at the early design stage to minimize the possibility of trial-and-error with full-scale fuel cells. In the present study a number of numerical simulations on fuel cell crash impact tests are performed with a crash simulation software, Autodyn. The resulting equivalent stresses are further analysed to evaluate a number of appropriate design parameters and the artificial neural network and simulated annealing method are simultaneously implemented to optimize the crashworthy performance of fuel cells.

Study on the Weight Optimization of Excavator Attachments Considering Durability (굴삭기 작업장치 내구 경량 최적화 기법 연구)

  • Kim, Pan-Young;Kim, Hyun-Gi;Park, Jin-Soo;Hwang, Jae-Bong;Song, Kyu-Sam
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.349-353
    • /
    • 2007
  • The main functions of excavator are mainly carried out by excavator attachments such as arm and boom. These components should be designed to be light as well as durable enough because their effects on the whole structure are significant. In this paper, an optimization procedure for lightweight design considering fatigue strength for excavator attachments is presented. The weight of attachments and allowable fatigue stresses at critical areas are used as objective function and constraints, respectively, in which design variables are the thickness of the plates of attachments. The simulated annealing search method is adopted for a global optimization solution. Besides, the response surface method using the artificial neural network is used to simulate constraint function for the sake of practical fast calculation. Some example case of optimization is presented here for a sample excavator. This weight optimization is expected to contribute to a considerable improvement of fuel efficiency of excavator.

  • PDF

Optimization of Design Parameters of a EPPR Valve Solenoid using Artificial Neural Network (인공 신경회로망을 이용한 전자비례 감압밸브의 솔레노이드 형상 최적화)

  • Yoon, Ju Ho;Nguyen, Minh Nhat;Lee, Hyun Su;Youn, Jang Won;Kim, Dang Ju;Lee, Dong Won;Ahn, Kyoung Kwan
    • Journal of Drive and Control
    • /
    • v.13 no.2
    • /
    • pp.34-41
    • /
    • 2016
  • Unlike the commonly used On/Off solenoid, constant attraction force which is independent of plunger displacement is a considerably important characteristic to proportional solenoid of the EPPR Valve. Attraction force uniformity is mainly affected by the internal shape design parameters. Due to a number of shape design parameters, the optimal parameter values are very complex and time consuming to find by trial and error method. Much research has been conducted or are still in progress to find the optimal parameter values by applying various optimization techniques like Genetic Algorithm, Evolution Strategy, Simulated Annealing, or the Taguchi method. In this paper, the design parameters which have primary effects on the attraction force uniformity and the average attraction force are decided by main effects analysis of Design of Experiments. Optimal parameter values are derived using finite-element analysis and a neural network model.