• Title/Summary/Keyword: Genetic Approach

Search Result 1,327, Processing Time 0.023 seconds

An ADHD Diagnostic Approach Based on Binary-Coded Genetic Algorithm and Extreme Learning Machine

  • Sachnev, Vasily;Suresh, Sundaram
    • Journal of Computing Science and Engineering
    • /
    • v.10 no.4
    • /
    • pp.111-117
    • /
    • 2016
  • An accurate approach for diagnosis of attention deficit hyperactivity disorder (ADHD) is presented in this paper. The presented technique efficiently classifies three subtypes of ADHD (ADHD-C, ADHD-H, ADHD-I) and typically developing control (TDC) by using only structural magnetic resonance imaging (MRI). The research examines structural MRI of the hippocampus from the ADHD-200 database. Each available MRI has been processed by a region-of-interest (ROI) to build a set of features for further analysis. The presented ADHD diagnostic approach unifies feature selection and classification techniques. The feature selection technique based on the proposed binary-coded genetic algorithm searches for an optimal subset of features extracted from the hippocampus. The classification technique uses a chosen optimal subset of features for accurate classification of three subtypes of ADHD and TDC. In this study, the famous Extreme Learning Machine is used as a classification technique. Experimental results clearly indicate that the presented BCGA-ELM (binary-coded genetic algorithm coupled with Extreme Learning Machine) efficiently classifies TDC and three subtypes of ADHD and outperforms existing techniques.

Individual Identification and Breed Allocation with Microsatellite Markers: An Evaluation in Indian Horses

  • Behl, Rahul;Behl, Jyotsna;Gupta, Neelam;Gupta, S.C.;Ahlawat, S.P.S.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.20 no.1
    • /
    • pp.25-30
    • /
    • 2007
  • The capability of microsatellite markers for individual identification and their potential for breed assignment of individuals was evaluated in two Indian horse breeds. The strength of these individual assignment methods was also evaluated by increasing the number of loci in increments of five. The probability of identity of two random horses from the two breeds at all twenty five studied loci was as low as $1.08{\times}10^{-32}$ showing their suitability to distinguish between individual horses and their products. In the phylogenetic approach for individual assignment using Nei's genetic distances, 10.81% of horses associated with breed other than the major cluster of the source breed horses when all twenty five microsatellite loci were implemented. Similar results were obtained when the maximum likelihood approach for individual assignment was used. Based on these results it is proposed that, although microsatellite markers may prove very useful for individual identification, their utility for breed assignment of horses needs further evaluation.

Parametric identification of the Bouc-Wen model by a modified genetic algorithm: Application to evaluation of metallic dampers

  • Shu, Ganping;Li, Zongjing
    • Earthquakes and Structures
    • /
    • v.13 no.4
    • /
    • pp.397-407
    • /
    • 2017
  • With the growing demand for metallic dampers in engineering practice, it is urgent to establish a reasonable approach to evaluating the mechanical performance of metallic dampers under seismic excitations. This paper introduces an effective method for parameter identification of the modified Bouc-Wen model and its application to evaluating the fatigue performance of metallic dampers (MDs). The modified Bouc-Wen model which eliminates the redundant parameter is used to describe the hysteresis behavior of MDs. Relations between the parameters of the modified Bouc-Wen model and the mechanical performance parameters of MDs are studied first. A modified Genetic Algorithm using real-integer hybrid coding with relative fitness as well as adaptive crossover and mutation rates (called RFAGA) is then proposed to identify the parameters of the modified Bouc-Wen model. A reliable approach to evaluating the fatigue performance of the MDs with respect to the Chinese Code for Seismic Design of Buildings (GB 50011-2010) is finally proposed based on the research results. Experimental data are employed to demonstrate the process and verify the effectiveness of the proposed approach. It is shown that the RFAGA is able to converge quickly in the identification process, and the simulation curves based on the identification results fit well with the experimental hysteresis curves. Furthermore, the proposed approach is shown to be a useful tool for evaluating the fatigue performance of MDs with respect to the Chinese Code for Seismic Design of Buildings (GB 50011-2010).

A Systematic Engineering Approach to Design the Controller of the Advanced Power Reactor 1400 Feedwater Control System using a Genetic Algorithm

  • Tran, Thanh Cong;Jung, Jae Cheon
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.14 no.2
    • /
    • pp.58-66
    • /
    • 2018
  • This paper represents a systematic approach aimed at improving the performance of the proportional integral (PI) controller for the Advanced Power Reactor (APR) 1400 Feedwater Control System (FWCS). When the performance of the PI controller offers superior control and enhanced robustness, the steam generator (SG) level is properly controlled. This leads to the safe operation and increased the availability of the nuclear power plant. In this paper, a systems engineering approach is used in order to design a novel PI controller for the FWCS. In the reverse engineering stage, the existing FWCS configuration, especially the characteristics of the feedwater controller as well as the feedwater flow path to each SG from the FWCS, were reviewed and analysed. The overall block diagram of the FWCS and the SG was also developed in the reverse engineering process. In the re-engineering stage, the actual design of the feedwater PI controller was carried out using a genetic algorithm (GA). Lastly, in the validation and verification phase, the existing PI controller and the PI controller designed using GA method were simulated in Simulink/Matlab. From the simulation results, the GA-PI controller was found to exhibit greater stability than the current controller of the FWCS.

