• Title/Summary/Keyword: 진화기법

Search Result 485, Processing Time 0.029 seconds

Introduction of Inverse Analysis Model Using Geostatistical Evolution Strategy and Estimation of Hydraulic Conductivity Distribution in Synthetic Aquifer (지구통계학적 진화전략 역산해석 기법의 소개 및 가상 대수층 수리전도도 분포 예측에의 적용)

  • Park, Eungyu
    • Economic and Environmental Geology
    • /
    • v.53 no.6
    • /
    • pp.703-713
    • /
    • 2020
  • In many geological fields, including hydrogeology, it is of great importance to determine the heterogeneity of the subsurface media. This study briefly introduces the concept and theory of the method that can estimate the hydraulic properties of the media constituting the aquifer, which was recently introduced by Park (2020). After the introduction, the method was applied to the synthetic aquifer to demonstrate the practicality, from which various implications were drawn. The introduced technique uses a global optimization technique called the covariance matrix adaptation evolution strategy (CMA-ES). Conceptually, it is a methodology to characterize the aquifer heterogeneity by assimilating the groundwater level time-series data due to the imposed hydraulic stress. As a result of applying the developed technique to estimate the hydraulic conductivity of a hypothetical aquifer, it was confirmed that a total of 40000 unknown values were estimated in an affordable computational time. In addition, the results of the estimates showed a close numerical and structural similarity to the reference hydraulic conductivity field, confirming that the quality of the estimation by the proposed method is high. In this study, the developed method was applied to a limited case, but it is expected that it can be applied to a wider variety of cases through additional development of the method. The development technique has the potential to be applied not only to the field of hydrogeology, but also to various fields of geology and geophysics. Further development of the method is currently underway.

Design of Heavy Rain Advisory Decision Model Based on Optimized RBFNNs Using KLAPS Reanalysis Data (KLAPS 재분석 자료를 이용한 진화최적화 RBFNNs 기반 호우특보 판별 모델 설계)

  • Kim, Hyun-Myung;Oh, Sung-Kwun;Lee, Yong-Hee
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.5
    • /
    • pp.473-478
    • /
    • 2013
  • In this paper, we develop the Heavy Rain Advisory Decision Model based on intelligent neuro-fuzzy algorithm RBFNNs by using KLAPS(Korea Local Analysis and Prediction System) Reanalysis data. the prediction ability of existing heavy rainfall forecasting systems is usually affected by the processing techniques of meteorological data. In this study, we introduce the heavy rain forecast method using the pre-processing techniques of meteorological data are in order to improve these drawbacks of conventional system. The pre-processing techniques of meteorological data are designed by using point conversion, cumulative precipitation generation, time series data processing and heavy rain warning extraction methods based on KLAPS data. Finally, the proposed system forecasts cumulative rainfall for six hours after future t(t=1,2,3) hours and offers information to determine heavy rain advisory. The essential parameters of the proposed model such as polynomial order, the number of rules, and fuzzification coefficient are optimized by means of Differential Evolution.

Adaptive Coefficients for Hopfield Neural Networks Solving Combinatorial Optimization Problems (최적화를 위한 홉필드 신경망의 적응적 신경계수 결정)

  • Chiyeon Park;Kuinam J. Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.113-120
    • /
    • 1998
  • 본 논문에서는 에너지 함수의 직접적인 평가에 기초해 홉필드 신경망을 진화시킴에 따라 적응적으로 에너지 계수를 결정하는 기법을 제시하고자 한다. 이 기법에 근거하여 구해지는 계수들의 효과를 검증하기 위해 응용 모델인 TSP(Traveling Salesman Problem)에 적용하여, 실험을 통한 계수 값의 변화 추이를 분석하고 그 결과를 기존의 기법들과 비교한다. 또한 제안된 방법에 필수적인 각 단계에서의 에너지 값의 평가를 위한 부가적인 연산을 줄이기 위해 단계적으로 증감분만을 계산하는 효율적인 연산법을 제시한다.

  • PDF

