• Title/Summary/Keyword: Genetic network

Search Result 1,136, Processing Time 0.027 seconds

Special Protection and Control Scheme for Transmission Line Overloading Elimination Based on Hybrid Differential Evolution/Electromagnetism-Like Algorithm

  • Hadi, Mahmood Khalid;Othman, Mohammad Lutfi;Wahab, Noor Izzri Abd
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.1729-1742
    • /
    • 2017
  • In designing System Protection Schemes (SPSs) in power systems, protecting transmission network against extreme undesired conditions becomes a significant challenge in mitigating the transmission line overloading. This paper presents an intelligent Special Protection and Control Scheme (SPCS) using of Differential Evolution with Adaptive Mutation (DEAM) approach to obtain the optimum generation rescheduling to solve the transmission line overloading problem in system contingency conditions. DEAM algorithm employs the attraction-repulsion idea that is applied in the electromagnetism-like algorithm to support the mutation process of the conventional Differential Evolution (DE) algorithm. Different N-1 contingency conditions under base and increase load demand are considered in this paper. Simulation results have been compared with those acquired from Genetic Algorithm (GA) application. Minimum severity index has been considered as the objective function. The final results show that the presented DEAM method offers better performance than GA in terms of faster convergence and less generation fuel cost. IEEE 30-bus test system has been used to prove the effectiveness and robustness of the proposed algorithm.

CTaG: An Innovative Approach for Optimizing Recovery Time in Cloud Environment

  • Hung, Pham Phuoc;Aazam, Mohammad;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1282-1301
    • /
    • 2015
  • Traditional infrastructure has been superseded by cloud computing, due to its cost-effective and ubiquitous computing model. Cloud computing not only brings multitude of opportunities, but it also bears some challenges. One of the key challenges it faces is recovery of computing nodes, when an Information Technology (IT) failure occurs. Since cloud computing mainly depends upon its nodes, physical servers, that makes it very crucial to recover a failed node in time and seamlessly, so that the customer gets an expected level of service. Work has already been done in this regard, but it has still proved to be trivial. In this study, we present a Cost-Time aware Genetic scheduling algorithm, referred to as CTaG, not only to globally optimize the performance of the cloud system, but also perform recovery of failed nodes efficiently. While modeling our work, we have particularly taken into account the factors of network bandwidth and customer's monetary cost. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results show performance gain of our work over the others, in some particular scenarios.

An Empirical Evaluation of Test Data Generation Techniques

  • Han, Seung-Hee;Kwon, Yong-Rae
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.3
    • /
    • pp.274-300
    • /
    • 2008
  • Software testing cost can be reduced if the process of testing is automated. However, the test data generation task is still performed mostly by hand although numerous theoretical works have been proposed to automate the process of generating test data and even commercial test data generators appeared on the market. Despite prolific research reports, few attempts have been made to evaluate and characterize those techniques. Therefore, a lot of works have been proposed to automate the process of generating test data. However, there is no overall evaluation and comparison of these techniques. Evaluation and comparison of existing techniques are useful for choosing appropriate approaches for particular applications, and also provide insights into the strengths and weaknesses of current methods. This paper conducts experiments on four representative test data generation techniques and discusses the experimental results. The results of the experiments show that the genetic algorithm (GA)-based test data generation performs the best. However, there are still some weaknesses in the GA-based method. Therefore, we modify the standard GA-based method to cope with these weaknesses. The experiments are carried out to compare the standard GA-based method and two modified versions of the GA-based method.

Sensorless Speed Control of Induction Motor using Am and FMRLC (ANN과 FMRLC를 이용한 유도전동기의 센서리스 속도제어)

  • Nam Su-Myeong;Lee Jung-Chul;Lee Hong-Gyun;Lee Young-Sil;Part Bung-Sang;Chung Dong-Hwa
    • Proceedings of the KIPE Conference
    • /
    • 2004.07a
    • /
    • pp.38-41
    • /
    • 2004
  • Artificial intelligence control that use Fuzzy, Neural network, genetic algorithm etc. in the speed control of induction motor recently is studied much. Also, sensors such as Encoder and Resolver are used to receive the speed of induction motor and information of position. However, this control method or sensor use receives much effects in surroundings environment change and react sensitively to parameter change of electric motor and control Performance drops. Presume the speed and position of induction motor by ANN in this treatise, and because using FMRLC that is consisted of two Fuzzy Logic, can correct Fuzzy Rule Base through teaming and save good response special quality in change of condition such as change of parameter.

  • PDF

High efficiency tracking system design of photovoltaic using fuzzy control (퍼지제어를 적용한 태양광 발전의 고효율 추적시스템 설계)

  • Ko, Jae-Sub;Choi, Jung-Sik;Jung, Chul-Ho;Kim, Do-Yon;Jung, Byung-Jin;Chung, Dong-Hwa
    • 한국태양에너지학회:학술대회논문집
    • /
    • 2008.04a
    • /
    • pp.61-67
    • /
    • 2008
  • In this paper proposed the solar tracking system to use a fuzzy based on PC in order to increase an output of the PV array. The solar tracking system operated two DC motors driving by signal of photo sensor. The control of dual axes is not an easy task due to nonlinear dynamics and unavailability of the parameters. Recently, artificial intelligent control of the fuzzy control, neural-network and genetic algorithm etc. have been studied. The fuzzy control made a nonlinear dynamics to well perform and had a robust and highly efficient characteristic about a parameter variable as well as a nonlinear characteristic. Hence the fuzzy control was used to perform the tracking system after comparing with error values of setting-up. nonlinear altitude and azimuth. In this paper designed a fuzzy controller for improving output of PV array and evaluated comparison with efficient of conventional PI controller. The data which were obtained by experiment were able to show a validity of the proposed controller.

  • PDF