XML-based Portable Self-containing Representation of Strongly-typed Genetic Program (XML 기반 강건 타입형 유전자 프로그램의 이식${\cdot}$독립적 표현)

  • Lee Seung-Ik;Tanev Ivan;Shimohara Katsunori
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.277-289
    • /
    • 2005
  • To overcome the long design time/high computational effort/low computational performance of phylogenetic learning featuring selection and reproduction, this paper proposes a genetic representation based on XML. Since genetic programs (GP) and genetic operations of this representation are maintained by the invocation of the built-in off-the-shelf XML parser's API, the proposed approach features significant reduced time consumption of GP design process. Handling only semantically correct GPs with standard XML schema can reduce search space and computational effort. Furthermore, computational performance can be improved by the parallelism of GP caused by the utilization of XML, which is a feasible system and wire format for migration of genetic programs in heterogeneous distributed computer environments. To verify the proposed approach, it is applied to the evolution of social behaviors of multiple agents modeling the predator-prey pursuit problem. The results show that the approach can be applied for fast development and time efficiency of GPs.

Hybrid Genetic Algorithm Approach using Closed-Loop Supply Chain Model (폐쇄루프 공급망 모델을 이용한 혼합형유전알고리즘 접근법)

  • Yun, YoungSu;Anudari, Chuluunsukh;Chen, Xing
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.21 no.4
    • /
    • pp.31-41
    • /
    • 2016
  • This paper is to evaluate the performance of a proposed hybrid genetic algorithm (pro-HGA) approach using closed-loop supply chain (CLSC) model. The proposed CLSC model is a integrated supply chain network model both with forward logistics and reverse logistics. In the proposed CLSC model, the reuse, resale and waste disposal using the returned products are taken into consideration. For implementing the proposed CLSC model, two conventional approaches and the pro-HGA are used in numerical experiment and their performances are compared with each other using various measures of performance. The experimental results show that the pro-HGA approach is more efficient in locating optimal solution than the other competing approaches.

Machining Route Selection and Determination of Input Quantity with Yield Using Genetic Algorithm (장비 수율을 고려한 가공경로선정과 투입량 결정에서의 유전알고리즘 접근)

  • Lee Kyuyong
    • Proceedings of the Society of Korea Industrial and System Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.99-104
    • /
    • 2002
  • This paper addresses a problem of machining route selection and determination of input quantity with yield in multi-stage flexible flow system. The problem is formulated as nonlinear programing and the proposed model is solved by genetic algorithm(GA) approach. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound for the same problem.

  • PDF

An Analytical Approach to Sire-by-Year Interactions in Direct and Maternal Genetic Evaluation

  • Lee, C.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.11 no.4
    • /
    • pp.441-444
    • /
    • 1998
  • The negative direct-maternal genetic correlation $(r_{dm})$ for weaning weight is inflated when data are analyzed with model ignoring sire-by-year interactions (SY). An analytical study investigating the consequences of ignoring SY was undertaken. The inflation of negative correlation could be due to a functional relationship of design matrices for additive direct and maternal genetic effects to that for sire effects within which SY effects were nested. It was proven that the maternal genetic variance was inflated by the amount of reduction for sire variance; the direct genetic variance was inflated by four times the change for maternal genetic variance; and the direct-maternal genetic covariance was deflated by twice the change for maternal genetic variance. The findings were agreed to the results in previous studies.

A Genetic Algorithm-based Scheduling Method for Job Shop Scheduling Problem (유전알고리즘에 기반한 Job Shop 일정계획 기법)

  • 박병주;최형림;김현수
    • Korean Management Science Review
    • /
    • v.20 no.1
    • /
    • pp.51-64
    • /
    • 2003
  • The JSSP (Job Shop Scheduling Problem) Is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. we design scheduling method based on SGA (Single Genetic Algorithm) and PGA (Parallel Genetic Algorithm). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling method based on genetic algorithm are tested on five standard benchmark JSSPs. The results were compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution. The superior results indicate the successful Incorporation of generating method of initial population into the genetic operators.

Designing New Algorithms Using Genetic Programming

  • Kim, Jin-Hwa
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2004.11a
    • /
    • pp.171-178
    • /
    • 2004
  • This study suggests a general paradigm enhancing genetic mutability. Mutability among heterogeneous members in a genetic population has been a major problem in application of genetic programming to diverse business problems. This suggested paradigm is implemented to developing new methods from existing methods. Within the evolutionary approach taken to designing new methods, a general representation scheme of the genetic programming framework, called a kernel, is introduced. The kernel is derived from the literature of algorithms and heuristics for combinatorial optimization problems. The commonality and differences among these methods have been identified and again combined by following the genetic inheritance merging them. The kernel was tested for selected methods in combinatorial optimization. It not only duplicates the methods in the literature, it also confirms that each of the possible solutions from the genetic mutation is in a valid form, a running program. This evolutionary method suggests diverse hybrid methods in the form of complete programs through evolutionary processes. It finally summarizes its findings from genetic simulation with insight.

  • PDF