Evolutionary Multi-Objective Optimization Algorithms for Uniform Distributed Pareto Optimal Solutions (균일분포의 파레토 최적해 생성을 위한 다목적 최적화 진화 알고리즘)

  • Jang Su-Hyun;Yoon Byungjoo
    • The KIPS Transactions:PartB
    • /
    • v.11B no.7 s.96
    • /
    • pp.841-848
    • /
    • 2004
  • Evolutionary a1gorithms are well-suited for multi-objective optimization problems involving several, often conflicting objectives. Pareto-based evolutionary algorithms, in particular, have shown better performance than other multi-objective evolutionary algorithms in comparison. However, generalized evolutionary multi-objective optimization algorithms have a weak point, in which the distribution of solutions are not uni-formly distributed onto Pareto optimal front. In this paper, we propose an evolutionary a1gorithm for multi-objective optimization which uses seed individuals in order to overcome weakness of algorithms Published. Seed individual means a solution which is not located in the crowded region on Pareto front. And the idea of our algorithm uses seed individuals for reproducing individuals for next generation. Thus, proposed a1go-rithm takes advantage of local searching effect because new individuals are produced near the seed individual with high probability, and is able to produce comparatively uniform distributed pareto optimal solutions. Simulation results on five testbed problems show that the proposed algo-rithm could produce uniform distributed solutions onto pareto optimal front, and is able to show better convergence compared to NSGA-II on all testbed problems except multi-modal problem.

The Design of a Mobile Robot Path Planning using a Clustering method (클러스터링 기법을 이용한 모바일 로봇 경로계획 알고리즘 설계)

  • Kang, Won-Seok;Kim, Jin-Wook;Kim, Young-Duk;An, Jin-Ung;Lee, Dong-Ha
    • Proceedings of the KIEE Conference
    • /
    • 2008.10b
    • /
    • pp.341-342
    • /
    • 2008
  • GA(Genetic Algorithm)는 NP-Complete 도메인이나 NP-Hard 도메인 내의 문제들에 대해서 최적의 해를 찾기 위해서 많이 사용되어 지는 진화 컴퓨팅 방법 중 하나이다. 모바일 로봇 기술 중 경로계획은 NP-Complete 도메인 영역의 문제 중 하나로 이를 해결하기 위해서 Dijkstra 등의 그래프 이론을 이용한 연구가 많이 연구되었고 최근에는 GA등 진화 컴퓨팅 기법을 이용하여 최적의 경로를 찾는 연구가 많이 수행되고 있다. 그러나 모바일 로봇이 처리해야 될 공간 정보 크기가 증가함에 따라 기존 GA의 개체의 크기가 증가되어 게산 복잡도가 높아져 시간 지연등의 문제가 발생할 수 있다. 이는 모바일 로봇의 잠재적 오류로 발생될 수 있다. 공간 정보에는 동적이 장애물들이 예측 불허하게 나타 날 수 있는데 이것은 전역 경로 계획을 수립할 때 또한 반영되어야 된다. 본 논문에서는 k-means 클러스터링 기법을 이용하여 장애물 밀집도 및 거리 정보를 기반으로 공간정보를 k개의 군집 공간으로 재분류하여 이를 기반으로 N*M개의 그리드 개체 집단을 생성하여 최적 경로계획을 수립하는 GA를 제시한다.

  • PDF