A New Architecture of Genetically Optimized Self-Organizing Fuzzy Polynomial Neural Networks by Means of Information Granulation

  • Park, Ho-Sung;Oh, Sung-Kwun;Ahn, Tae-Chon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1505-1509
    • /
    • 2005
  • This paper introduces a new architecture of genetically optimized self-organizing fuzzy polynomial neural networks by means of information granulation. The conventional SOFPNNs developed so far are based on mechanisms of self-organization and evolutionary optimization. The augmented genetically optimized SOFPNN using Information Granulation (namely IG_gSOFPNN) results in a structurally and parametrically optimized model and comes with a higher level of flexibility in comparison to the one we encounter in the conventional FPNN. With the aid of the information granulation, we determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. The GA-based design procedure being applied at each layer of genetically optimized self-organizing fuzzy polynomial neural networks leads to the selection of preferred nodes with specific local characteristics (such as the number of input variables, the order of the polynomial, a collection of the specific subset of input variables, and the number of membership function) available within the network. To evaluate the performance of the IG_gSOFPNN, the model is experimented with using gas furnace process data. A comparative analysis shows that the proposed IG_gSOFPNN is model with higher accuracy as well as more superb predictive capability than intelligent models presented previously.

  • PDF

In Vivo Non Invasive Molecular Imaging for Immune Cell Tracking in Small Animals

  • Youn, Hyewon;Hong, Kee-Jong
    • IMMUNE NETWORK
    • /
    • v.12 no.6
    • /
    • pp.223-229
    • /
    • 2012
  • Clinical and preclinical in vivo immune cell imaging approaches have been used to study immune cell proliferation, apoptosis and interaction at the microscopic (intra-vital imaging) and macroscopic (whole-body imaging) level by use of ex vivo or in vivo labeling method. A series of imaging techniques ranging from non-radiation based techniques such as optical imaging, MRI, and ultrasound to radiation based CT/nuclear imaging can be used for in vivo immune cell tracking. These imaging modalities highlight the intrinsic behavior of different immune cell populations in physiological context. Fluorescent, radioactive or paramagnetic probes can be used in direct labeling protocols to monitor the specific cell population. Reporter genes can also be used for genetic, indirect labeling protocols to track the fate of a given cell subpopulation in vivo. In this review, we summarized several methods dealing with dendritic cell, macrophage, and T lymphocyte specifically labeled for different macroscopic whole-body imaging techniques both for the study of their physiological function and in the context of immunotherapy to exploit imaging-derived information and immune-based treatments.

Prediction model of plasma deposition process using genetic algorithm and generalized regression neural network (유전자 알고리즘과 일반화된 회귀신경망을 이용한 플라즈마 증착공정 예측모델)

  • Lee, Duk-Woo;Kim, Byung-Whan
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2004.07b
    • /
    • pp.1117-1120
    • /
    • 2004
  • 경제적인 공정분석과 최적화를 위해서는 컴퓨터를 이용한 플라즈마 예측모델이 요구되고 있다. 본 연구에서는 일반화된 회귀 신경망 (GRNN)을 이용하여 플라즈마 증착공정 모델을 개발한다. GRNN의 예측성능은 패턴층 뉴런의 가우시안 함수를 구성하는 학습인자, 즉 spread에 의존한다. 종래의 모델에서는 모든 가우시안 함수의 spread가 동일한 값에서 최적화되었으며, 이로 인해 모델의 예측성능을 향상시키는 데에는 한계가 있었다. 본 연구에서는 유전자 알고리즘 (GA)를 이용하여 다변수 spread를 최적화하는 기법을 개발하였으며, 그 성능을 PECVD 공정에 의해 증착된 SiN 박막의 증착률에 적용하여 평가하였다. $2^{6-1}$ 부분인자 실험계획법에 의해 수집된 데이터를 이용하여 신경망을 학습하였고, 모델적합성 점검을 위해 별도의 12번의 실험을 수행하였다. 가우시안 함수의 spread는 0.2에서 2.0까지 0.2간격으로 증가시켰으며, 최적화한 GA-GRNN모델의 예측성능은 6.6 ${\AA}/min$이었다. 이는 종래의 방식으로 최적화한 모델의 예측성능 (13.5 ${\AA}/min$)과 비교하여 50.7% 향상된 예측성능이며, 이러한 향상은 제안한 GA-GRNN 모델이 플라즈마 공정 모델의 예측성능을 증진하는데 매우 효과적임을 보여준다.

  • PDF

Recursive compensation algorithm application to the optimal edge selection

  • Chung, C.H.;Lee, K.S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.79-84
    • /
    • 1992
  • Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

  • PDF

A New Multi-objective Evolutionary Algorithm for Inter-Cloud Service Composition

  • Liu, Li;Gu, Shuxian;Fu, Dongmei;Zhang, Miao;Buyya, Rajkumar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.1-20
    • /
    • 2018
  • Service composition in the Inter-Cloud raises new challenges that are caused by the different Quality of Service (QoS) requirements of the users, which are served by different geo-distributed Cloud providers. This paper aims to explore how to select and compose such services while considering how to reach high efficiency on cost and response time, low network latency, and high reliability across multiple Cloud providers. A new hybrid multi-objective evolutionary algorithm to perform the above task called LS-NSGA-II-DE is proposed, in which the differential evolution (DE) algorithm uses the adaptive mutation operator and crossover operator to replace the those of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to get the better convergence and diversity. At the same time, a Local Search (LS) method is performed for the Non-dominated solution set F{1} in each generation to improve the distribution of the F{1}. The simulation results show that our proposed algorithm performs well in terms of the solution distribution and convergence, and in addition, the optimality ability and scalability are better compared with those of the other algorithms.