Implementation of Evolving Neural Network Controller for Inverted Pendulum System (도립진자 시스템을 위한 진화형 신경회로망 제어기의 실현)

  • 심영진;김태우;최우진;이준탁
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.14 no.3
    • /
    • pp.68-76
    • /
    • 2000
  • The stabilization control of Inverted Pendulum(IP) system is difficult because of its nonlinearity and structural unstability. Futhermore, a series of conventional techniques such as the pole placement and the optimal control based on the local linearizations have narrow stabilizable regions. At the same time, the fine tunings of their gain parameters are also troublesome. Thus, in this paper, an Evolving Neural Network Controller(ENNC) which its structure and its connection weights are optimized simultaneously by Real Variable Elitist Genetic Algorithm(RVEGA) was presented for stabilization of an IP system with nonlinearity. This proposed ENNC was described by a simple genetic chromosome. And the deletion of neuron, the according to the various flag types. Therefore, the connection weights, its structure and the neuron types in the given ENNC can be optimized by the proposed evolution strategy. And the proposed ENNC was implemented successfully on the ADA-2310 data acquisition board and the 80586 microprocessor in order to stabilize the IP system. Through the simulation and experimental results, we showed that the finally acquired optimal ENNC was very useful in the stabilization control of IP system.

  • PDF

An Efficient Reengineering Process for Legacy System Evolution (레거시 시스템 진화를 위한 효율적 재공학 프로세스)

  • Choi, Il-Woo;Rhew, Sung-Yul
    • The KIPS Transactions:PartD
    • /
    • v.10D no.5
    • /
    • pp.845-858
    • /
    • 2003
  • The various software engineering techniques have been come out in order to cope with the software crisis since 1980's. These days the software Engineering has focused on the process of software development which is the guide for a qualify and productive improvement of software. But, most of the methodologies assume that a new system will be constructed and reused in the future. these do not support how we reuse legacy system's resources and construct a new system efficiently. In this paper, we present an efficient Reengineering Process for legacy system evolutions, RUP+re, which extends and customizes RUP. RUP+re consists of Reverse Engineering Workflow, Transformation Workflow and Evolution Workflow based on Small-h model. We describe RUP+re's workflows with their own detail steps and verify the process through the case study practivally. So, we provide efficient guidelines to the software Reengineering process construction which evolutes the resources of a legacy system.

Profile-Based Dynamic Service Binding for Evolution of Converged Services (융합 서비스의 진화를 위한 프로파일 기반 동적 서비스 바인딩 기술)

  • Kim, Kilhwan;Keum, Changsup;Bae, Hyun Joo
    • The Journal of Society for e-Business Studies
    • /
    • v.18 no.2
    • /
    • pp.27-46
    • /
    • 2013
  • To reduce time to market for converged services, the service provider needs to combine external services and internal processes together, and IT architecture for converged services has to support it. Service Oriented Architecture (SOA) enables the development of a converged service by combining external services and internal processes effectively. However, it is difficult for the existing SOA methods to support the evolution of a converged service, even though the service which consists of the converged service changes over time. In this paper, we argue that a method for profile-based dynamic service binding is required to support evolution of converged services. In order to identify requirements for the proposed method, a business scenario with a smart athletic equipment is given. We then present the concept and architecture of the method for profile-based dynamic service binding to meet the identified requirements. We also demonstrate a prototype implementation for evaluating the proposed method.

Effective Intrusion Detection using Evolutionary Neural Networks (진화신경망을 이용한 효과적 인 침입탐지)

  • Han Sang-Jun;Cho Sung-Bae
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.301-309
    • /
    • 2005
  • Learning program's behavior using machine learning techniques based on system call audit data is an effective intrusion detection method. Rule teaming, neural network, statistical technique, and hidden Markov model are representative methods for intrusion detection. Among them neural networks are known for its good performance in teaming system call sequences. In order to apply it to real world problems successfully, it is important to determine their structure. However, finding appropriate structure requires very long time because there are no formal solutions for determining the structure of networks. In this paper, a novel intrusion detection technique using evolutionary neural networks is proposed. Evolutionary neural networks have the advantage that superior neural networks can be obtained in shorter time than the conventional neural networks because it leams the structure and weights of neural network simultaneously Experimental results against 1999 DARPA IDEVAL data confirm that evolutionary neural networks are effective for intrusion detection.