Science.gov

Sample records for algorithm genetic algorithm

  1. Genetic algorithms

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  2. R. D. Field TU Talk Genetic AlgorithmsGenetic Algorithms

    E-print Network

    Field, Richard

    ): 路 Very Slow! Genetic Algorithms (model of genetics & evolution): 路 Combine the good features of both y yR. D. Field TU Talk Genetic AlgorithmsGenetic Algorithms andand Neural NetworksNeural Networks asas genetics and evolution (Genetic Algorithms). 路 Show an example of the use of a genetic algorithm

  3. Genetic algorithm eclipse mapping

    E-print Network

    A. V. Halevin

    2008-01-21

    In this paper we analyse capabilities of eclipse mapping technique, based on genetic algorithm optimization. To model of accretion disk we used the "fire-flies" conception. This model allows us to reconstruct the distribution of radiating medium in the disk using less number of free parameters than in other methods. Test models show that we can achieve good approximation without optimizing techniques.

  4. Genetic Algorithms and Local Search

    NASA Technical Reports Server (NTRS)

    Whitley, Darrell

    1996-01-01

    The first part of this presentation is a tutorial level introduction to the principles of genetic search and models of simple genetic algorithms. The second half covers the combination of genetic algorithms with local search methods to produce hybrid genetic algorithms. Hybrid algorithms can be modeled within the existing theoretical framework developed for simple genetic algorithms. An application of a hybrid to geometric model matching is given. The hybrid algorithm yields results that improve on the current state-of-the-art for this problem.

  5. A Genetic Algorithm Tutorial Darrell Whitley

    E-print Network

    Potter, Don

    A Genetic Algorithm Tutorial Darrell Whitley Computer Science Department, Colorado State University algorithm as well as more experimental formsof genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search by hyperplane sampling

  6. A Genetic Algorithm Tutorial Darrell Whitley

    E-print Network

    Whitley, Darrell

    A Genetic Algorithm Tutorial Darrell Whitley Computer Science Department, Colorado State University algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search by hyperplane sampling

  7. A Process Algebra Genetic Algorithm

    E-print Network

    Karaman, Sertac

    A genetic algorithm that utilizes process algebra for coding of solution chromosomes and for defining evolutionary based operators is presented. The algorithm is applicable to mission planning and optimization problems. ...

  8. Scheduling Using Genetic Algorithms Ursula Fissgus

    E-print Network

    Scheduling Using Genetic Algorithms Ursula Fissgus Computer Science Department University Halle memory machine. We present a scheduling derivation step based on the genetic algorithm paradigm, data parallelism, genetic algorithms. 1 Introduction Several applications from scientific computing, e

  9. Elegance: Genetic Algorithms in Neural Reinforcement Control

    E-print Network

    Spronck, Pieter

    Elegance: Genetic Algorithms in Neural Reinforcement Control Pieter Spronck Graduation committee: Genetic Algorithms in Neural Reinforcement Control. Graduation thesis (Master's degree). Delft University intelligence, genetic algorithms, neural control, neural networks, non-linear systems, reinforcement control

  10. Messy genetic algorithms: Recent developments

    SciTech Connect

    Kargupta, H.

    1996-09-01

    Messy genetic algorithms define a rare class of algorithms that realize the need for detecting appropriate relations among members of the search domain in optimization. This paper reviews earlier works in messy genetic algorithms and describes some recent developments. It also describes the gene expression messy GA (GEMGA)--an {Omicron}({Lambda}{sup {kappa}}({ell}{sup 2} + {kappa})) sample complexity algorithm for the class of order-{kappa} delineable problems (problems that can be solved by considering no higher than order-{kappa} relations) of size {ell} and alphabet size {Lambda}. Experimental results are presented to demonstrate the scalability of the GEMGA.

  11. Scheduling with genetic algorithms

    NASA Technical Reports Server (NTRS)

    Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.

    1994-01-01

    In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

  12. Genetic algorithms as discovery programs

    SciTech Connect

    Hilliard, M.R.; Liepins, G.

    1986-01-01

    Genetic algorithms are mathematical counterparts to natural selection and gene recombination. As such, they have provided one of the few significant breakthroughs in machine learning. Used with appropriate reward functions and apportionment of credit, they have been successfully applied to gas pipeline operation, x-ray registration and mathematical optimization problems. This paper discusses the basics of genetic algorithms, describes a few successes, and reports on current progress at Oak Ridge National Laboratory in applications to set covering and simulated robots.

  13. Scheduling Jobs with Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Ferrolho, Ant髇io; Cris髎tomo, Manuel

    Most scheduling problems are NP-hard, the time required to solve the problem optimally increases exponentially with the size of the problem. Scheduling problems have important applications, and a number of heuristic algorithms have been proposed to determine relatively good solutions in polynomial time. Recently, genetic algorithms (GA) are successfully used to solve scheduling problems, as shown by the growing numbers of papers. GA are known as one of the most efficient algorithms for solving scheduling problems. But, when a GA is applied to scheduling problems various crossovers and mutations operators can be applicable. This paper presents and examines a new concept of genetic operators for scheduling problems. A software tool called hybrid and flexible genetic algorithm (HybFlexGA) was developed to examine the performance of various crossover and mutation operators by computing simulations of job scheduling problems.

  14. On the Scalability of Simple Genetic Algorithms

    E-print Network

    Utrecht, Universiteit

    On the Scalability of Simple Genetic Algorithms Dirk Thierens Department of Computer Science of competent genetic algorithms once the scalability problems of simple genetic algorithms were understood of simple genetic algorithms. Particularly, we discuss the important issue of building block mixing and show

  15. 9. Genetic Algorithms 9.1 Introduction

    E-print Network

    Cambridge, University of

    66 9. Genetic Algorithms 9.1 Introduction The concept of evolution is prevalent in most biological to computational optimisation methods using "genetic algorithms" [50]. 9.2 Neural Networks and Genetic Algorithms.1) with the function f being non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem

  16. PROCESS PER PROCESSOR ALLOCATION USING GENETIC ALGORITHMS

    E-print Network

    Cirstea, Horatiu

    PROCESS PER PROCESSOR ALLOCATION USING GENETIC ALGORITHMS PROF. NICOLAE TAPUS, HORATIU CIRSTEA Keywords: mapping problem, genetic algorithms This paper addresses an application of genetic algorithms be applied in real situations. To speed up the search we can use heuristics (genetic algorithms, simulated

  17. Statistical Algorithms in Population Genetics

    E-print Network

    Statistical Algorithms in Population Genetics Adam Pershan #12;The General Story #12;Goal: to infer=pubmed #12;Solutions 路 Many use Hidden Markov Models (HMM) 路 A Markov Process is "memory- less" 路 A Hidden of HMM #12;HMM in population genetics 路 Ancestry is the hidden state 路 Work backwards from "child" genome

  18. Hyperplane Ranking in Simple Genetic Algorithms

    E-print Network

    Whitley, Darrell

    Hyperplane Ranking in Simple Genetic Algorithms D. Whitley, K. Mathias, and L. Pyeatt Department of a function. We show that the degree of dynamic ranking induced by a simple genetic algorithm is highly cor algorithms by developing a theory of how genetic algorithms process hyperplanes repre sented by schemata

  19. Category: Genetic Algorithms Comparing Performance of the

    E-print Network

    Michalski, Ryszard S.

    Category: Genetic Algorithms Comparing Performance of the Learnable Evolution Model and Genetic: Genetic Algorithms, Symbolic Learning, AQ18, Lamarckian Evolution, Learnable Evolution Model, Function performance with that of two canonical genetic algorithms, GA1 and GA2. The LEM method integrates symbolic

  20. Modeling Hybrid Genetic Algorithms Darrell Whitley

    E-print Network

    Whitley, Darrell

    Modeling Hybrid Genetic Algorithms Darrell Whitley Computer Science Department, Colorado State University, Fort Collins, CO 80523 whitley@cs.colostate.edu 1 INTRODUCTION A ``hybrid genetic algorithm'' combines local search with a more traditional genetic algorithm. The most common form of hybrid genetic

  1. Simultaneous stabilization using genetic algorithms

    SciTech Connect

    Benson, R.W.; Schmitendorf, W.E. . Dept. of Mechanical Engineering)

    1991-01-01

    This paper considers the problem of simultaneously stabilizing a set of plants using full state feedback. The problem is converted to a simple optimization problem which is solved by a genetic algorithm. Several examples demonstrate the utility of this method. 14 refs., 8 figs.

  2. Genetic Algorithms for Simultaneous Equation

    E-print Network

    Gim茅nez, Domingo

    chromosome c and the set of variables Y and X 2. SOLVE the system 3. COMPUTE the error between the variables Genetic Algorithms for selecting the best SEM Defining a valid chromosome Initialization and EndConditions Evaluating a chromosome Crossover Mutation Random Search Experimental results Conclusions and future works

  3. Genetic Algorithms and Critical Phenomena

    E-print Network

    A. Barra耋n; J. A. L髉ez; C. O. Dorso

    2003-02-02

    Genetic algorithms based on natural selection and minimal fluctuations have been applied to model physical and biological systems. Critical exponents have been extracted via computational simulations of nucleation for colossal magnetoresistance, heavy ions liquid-gas phase transitions and HIV to AIDS transition.

  4. Genetic algorithm optimization of entanglement

    E-print Network

    Jorge C. Navarro-Munoz; H. C. Rosu; R. Lopez-Sandoval

    2006-11-13

    We present an application of a genetic algorithmic computational method to the optimization of the concurrence measure of entanglement for the cases of one dimensional chains, as well as square and triangular lattices in a simple tight-binding approach in which the hopping of electrons is much stronger than the phonon dissipation

  5. Genetic Algorithm for Optimization: Preprocessor and Algorithm

    NASA Technical Reports Server (NTRS)

    Sen, S. K.; Shaykhian, Gholam A.

    2006-01-01

    Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.

  6. SEARCH ENGINE TUNING WITH GENETIC ALGORITHMS Jeffrey Kyle Elser

    E-print Network

    Dyer, Bill

    SEARCH ENGINE TUNING WITH GENETIC ALGORITHMS by Jeffrey Kyle Elser A project submitted in partial ........................................................................................................9 Genetic Algorithms Background....................................................................................................................14 Genetic Algorithm Configuration

  7. L. D. Davis, Handbook of Genetic Algorithms.

    E-print Network

    Mitchell, Melanie

    of Genetic Algorithms, is squarely in the engineering camp. Davis, formally of Bolt, Beranek, and Newman, IncReview of L. D. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991 scientists for at least four decades. Genetic algorithms (GAs), invented by John Holland in the 1960s

  8. Genetic Algorithms and Evolutionary Darrell Whitley

    E-print Network

    Whitley, Darrell

    Genetic Algorithms and Evolutionary Computing Darrell Whitley Computer Science Department, Colorado State University Fort Collins, CO 80523 whitley@cs.colostate.edu 1 Introduction Genetic Algorithms are a family of computational models inspired by evolution. Other genetic and evolutionary algorithms include

  9. Contemporary Mathematics Whitehead Method and Genetic Algorithms

    E-print Network

    Miasnikov, Alexei

    Contemporary Mathematics Whitehead Method and Genetic Algorithms Alexei D. Miasnikov and Alexei G. Myasnikov Abstract. In this paper we discuss a genetic version (GWA) of Whitehead Algorithm, which is one 2. Whitehead method 2 3. Description of the genetic algorithm 8 4. Experiments and results 13 5

  10. Contemporary Mathematics Whitehead Method and Genetic Algorithms

    E-print Network

    Myasnikov, Aleksey

    Contemporary Mathematics Whitehead Method and Genetic Algorithms Alexei D. Miasnikov and Alexei G. Myasnikov Abstract. In this paper we discuss a genetic version (GWA) of Whitehead Algorithm, which is one 2. Whitehead method 90 3. Description of the genetic algorithm 96 4. Experiments and results 101 5

  11. A Review of Models for Simple Genetic Algorithms and Cellular Genetic Algorithms

    E-print Network

    Whitley, Darrell

    A Review of Models for Simple Genetic Algorithms and Cellular Genetic Algorithms Darrell Whitley to better understand these phenomena. In this paper different exact models for the simple genetic algorithm@cs.colostate.edu 1 Introduction Genetic algorithms employ a form of simulated evolution to solve difficult

  12. SURVEY OF GENETIC ALGORITHMS AND GENETIC PROGRAMMING John R. Koza

    E-print Network

    Fernandez, Thomas

    SURVEY OF GENETIC ALGORITHMS AND GENETIC PROGRAMMING John R. Koza Computer Science Department://www-cs-faculty.stanford.edu/~koza/ ABSTRACT This paper provides an introduction to genetic algorithms and genetic programming and lists that is available over the Internet. 1. GENETIC ALGORITHMS John Holland's pioneering book Adaptation in Natural

  13. Learning Intelligent Genetic Algorithms Using Japanese Nonograms

    ERIC Educational Resources Information Center

    Tsai, Jinn-Tsong; Chou, Ping-Yi; Fang, Jia-Cen

    2012-01-01

    An intelligent genetic algorithm (IGA) is proposed to solve Japanese nonograms and is used as a method in a university course to learn evolutionary algorithms. The IGA combines the global exploration capabilities of a canonical genetic algorithm (CGA) with effective condensed encoding, improved fitness function, and modified crossover and

  14. New Results in Astrodynamics Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Coverstone-Carroll, V.; Hartmann, J. W.; Williams, S. N.; Mason, W. J.

    1998-01-01

    Generic algorithms have gained popularity as an effective procedure for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a brief survey of the use of genetic algorithms to solve astrodynamics problems is presented and is followed by new results obtained from applying a Pareto genetic algorithm to the optimization of low-thrust interplanetary spacecraft missions.

  15. Excursion-Set-Mediated Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Noever, David; Baskaran, Subbiah

    1995-01-01

    Excursion-set-mediated genetic algorithm (ESMGA) is embodiment of method of searching for and optimizing computerized mathematical models. Incorporates powerful search and optimization techniques based on concepts analogous to natural selection and laws of genetics. In comparison with other genetic algorithms, this one achieves stronger condition for implicit parallelism. Includes three stages of operations in each cycle, analogous to biological generation.

  16. Filter selection using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Patel, Devesh

    1996-03-01

    Convolution operators act as matched filters for certain types of variations found in images and have been extensively used in the analysis of images. However, filtering through a bank of N filters generates N filtered images, consequently increasing the amount of data considerably. Moreover, not all these filters have the same discriminatory capabilities for the individual images, thus making the task of any classifier difficult. In this paper, we use genetic algorithms to select a subset of relevant filters. Genetic algorithms represent a class of adaptive search techniques where the processes are similar to natural selection of biological evolution. The steady state model (GENITOR) has been used in this paper. The reduction of filters improves the performance of the classifier (which in this paper is the multi-layer perceptron neural network) and furthermore reduces the computational requirement. In this study we use the Laws filters which were proposed for the analysis of texture images. Our aim is to recognize the different textures on the images using the reduced filter set.

  17. Floating Entanglement Witness Measure and Genetic Algorithm

    E-print Network

    A. Baghbanpourasl; G. Najarbashi; M. Seyedkazemi

    2007-08-27

    In this paper based on the notion of entanglement witness, a new measure of entanglement called floating entanglement witness measure is introduced which satisfies some of the usual properties of a good entanglement measure. By exploiting genetic algorithm, we introduce a classical algorithm that computes floating entanglement witness measure. This algorithm also provides a method for finding entanglement witness for a given entangled state.

  18. A Directed Mutation Operator for Real Coded Genetic Algorithms

    E-print Network

    Yang, Shengxiang

    A Directed Mutation Operator for Real Coded Genetic Algorithms Imtiaz Korejo, Shengxiang Yang- esting research topic to improve the performance of genetic algorithms (GAs) for function optimization Genetic algorithms (GAs) are a class of probabilistic optimization techniques inspired by genetic

  19. Biomimetic use of genetic algorithms

    E-print Network

    Dessalles, Jean-Louis

    2011-01-01

    Genetic algorithms are considered as an original way to solve problems, probably because of their generality and of their "blind" nature. But GAs are also unusual since the features of many implementations (among all that could be thought of) are principally led by the biological metaphor, while efficiency measurements intervene only afterwards. We propose here to examine the relevance of these biomimetic aspects, by pointing out some fundamental similarities and divergences between GAs and the genome of living beings shaped by natural selection. One of the main differences comes from the fact that GAs rely principally on the so-called implicit parallelism, while giving to the mutation/selection mechanism the second role. Such differences could suggest new ways of employing GAs on complex problems, using complex codings and starting from nearly homogeneous populations.

  20. Dynamic Programming Algorithm vs. Genetic Algorithm: Which is Faster?

    NASA Astrophysics Data System (ADS)

    Petkovi?, Du歛n

    The article compares two different approaches for the optimization problem of large join queries (LJQs). Almost all commercial database systems use a form of the dynamic programming algorithm to solve the ordering of join operations for large join queries, i.e. joins with more than dozen join operations. The property of the dynamic programming algorithm is that the execution time increases significantly in the case, where the number of join operations in a query is large. Genetic algorithms (GAs), as a data mining technique, have been shown as a promising technique in solving the ordering of join operations in LJQs. Using the existing implementation of GA, we compare the dynamic programming algorithm implemented in commercial database systems with the corresponding GA module. Our results show that the use of a genetic algorithm is a better solution for optimization of large join queries, i.e., that such a technique outperforms the implementations of the dynamic programming algorithm in conventional query optimization components for very large join queries.

  1. Genetic algorithm dynamics on a rugged landscape

    NASA Astrophysics Data System (ADS)

    Bornholdt, Stefan

    1998-04-01

    The genetic algorithm is an optimization procedure motivated by biological evolution and is successfully applied to optimization problems in different areas. A statistical mechanics model for its dynamics is proposed based on the parent-child fitness correlation of the genetic operators, making it applicable to general fitness landscapes. It is compared to a recent model based on a maximum entropy ansatz. Finally it is applied to modeling the dynamics of a genetic algorithm on the rugged fitness landscape of the NK model.

  2. An Algorithmic Chemistry for Genetic Programming

    E-print Network

    Fernandez, Thomas

    An Algorithmic Chemistry for Genetic Programming Christian W.G. Lasarczyk1 and Wolfgang Banzhaf2, 1 discuss a new method of execution of programs introduced recently: Algorithmic Chemistries. Therein of this type can be seen as artificial chemistries, where instructions interact with each other (by taking

  3. Genetic algorithms and the immune system

    SciTech Connect

    Forrest, S. . Dept. of Computer Science); Perelson, A.S. )

    1990-01-01

    Using genetic algorithm techniques we introduce a model to examine the hypothesis that antibody and T cell receptor genes evolved so as to encode the information needed to recognize schemas that characterize common pathogens. We have implemented the algorithm on the Connection Machine for 16,384 64-bit antigens and 512 64-bit antibodies. 8 refs.

  4. An introduction to genetic algorithms for neural networks

    E-print Network

    Cambridge, University of

    An introduction to genetic algorithms for neural networks Richard Kemp 1 Introduction Once a neural can use a genetic algorithm to try and solve the problem. What are genetic algorithms? Genetic algorithms (GAs) are search algo- rithms based on the mechanics of natural selection and genetics as observed

  5. Genetic algorithms at UC Davis/LLNL

    SciTech Connect

    Vemuri, V.R.

    1993-12-31

    A tutorial introduction to genetic algorithms is given. This brief tutorial should serve the purpose of introducing the subject to the novice. The tutorial is followed by a brief commentary on the term project reports that follow.

  6. A Distributed Pool Architecture for Genetic Algorithms

    E-print Network

    Roy, Gautam

    2011-02-22

    The genetic algorithm paradigm is a well-known heuristic for solving many problems in science and engineering in which candidate solutions, or 搃ndividuals, are manipulated in ways analogous to biological evolution, to ...

  7. Genetic Algorithms and Supernovae Type Ia Analysis

    E-print Network

    C. Bogdanos; Savvas Nesseris

    2009-06-29

    We introduce genetic algorithms as a means to analyze supernovae type Ia data and extract model-independent constraints on the evolution of the Dark Energy equation of state. Specifically, we will give a brief introduction to the genetic algorithms along with some simple examples to illustrate their advantages and finally we will apply them to the supernovae type Ia data. We find that genetic algorithms can lead to results in line with already established parametric and non-parametric reconstruction methods and could be used as a complementary way of treating SnIa data. As a non-parametric method, genetic algorithms provide a model-independent way to analyze data and can minimize bias due to premature choice of a dark energy model.

  8. Genetic algorithm based tomographic flow visualization

    E-print Network

    Lyons, Donald Paul

    1997-01-01

    A new nonlinear tomographic flow visualization technique for use in limited data situations is developed using techniques from the emerging field of evolutionary computing. The new technique uses both pure and hybrid genetic algorithms from...

  9. Genetic algorithms as global random search methods

    NASA Technical Reports Server (NTRS)

    Peck, Charles C.; Dhawan, Atam P.

    1995-01-01

    Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

  10. Genetic algorithms as global random search methods

    NASA Technical Reports Server (NTRS)

    Peck, Charles C.; Dhawan, Atam P.

    1995-01-01

    Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that that schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solution and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

  11. A lowerbound result on the power of a genetic algorithm

    E-print Network

    A lower璪ound result on the power of a genetic algorithm Kihong Park \\Lambda park@cs.bu.edu BU This paper presents a lower璪ound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove

  12. Artificial Neural Networks Lab 6A Genetic Algorithms

    E-print Network

    Duckett, Tom

    Artificial Neural Networks Lab 6A Genetic Algorithms Purpose To study how a genetic algorithm can carefully before starting to solve it. Preparation Read the hand-out on genetic algorithms. Task 1, Implementation of a genetic algorithm In this task you have to solve a hard global optimization problem by using

  13. An Evaluation of Local Improvement Operators Genetic Algorithms

    E-print Network

    Miller, John A.

    An Evaluation of Local Improvement Operators for Genetic Algorithms John A. Miller+#, Walter D Programs University of Georgia Athens, GA 30602 Abstract Genetic algorithms have demonstrated considerable algorithms such as the genetic algorithm must be used in practice. In this paper, we apply the genetic

  14. Genetic Algorithms To provide a background and understanding of basic genetic

    E-print Network

    Qu, Rong

    Genetic Algorithms Objectives To provide a background and understanding of basic genetic algorithms and some of their applications. 穉 basic genetic algorithm 穞he basic discussion 穞he applications of the algorithm #12;Genetic Algorithms 1859 Origin of the Species Survival of the Fittest #12;Genetic Algorithms

  15. Genetic algorithms applied to optics and engineering

    NASA Astrophysics Data System (ADS)

    Cuevas, Francisco; Gonzalez, Otoniel; Susuki, Yamily; Hernandez, Daniel; Rocha, Martha; Alcala, No

    2006-02-01

    In the last years, Soft computing techniques, such as Genetic Algorithms, Neural Networks and Fuzzy systems, have been applied in different science areas. In this work, two applications of Genetic Algorithms in engineering and optics are presented. The Genetic Algorithms are optimization, search and learning machine techniques, which work in a random way. To achieve the problem solution by using of Genetic Algorithms, an iterative process should be developed. First, the problem to solve is modelled in a mathematical way by establishing of a fitness or objective function. After, a random initial population of strings (chromosomes) codifying problem solutions is generated, which samples the search solution space of the fitness function. Then, offspring populations are generated from previous one by using genetic operators: selection, crossover and mutation. In the selection process, possible solutions are chosen depending on their fitness function value. Then, in the crossover procedure, string segments of pairs of solutions are exchanged to generate the next population. Finally, some parameters in the offspring population are changed by mutation with a low probability. Results of the application of Genetic Algorithms to solve fringe analysis and nesting in finite materials problems are presented.

  16. A comparative study of Monte Carlo simple genetic algorithm and noisy genetic algorithm for cost-effective sampling

    E-print Network

    Zheng, Chunmiao

    A comparative study of Monte Carlo simple genetic algorithm and noisy genetic algorithm for cost 2005 Abstract This study evaluates and compares two methodologies, Monte Carlo simple genetic algorithm of uncertainties in the hydraulic conductivity (K) field. Both methodologies couple a genetic algorithm (GA

  17. Combinatorial Multiobjective Optimization Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Crossley, William A.; Martin. Eric T.

    2002-01-01

    The research proposed in this document investigated multiobjective optimization approaches based upon the Genetic Algorithm (GA). Several versions of the GA have been adopted for multiobjective design, but, prior to this research, there had not been significant comparisons of the most popular strategies. The research effort first generalized the two-branch tournament genetic algorithm in to an N-branch genetic algorithm, then the N-branch GA was compared with a version of the popular Multi-Objective Genetic Algorithm (MOGA). Because the genetic algorithm is well suited to combinatorial (mixed discrete / continuous) optimization problems, the GA can be used in the conceptual phase of design to combine selection (discrete variable) and sizing (continuous variable) tasks. Using a multiobjective formulation for the design of a 50-passenger aircraft to meet the competing objectives of minimizing takeoff gross weight and minimizing trip time, the GA generated a range of tradeoff designs that illustrate which aircraft features change from a low-weight, slow trip-time aircraft design to a heavy-weight, short trip-time aircraft design. Given the objective formulation and analysis methods used, the results of this study identify where turboprop-powered aircraft and turbofan-powered aircraft become more desirable for the 50 seat passenger application. This aircraft design application also begins to suggest how a combinatorial multiobjective optimization technique could be used to assist in the design of morphing aircraft.

  18. The Applications of Genetic Algorithms in Medicine

    PubMed Central

    Ghaheri, Ali; Shoar, Saeed; Naderan, Mohammad; Hoseini, Sayed Shahabuddin

    2015-01-01

    A great wealth of information is hidden amid medical research data that in some cases cannot be easily analyzed, if at all, using classical statistical methods. Inspired by nature, metaheuristic algorithms have been developed to offer optimal or near-optimal solutions to complex data analysis and decision-making tasks in a reasonable time. Due to their powerful features, metaheuristic algorithms have frequently been used in other fields of sciences. In medicine, however, the use of these algorithms are not known by physicians who may well benefit by applying them to solve complex medical problems. Therefore, in this paper, we introduce the genetic algorithm and its applications in medicine. The use of the genetic algorithm has promising implications in various medical specialties including radiology, radiotherapy, oncology, pediatrics, cardiology, endocrinology, surgery, obstetrics and gynecology, pulmonology, infectious diseases, orthopedics, rehabilitation medicine, neurology, pharmacotherapy, and health care management. This review introduces the applications of the genetic algorithm in disease screening, diagnosis, treatment planning, pharmacovigilance, prognosis, and health care management, and enables physicians to envision possible applications of this metaheuristic method in their medical career.] PMID:26676060

  19. Texture Synthesis with Tandem Genetic Algorithms using Nonparametric Partially

    E-print Network

    Ashlock, Dan

    ordered Markov model for the exam- ple texture. The genetic algorithms used are themselves are quiteTexture Synthesis with Tandem Genetic Algorithms using Nonparametric Partially Ordered Markov textures. We use a pair of genetic algorithms to cre- ate fast one-pass generating algorithms for five

  20. Birefringent filter design by use of a modified genetic algorithm

    E-print Network

    Yao, Jianping

    Birefringent filter design by use of a modified genetic algorithm Mengtao Wen and Jianping Yao A modified genetic algorithm is proposed for the optimization of fiber birefringent filters. The orientation of the filters. Being different from the normal genetic algorithm, the algorithm proposed reduces the problem

  1. A Genetic Algorithm for Minimax Optimization Problems Jeffrey W. Herrmann

    E-print Network

    Herrmann, Jeffrey W.

    A Genetic Algorithm for Minimax Optimization Problems Jeffrey W. Herrmann Department of Mechanical-space genetic algorithm as a general technique to solve minimax optimization problems. This algorithm maintains of applications. To illustrate its potential, we use the two-space genetic algorithm to solve a parallel machine

  2. A Genetic CascadeCorrelation Learning Algorithm \\Lambda

    E-print Network

    George Mason University

    A Genetic Cascade瑿orrelation Learning Algorithm \\Lambda Mitchell A. Potter Computer Science algorithms provide an alternative. Unfortunately, early attempts to use genetic algorithms to train connec. This paper explores an approach in which a traditional genetic algorithm using standard two璸oint crossover

  3. The Use of Genetic Algorithms in Multilayer Mirror Optimization

    E-print Network

    Hart, Gus

    The Use of Genetic Algorithms in Multilayer Mirror Optimization by Shannon Lunt March 1999 of the Chromosomes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 6 Flow chart of the Genetic Algorithm.7 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2 Genetic

  4. Genetic Algorithm Approaches for Actuator Placement

    NASA Technical Reports Server (NTRS)

    Crossley, William A.

    2000-01-01

    This research investigated genetic algorithm approaches for smart actuator placement to provide aircraft maneuverability without requiring hinged flaps or other control surfaces. The effort supported goals of the Multidisciplinary Design Optimization focus efforts in NASA's Aircraft au program. This work helped to properly identify various aspects of the genetic algorithm operators and parameters that allow for placement of discrete control actuators/effectors. An improved problem definition, including better definition of the objective function and constraints, resulted from this research effort. The work conducted for this research used a geometrically simple wing model; however, an increasing number of potential actuator placement locations were incorporated to illustrate the ability of the GA to determine promising actuator placement arrangements. This effort's major result is a useful genetic algorithm-based approach to assist in the discrete actuator/effector placement problem.

  5. An investigation of messy genetic algorithms

    NASA Technical Reports Server (NTRS)

    Goldberg, David E.; Deb, Kalyanmoy; Korb, Bradley

    1990-01-01

    Genetic algorithms (GAs) are search procedures based on the mechanics of natural selection and natural genetics. They combine the use of string codings or artificial chromosomes and populations with the selective and juxtapositional power of reproduction and recombination to motivate a surprisingly powerful search heuristic in many problems. Despite their empirical success, there has been a long standing objection to the use of GAs in arbitrarily difficult problems. A new approach was launched. Results to a 30-bit, order-three-deception problem were obtained using a new type of genetic algorithm called a messy genetic algorithm (mGAs). Messy genetic algorithms combine the use of variable-length strings, a two-phase selection scheme, and messy genetic operators to effect a solution to the fixed-coding problem of standard simple GAs. The results of the study of mGAs in problems with nonuniform subfunction scale and size are presented. The mGA approach is summarized, both its operation and the theory of its use. Experiments on problems of varying scale, varying building-block size, and combined varying scale and size are presented.

  6. Applying a Genetic Algorithm to Reconfigurable Hardware

    NASA Technical Reports Server (NTRS)

    Wells, B. Earl; Weir, John; Trevino, Luis; Patrick, Clint; Steincamp, Jim

    2004-01-01

    This paper investigates the feasibility of applying genetic algorithms to solve optimization problems that are implemented entirely in reconfgurable hardware. The paper highlights the pe$ormance/design space trade-offs that must be understood to effectively implement a standard genetic algorithm within a modem Field Programmable Gate Array, FPGA, reconfgurable hardware environment and presents a case-study where this stochastic search technique is applied to standard test-case problems taken from the technical literature. In this research, the targeted FPGA-based platform and high-level design environment was the Starbridge Hypercomputing platform, which incorporates multiple Xilinx Virtex II FPGAs, and the Viva TM graphical hardware description language.

  7. Genetic Algorithms for Digital Quantum Simulations

    E-print Network

    U. Las Heras; U. Alvarez-Rodriguez; E. Solano; M. Sanz

    2015-12-02

    We propose genetic algorithms, which are robust optimization techniques inspired by natural selection, to enhance the versatility of digital quantum simulations. In this sense, we show that genetic algorithms can be employed to increase the fidelity and optimize the resource requirements of digital quantum simulation protocols, while adapting naturally to the experimental constraints. Furthermore, this method allows us to reduce not only digital errors, but also experimental errors in quantum gates. Indeed, by adding ancillary qubits, we design a modular gate made out of imperfect gates, whose fidelity is larger than the fidelity of any of the constituent gates. Finally, we prove that the proposed modular gates are resilient against different gate errors.

  8. GADYM -A Novel Genetic Algorithm in Mechanical Design Problems

    E-print Network

    GADYM - A Novel Genetic Algorithm in Mechanical Design Problems Khadiza Tahera (Monash University plochert@bigpond.net.au) Abstract: This paper proposes a variant of genetic algorithm GADYM, Genetic the concept of gender and age in individuals of a traditional Genetic Algorithm and implements the self

  9. Hyperplane Ranking, Nonlinearity and the Simple Genetic Algorithm

    E-print Network

    Whitley, Darrell

    Hyperplane Ranking, Nonlinearity and the Simple Genetic Algorithm Darrell Whitley Robert B ranking induced by a simple genetic algorithm is highly correlated with the degree of static ranking of their models of genetic algorithms (c.f. [9, 11, 12]). A critical question, then, is to what degree are genetic

  10. Genetic Algorithms and Neural 11.1 INTRODUCTION

    E-print Network

    Whitley, Darrell

    11 Genetic Algorithms and Neural Networks D. WHITLEY 11.1 INTRODUCTION Genetic algorithms architecture is determined genetically. It is therefore not surprising that as some neural network researchers. Genetic algorithms have been used in conjunction with neural networks in three major ways. First

  11. Predicting complex mineral structures using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Mohn, Chris E.; Kob, Walter

    2015-10-01

    We show that symmetry-adapted genetic algorithms are capable of finding the ground state of a range of complex crystalline phases including layered- and incommensurate super-structures. This opens the way for the atomistic prediction of complex crystal structures of functional materials and mineral phases.

  12. GENETIC PROGRAMMING OF AN ALGORITHMIC CHEMISTRY

    E-print Network

    Fernandez, Thomas

    Chapter 11 GENETIC PROGRAMMING OF AN ALGORITHMIC CHEMISTRY W. Banzhaf and C. Lasarczyk can be considered as an artificial chemistry. It lends itself well to distributed and parallel. Programs of this type can be seen as artificial chemistries, where instructions interact with each other

  13. Convergence properties of simple genetic algorithms

    NASA Technical Reports Server (NTRS)

    Bethke, A. D.; Zeigler, B. P.; Strauss, D. M.

    1974-01-01

    The essential parameters determining the behaviour of genetic algorithms were investigated. Computer runs were made while systematically varying the parameter values. Results based on the progress curves obtained from these runs are presented along with results based on the variability of the population as the run progresses.

  14. GENETIC ALGORITHM FORECASTING FOR TELECOMMUNICATIONS PRODUCTS

    E-print Network

    Havlicek, Joebob

    1 GENETIC ALGORITHM FORECASTING FOR TELECOMMUNICATIONS PRODUCTS STEPHEN D. SLOAN, RAYMOND W. SAW's) for forecasting long-term quarterly sales of products in the telecommunications technology sector using widely desirable capability for many companies operating in the increasingly volatile telecommunications technology

  15. MULTIOBJECTIVE PARALLEL GENETIC ALGORITHM FOR WASTE MINIMIZATION

    EPA Science Inventory

    In this research we have developed an efficient multiobjective parallel genetic algorithm (MOPGA) for waste minimization problems. This MOPGA integrates PGAPack (Levine, 1996) and NSGA-II (Deb, 2000) with novel modifications. PGAPack is a master-slave parallel implementation of a...

  16. Genetic Algorithms for Multiple-Choice Problems

    NASA Astrophysics Data System (ADS)

    Aickelin, Uwe

    2010-04-01

    This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems.It shows that such information can significantly enhance performance, but that the choice of information and the way it is included are important factors for success.Two multiple-choice problems are considered.The first is constructing a feasible nurse roster that considers as many requests as possible.In the second problem, shops are allocated to locations in a mall subject to constraints and maximising the overall income.Genetic algorithms are chosen for their well-known robustness and ability to solve large and complex discrete optimisation problems.However, a survey of the literature reveals room for further research into generic ways to include constraints into a genetic algorithm framework.Hence, the main theme of this work is to balance feasibility and cost of solutions.In particular, co-operative co-evolution with hierarchical sub-populations, problem structure exploiting repair schemes and indirect genetic algorithms with self-adjusting decoder functions are identified as promising approaches.The research starts by applying standard genetic algorithms to the problems and explaining the failure of such approaches due to epistasis.To overcome this, problem-specific information is added in a variety of ways, some of which are designed to increase the number of feasible solutions found whilst others are intended to improve the quality of such solutions.As well as a theoretical discussion as to the underlying reasons for using each operator,extensive computational experiments are carried out on a variety of data.These show that the indirect approach relies less on problem structure and hence is easier to implement and superior in solution quality.

  17. CYCLIC GENETIC ALGORITHMS FOR THE LOCOMOTION OF HEXAPOD ROBOTS

    E-print Network

    Parker, Gary B.

    of representing all states of the robot and use a cyclic genetic algorithm to train this model to walk forwardCYCLIC GENETIC ALGORITHMS FOR THE LOCOMOTION OF HEXAPOD ROBOTS GARY B. PARKER and GREGORY J. E solutions where a series of actions is continually repeated. Genetic Algorithms that do parameter

  18. Cyclic and Chaotic Behavior in Genetic Algorithms Alden H. Wright

    E-print Network

    Wright, Alden H.

    longer strings, and with and without crossover. Dynamical system models of genetic algorithms model. These models are useful because they can show behav- ior of a genetic algorithm that can be masked population model. The simple genetic algorithm heuristic G is called focused if G is continuously

  19. Cyclic and Chaotic Behavior in Genetic Algorithms Alden H. Wright

    E-print Network

    Wright, Alden H.

    longer strings, and with and without crossover. Dynamical system models of genetic algorithms model. These models are useful because they can show behav ior of a genetic algorithm that can be masked population model. The simple genetic algorithm heuristic G is called focused if G is continuously

  20. Toward a Better Understanding of Mixing in Genetic Algorithms

    E-print Network

    Utrecht, Universiteit

    Toward a Better Understanding of Mixing in Genetic Algorithms David E. Goldberg, Kalyanmoy Deb 61801 IlliGAL Report No. 92009 October 1992 Illinois Genetic Algorithms Laboratory Department of General Urbana, Illinois 61801 #12; Toward a Better Understanding of Mixing in Genetic Algorithms David E

  1. Towards a Genetic Algorithm for Function Optimization Sonja Novkovic

    E-print Network

    Towards a Genetic Algorithm for Function Optimization Sonja Novkovic and Davor Sverko Abstract: This article analyses a version of genetic algorithm (GA, Holland 1975) designed for function optimization, such as non-coding segments, elitist selection and multiple crossover. Key words: Genetic algorithm, Royal

  2. A hybrid genetic algorithm for resolving closely spaced objects

    NASA Technical Reports Server (NTRS)

    Abbott, R. J.; Lillo, W. E.; Schulenburg, N.

    1995-01-01

    A hybrid genetic algorithm is described for performing the difficult optimization task of resolving closely spaced objects appearing in space based and ground based surveillance data. This application of genetic algorithms is unusual in that it uses a powerful domain-specific operation as a genetic operator. Results of applying the algorithm to real data from telescopic observations of a star field are presented.

  3. Genetic Algorithms applied to Problems of Forbidden Configurations

    E-print Network

    Fournier, John J.F.

    Genetic Algorithms applied to Problems of Forbidden Configurations R.P. Anstee Miguel Raggi particular a Genetic Algorithm) for finding extremal matrices. We apply this technique to two forbidden and then proving the guess is indeed correct. The Genetic Algorithm was also helpful in finding the proof. Keywords

  4. Annealing a Genetic Algorithm for Constrained Optimization1

    E-print Network

    Mendivil, Franklin

    Annealing a Genetic Algorithm for Constrained Optimization1 F. Mendivil2 3 and R. Shonkwiler4 Abstract In this paper, we adapt a genetic algorithm for constrained optimization problems. We use will converge to a globally optimal feasible state. Key Words: Genetic algorithms, constrained optimization

  5. USE OF GENETIC ALGORITHMS FOR OPTIMAL INVESTMENT STRATEGIES

    E-print Network

    Brennand, Tracy

    USE OF GENETIC ALGORITHMS FOR OPTIMAL INVESTMENT STRATEGIES by Fan Zhang B.Ec., RenMin University;APPROVAL Name: Fan Zhang Degree: Master of Science Title of Project: Use of Genetic Algorithms for Optimal Approved: ii #12;Abstract In this project, a genetic algorithm (GA) is used in the development

  6. A Genetic Algorithm for Simultaneous Localization and Mapping Tom Duckett

    E-print Network

    Duckett, Tom

    A Genetic Algorithm for Simultaneous Localization and Mapping Tom Duckett Centre for Applied. The fitness values in the genetic algorithm are obtained with a heuristic function that measures of the maps produced, and the search proceeds using a genetic algorithm (GA). GAs are a well-known search

  7. GENETIC ALGORITHMS FOR PARTITIONING SETS WILLIAM A. GREENE

    E-print Network

    Greene, William A.

    GENETIC ALGORITHMS FOR PARTITIONING SETS WILLIAM A. GREENE Computer Science Department University into subsets such that their sums are as nearly equal as possible. We devise a new genetic algorithm, Eager. Keywords: genetic algorithm, set partitioning, Equal Piles Problem, map coloring. 1. Introduction

  8. Data mining and genetic algorithm based gene/SNP selection

    E-print Network

    Kusiak, Andrew

    Data mining and genetic algorithm based gene/SNP selection Shital C. Shah, Andrew Kusiak (SNPs); Genes; Feature selection; Data mining; Genetic algorithm; Intersection approach; Drug. The approach is based on data mining and genetic algorithms. A global search mechanism, weighted decision tree

  9. A Modular Genetic Algorithm for Scheduling Task Graphs

    E-print Network

    Bhattacharyya, Shuvra S.

    1 A Modular Genetic Algorithm for Scheduling Task Graphs Michael Rinehart, Vida Kianzad, and Shuvra. Several genetic algorithms have been designed for the problem of scheduling task graphs onto. In this paper, a genetic algorithm based in a bi-chromosomal rep- resetnation and capable of being incorporated

  10. GAPRUS -GENETIC ALGORITHMS BASED PIPE ROUTING USING TESSELLATED OBJECTS

    E-print Network

    Chen, Wei

    GAPRUS - GENETIC ALGORITHMS BASED PIPE ROUTING USING TESSELLATED OBJECTS Sunand Sandurkar Software problems involving 3D freeform obstacles is demonstrated. Key words: Pipe Routing, Genetic Algorithms of CAD model as a connected array of triangles (tessellated format) GAPRUS Genetic Algorithm based Pipe

  11. Modeling the model Characteristics and behavior of genetic algorithms

    E-print Network

    Modeling the model Characteristics and behavior of genetic algorithms Author. Janeen Neri Progress in data files containing the fitness distribution and genetic algorithm specifications to be tested, and normalizes the fitness data for easier manipulation. A de- tailed pseudocode outline of the genetic algorithm

  12. Applying Genetic Algorithm to Modeling Nonlinear Transfer Functions

    E-print Network

    Loyka, Sergey

    Applying Genetic Algorithm to Modeling Nonlinear Transfer Functions Sergey L. Loyka Abstract- A genetic algorithm technique for the approximation of nonlinear transfer functions is proposed of this technique to behavioral-level simulation is also discussed. Keywords genetic algorithm, nonlinear transfer

  13. Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem

    E-print Network

    Ferris, Michael C.

    Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem Edward J optimization. We consider the application of the genetic algorithm to a particular problem, the Assembly Line Balancing Problem. A general description of genetic algorithms is given, and their specialized use on our

  14. The Evolution of Understanding: A Genetic Algorithm Model of the

    E-print Network

    Levin, Michael

    The Evolution of Understanding: A Genetic Algorithm Model of the Evolution of Communication Michael.edu Keywords: evolution of communication, genetic algorithm, self-organization #12;Abstract Much animal such understanding. Using a genetic algorithm implemented on a computer, I demonstrate that a significant though

  15. A Genetic Algorithm for Simultaneous Localization and Mapping Tom Duckett

    E-print Network

    Duckett, Tom

    A Genetic Algorithm for Simultaneous Localization and Mapping Tom Duckett Centre for Applied. The fitness values in the genetic algorithm are obtained with a heuristic function that measures of the maps produced, and the search proceeds using a genetic algorithm (GA). GAs are a well璳nown search

  16. A Simple Genetic Algorithm for Biomarker Mining Dusan Popovic1

    E-print Network

    A Simple Genetic Algorithm for Biomarker Mining Dusan Popovic1 , Alejandro Sifrim1 , Georgios A on a genetic algorithm with a novel fitness function and a bagging-like model aver- aging scheme. We signatures developed specially for the colon cancer case. Keywords. genetic algorithm, feature selection

  17. Technical Report No. 494 Using Cyclic Genetic Algorithms

    E-print Network

    Portland State University

    Technical Report No. 494 Using Cyclic Genetic Algorithms to Recon gure Hardware Controllers Indiana University Bloomington, Indiana 47405-4101 #12;Using Cyclic Genetic Algorithms to Recon gure for a small hexapod robot are generated by a cyclic genetic algorithm. From these automata a Xilinx net list

  18. Topology design of feedforward neural networks by genetic algorithms

    E-print Network

    Topology design of feedforward neural networks by genetic algorithms Slawomir W. Stepniewski 1 to achieve near optimal performance still remains a very challenging task. Genetic algorithms may be used, a genetic algorithm need not be limited to simply adjusting patterns of connections, but, for example, can

  19. Determining Relative Importance and Effective Settings for Genetic Algorithm

    E-print Network

    Determining Relative Importance and Effective Settings for Genetic Algorithm Control Parameters K the control parameters of a genetic algorithm so as to obtain good results is a long-standing problem. We-encoded genetic algorithm (GA). Subsequently, as reported elsewhere, we applied the GA, with the control

  20. lication of Genetic Algorithms for General Lotsizing Problems

    E-print Network

    Xie, Jinxing

    82 lication of Genetic Algorithms for General Lotsizing Problems Xie Jinxing Tsinghua UEiversity,China Abstract: This paper presents an application of genetic algorithms for dynamic lotsizing problems, andor all the cost parameters can be time-varying. A genetic algorithm for the problems is introduced

  1. Genetic algorithm dynamics on a rugged landscape Stefan Bornholdt*

    E-print Network

    Bornholdt, Stefan

    Genetic algorithm dynamics on a rugged landscape Stefan Bornholdt* Institut fu╮ Theoretische manuscript received 5 December 1997 The genetic algorithm is an optimization procedure motivated on a maximum entropy ansatz. Finally it is applied to modeling the dynamics of a genetic algorithm

  2. FINE-GRAINED PARALLEL GENETIC ALGORITHM: A STOCHASTIC OPTIMISATION METHOD

    E-print Network

    Bargiela, Andrzej

    FINE-GRAINED PARALLEL GENETIC ALGORITHM: A STOCHASTIC OPTIMISATION METHOD A. Muhammad1 , A.King@solent.ac.uk Abstract This paper presents a fine-grained parallel genetic algorithm with mutation rate as a control in the simulated annealing [Lundy'86, Otten'89, and Romeo'85]. The parallel genetic algorithm presented here

  3. Ordering Autonomous Underwater Vehicle Inspection Locations with a Genetic Algorithm

    E-print Network

    Idaho, University of

    Ordering Autonomous Underwater Vehicle Inspection Locations with a Genetic Algorithm Brandon Morton@acm.org Abstract--This paper describes a genetic algorithm for solving the traveling salesman problem (TSP (MOOS). The results show that the genetic algorithm performs significantly better than the approach

  4. Quantum-Inspired Genetic Algorithm or Quantum Genetic Algorithm: Which Is It?

    NASA Astrophysics Data System (ADS)

    Jones, Erika

    2015-04-01

    Our everyday work focuses on genetic algorithms (GAs) related to quantum computing where we call ``related'' algorithms those falling into one of two classes: (1) GAs run on classical computers but making use of quantum mechanical (QM) constructs and (2) GAs run on quantum hardware. Though convention has yet to be set with respect to usage of the accepted terms quantum-inspired genetic algorithm (QIGA) and quantum genetic algorithm (QGA), we find the two terms highly suitable respectively as labels for the aforementioned classes. With these specific definitions in mind, the difference between the QIGA and QGA is greater than might first be appreciated, particularly by those coming from a perspective emphasizing GA use as a general computational tool irrespective of QM aspects (1) suggested by QIGAs and (2) inherent in QGAs. We offer a theoretical standpoint highlighting key differences-both obvious, and more significantly, subtle-to be considered in general design of a QIGA versus that of a QGA.

  5. Predicting mining activity with parallel genetic algorithms

    USGS Publications Warehouse

    Talaie, S.; Leigh, R.; Louis, S.J.; Raines, G.L.

    2005-01-01

    We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa statistic to measure correlation between ground truth data and data predicted by the model. Within the genetic algorithm, we introduce a new evaluation function sensitive to spatial correctness and we explore the idea of evolving different rule parameters for different subregions of the land. We reduce the time required to run a simulation from 6 hours to 10 minutes by parallelizing the code and employing a 10-node cluster. Our empirical results suggest that using the spatially sensitive evaluation function does indeed improve the performance of the model and our preliminary results also show that evolving different rule parameters for different regions tends to improve overall model performance. Copyright 2005 ACM.

  6. Application of Genetic Algorithms in Seismic Tomography

    NASA Astrophysics Data System (ADS)

    Soupios, Pantelis; Akca, Irfan; Mpogiatzis, Petros; Basokur, Ahmet; Papazachos, Constantinos

    2010-05-01

    In the earth sciences several inverse problems that require data fitting and parameter estimation are nonlinear and can involve a large number of unknown parameters. Consequently, the application of analytical inversion or optimization techniques may be quite restrictive. In practice, most analytical methods are local in nature and rely on a linearized form of the problem in question, adopting an iterative procedure using partial derivatives to improve an initial model. This approach can lead to a dependence of the final model solution on the starting model and is prone to entrapment in local misfit minima. Moreover, the calculation of derivatives can be computationally inefficient and create instabilities when numerical approximations are used. In contrast to these local minimization methods, global techniques that do not rely on partial derivatives, are independent of the form of the data misfit criterion, and are computationally robust. Such methods often use random processes to sample a selected wider span of the model space. In this situation, randomly generated models are assessed in terms of their data-fitting quality and the process may be stopped after a certain number of acceptable models is identified or continued until a satisfactory data fit is achieved. A new class of methods known as genetic algorithms achieves the aforementioned approximation through novel model representation and manipulations. Genetic algorithms (GAs) were originally developed in the field of artificial intelligence by John Holland more than 20 years ago, but even in this field it is less than a decade that the methodology has been more generally applied and only recently did the methodology attract the attention of the earth sciences community. Applications have been generally concentrated in geophysics and in particular seismology. As awareness of genetic algorithms grows there surely will be many more and varied applications to earth science problems. In the present work, the application of hybrid genetic algorithms in seismic tomography is examined and the efficiency of least squares and genetic methods as representative of the local and global optimization, respectively, is presented and evaluated. The robustness of both optimization methods has been tested and compared for the same source-receiver geometry and characteristics of the model structure (anomalies, etc.). A set of seismic refraction synthetic (noise free) data was used for modeling. Specifically, cross-well, down-hole and typical refraction studies using 24 geophones and 5 shoots were used to confirm the applicability of the genetic algorithms in seismic tomography. To solve the forward modeling and estimate the traveltimes, the revisited ray bending method was used supplemented by an approximate computation of the first Fresnel volume. The root mean square (rms) error as the misfit function was used and calculated for the entire random velocity model for each generation. After the end of each generation and based on the misfit of the individuals (velocity models), the selection, crossover and mutation (typical process steps of genetic algorithms) were selected continuing the evolution theory and coding the new generation. To optimize the computation time, since the whole procedure is quite time consuming, the Matlab Distributed Computing Environment (MDCE) was used in a multicore engine. During the tests, we noticed that the fast convergence that the algorithm initially exhibits (first 5 generations) is followed by progressively slower improvements of the reconstructed velocity models. Thus, to improve the final tomographic models, a hybrid genetic algorithm (GA) approach was adopted by combining the GAs with a local optimization method after several generations, on the basis of the convergence of the resulting models. This approach is shown to be efficient, as it directs the solution search towards a model region close to the global minimum solution.

  7. Genetic algorithms for minimal source reconstructions

    SciTech Connect

    Lewis, P.S.; Mosher, J.C.

    1993-12-01

    Under-determined linear inverse problems arise in applications in which signals must be estimated from insufficient data. In these problems the number of potentially active sources is greater than the number of observations. In many situations, it is desirable to find a minimal source solution. This can be accomplished by minimizing a cost function that accounts from both the compatibility of the solution with the observations and for its ``sparseness``. Minimizing functions of this form can be a difficult optimization problem. Genetic algorithms are a relatively new and robust approach to the solution of difficult optimization problems, providing a global framework that is not dependent on local continuity or on explicit starting values. In this paper, the authors describe the use of genetic algorithms to find minimal source solutions, using as an example a simulation inspired by the reconstruction of neural currents in the human brain from magnetoencephalographic (MEG) measurements.

  8. Harmonic Optimization of Multilevel Converters Using Genetic Algorithms Abstract--In this paper, a genetic algorithm (GA) optimization

    E-print Network

    Tolbert, Leon M.

    Harmonic Optimization of Multilevel Converters Using Genetic Algorithms Abstract-- In this paper, a genetic algorithm (GA) optimization technique is applied to multilevel inverter to determine optimum. In this paper, a general genetic algorithm (GA) approach will be presented, which solves the same problem

  9. Genetic Algorithm Tuned Fuzzy Logic for Gliding Return Trajectories

    NASA Technical Reports Server (NTRS)

    Burchett, Bradley T.

    2003-01-01

    The problem of designing and flying a trajectory for successful recovery of a reusable launch vehicle is tackled using fuzzy logic control with genetic algorithm optimization. The plant is approximated by a simplified three degree of freedom non-linear model. A baseline trajectory design and guidance algorithm consisting of several Mamdani type fuzzy controllers is tuned using a simple genetic algorithm. Preliminary results show that the performance of the overall system is shown to improve with genetic algorithm tuning.

  10. Optical Constants Determined by Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Smith, David Y.; Karstens, William; Malghani, Shaheen M.

    2005-03-01

    A recent determination^a of the complex refractive index, n(?) + i ?(?), of porous silicon employed a genetic^b algorithm to fit the Fresnel equations to reflectance spectra. The procedure appeared to involve more unknowns than explicit equations available for fitting, an indeterminate problem. However, the index values obtained were reasonable, and predicted the properties of porous-silicon multilayes. We have traced this success to the interpolation formulas used for n and ? in the fitting algorithm. They amount to an implicit optical-constant model with the de facto assumption of an analytic complex index that can be approximated by a cubic polynomial. Our analysis suggests the procedure can be improved by explicitly using a more appropriate model, e.g., one that uses wave number as the expansion variable and requires that n and ? be even and odd functions of ?, respectively. ^a V. Torres-Costa, R. J. Mart'in-Palma, and J. M. Mart'inez-Duart, J. Appl. Phys. 96, 4197 (2004). ^b D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Reading, 1989).

  11. Boolean Networks Design by Genetic Algorithms

    E-print Network

    Roli, Andrea; Lazzarini, Marco; Benedettini, Stefano

    2011-01-01

    We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with the aim of finding a network such that the attractor it reaches is of required length $l$. In general, any target can be defined, provided that it is possible to model the task as an optimisation problem over the space of networks. We experiment with different initial conditions for the networks, namely in ordered, chaotic and critical regions, and also with different target length values. Results show that all kinds of initial networks can attain the desired goal, but with different success ratios: initial populations composed of critical or chaotic networks are more likely to reach the target. Moreover, the evolution starting from critical networks achieves the best overall performance. This study is the first step toward the use of search algorithms as tools for automatically design Boolean networks with required properties.

  12. Estimating Photometric Redshifts Using Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Miles, Nicholas; Freitas, Alex; Serjeant, Stephen

    Photometry is used as a cheap and easy way to estimate redshifts of galaxies, which would otherwise require considerable amounts of expensive telescope time. However, the analysis of photometric redshift datasets is a task where it is sometimes difficultto achievea high classification accuracy. This work presents a custom Genetic Algorithm (GA) for mining the Hubble Deep Field North (HDF-N) datasets to achieve accurate IF-THEN classification rules. This kind of knowledge representation has the advantage of being intuitively comprehensible to the user, facilitating astronomers' interpretation of discovered knowledge. The GA is tested againstthe state of the art decision tree algorithm C5.0 [Rulequest, 2005] in two datasets, achieving better classification accuracy and simplerrule sets in both datasets.

  13. Comparison of genetic algorithms with conjugate gradient methods

    NASA Technical Reports Server (NTRS)

    Bosworth, J. L.; Foo, N. Y.; Zeigler, B. P.

    1972-01-01

    Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.

  14. Adaptive Control of Third Harmonic Generation via Genetic Algorithm

    E-print Network

    Hua, Xia

    2010-10-12

    Genetic algorithm is often used to find the global optimum in a multi-dimensional search problem. Inspired by the natural evolution process, this algorithm employs three reproduction strategies -- cloning, crossover and mutation -- combined...

  15. A genetic algorithm to minimize chromatic entropy

    E-print Network

    Durrett, Greg

    We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algorithms for optimizing data compression when ...

  16. Saving Resources with Plagues in Genetic Algorithms

    SciTech Connect

    de Vega, F F; Cantu-Paz, E; Lopez, J I; Manzano, T

    2004-06-15

    The population size of genetic algorithms (GAs) affects the quality of the solutions and the time required to find them. While progress has been made in estimating the population sizes required to reach a desired solution quality for certain problems, in practice the sizing of populations is still usually performed by trial and error. These trials might lead to find a population that is large enough to reach a satisfactory solution, but there may still be opportunities to optimize the computational cost by reducing the size of the population. This paper presents a technique called plague that periodically removes a number of individuals from the population as the GA executes. Recently, the usefulness of the plague has been demonstrated for genetic programming. The objective of this paper is to extend the study of plagues to genetic algorithms. We experiment with deceptive trap functions, a tunable difficult problem for GAs, and the experiments show that plagues can save computational time while maintaining solution quality and reliability.

  17. Evolutionary algorithms in genetic regulatory networks model

    E-print Network

    Raza, Khalid

    2012-01-01

    Genetic Regulatory Networks (GRNs) plays a vital role in the understanding of complex biological processes. Modeling GRNs is significantly important in order to reveal fundamental cellular processes, examine gene functions and understanding their complex relationships. Understanding the interactions between genes gives rise to develop better method for drug discovery and diagnosis of the disease since many diseases are characterized by abnormal behaviour of the genes. In this paper we have reviewed various evolutionary algorithms-based approach for modeling GRNs and discussed various opportunities and challenges.

  18. Modeling of Nonlinear Systems using Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Hayashi, Kayoko; Yamamoto, Toru; Kawada, Kazuo

    In this paper, a newly modeling system by using Genetic Algorithm (GA) is proposed. The GA is an evolutionary computational method that simulates the mechanisms of heredity or evolution of living things, and it is utilized in optimization and in searching for optimized solutions. Most process systems have nonlinearities, so it is necessary to anticipate exactly such systems. However, it is difficult to make a suitable model for nonlinear systems, because most nonlinear systems have a complex structure. Therefore the newly proposed method of modeling for nonlinear systems uses GA. Then, according to the newly proposed scheme, the optimal structure and parameters of the nonlinear model are automatically generated.

  19. Genetic algorithms for modelling and optimisation

    NASA Astrophysics Data System (ADS)

    McCall, John

    2005-12-01

    Genetic algorithms (GAs) are a heuristic search and optimisation technique inspired by natural evolution. They have been successfully applied to a wide range of real-world problems of significant complexity. This paper is intended as an introduction to GAs aimed at immunologists and mathematicians interested in immunology. We describe how to construct a GA and the main strands of GA theory before speculatively identifying possible applications of GAs to the study of immunology. An illustrative example of using a GA for a medical optimal control problem is provided. The paper also includes a brief account of the related area of artificial immune systems.

  20. Dominant takeover regimes for genetic algorithms

    NASA Technical Reports Server (NTRS)

    Noever, David; Baskaran, Subbiah

    1995-01-01

    The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler's device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solution reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems.

  1. A Genetic Algorithm for Designing Constellations with Low Error Floors

    E-print Network

    Valenti, Matthew C.

    and Electrical Engineering West Virginia UniveGenetic Algorithm March 21, 2008 1 / 21 #12;Outline 1 Introduction Department of Computer Science and Electrical Engineering West Virginia UniveGenetic Algorithm March 21, 2008 Valenti et al. ( Lane Department of Computer Science and Electrical Engineering West Virginia UniveGenetic

  2. Multiple Vehicle Routing With Time Windows Using Genetic Algorithms

    E-print Network

    Louis, Sushil J.

    Multiple Vehicle Routing With Time Windows Using Genetic Algorithms Sushil J. Louis, Xiangying Yin, Zhen Ya Yuan Genetic Adaptive Systems LAB Department Of Computer Science/171 University Of Nevada, Reno 89557 sushil@cs.unr.edu January 29, 1999 Abstract We use genetic algorithm to attack the vehicle routing

  3. Instrument design and optimization using genetic algorithms

    SciTech Connect

    Hoelzel, Robert; Bentley, Phillip M.; Fouquet, Peter

    2006-10-15

    This article describes the design of highly complex physical instruments by using a canonical genetic algorithm (GA). The procedure can be applied to all instrument designs where performance goals can be quantified. It is particularly suited to the optimization of instrument design where local optima in the performance figure of merit are prevalent. Here, a GA is used to evolve the design of the neutron spin-echo spectrometer WASP which is presently being constructed at the Institut Laue-Langevin, Grenoble, France. A comparison is made between this artificial intelligence approach and the traditional manual design methods. We demonstrate that the search of parameter space is more efficient when applying the genetic algorithm, and the GA produces a significantly better instrument design. Furthermore, it is found that the GA increases flexibility, by facilitating the reoptimization of the design after changes in boundary conditions during the design phase. The GA also allows the exploration of 'nonstandard' magnet coil geometries. We conclude that this technique constitutes a powerful complementary tool for the design and optimization of complex scientific apparatus, without replacing the careful thought processes employed in traditional design methods.

  4. Application of genetic algorithm to steganalysis

    NASA Astrophysics Data System (ADS)

    Knapik, Timothy; Lo, Ephraim; Marsh, John A.

    2006-05-01

    We present a novel application of genetic algorithm (GA) to optimal feature set selection in supervised learning using support vector machine (SVM) for steganalysis. Steganalysis attempts to determine whether a cover object (in our case an image file) contains hidden information. This is a bivariate classification problem: the image either does or does not contain hidden data. Our SVM classifier uses a training set of images with known classification to "learn" how to classify images with unknown classification. The SVM uses a feature set, essentially a set of statistical quantities extracted from the image. The performance of the SVM classifier is heavily dependent on the feature set used. Too many features not only increase computation time but decrease performance, and too few features do not provide enough information for accurate classification. Our steganalysis technique uses entropic features that yield up to 240 features per image. The selection of an optimum feature set is a problem that lends itself well to genetic algorithm optimization. We describe this technique in detail and present a "GA optimized" feature set of 48 features that, for our application, optimizes the tradeoff between computation time and classification accuracy.

  5. GAMPMS: Genetic algorithm managed peptide mutant screening.

    PubMed

    Long, Thomas; McDougal, Owen M; Andersen, Tim

    2015-06-30

    The prominence of endogenous peptide ligands targeted to receptors makes peptides with the desired binding activity good molecular scaffolds for drug development. Minor modifications to a peptide's primary sequence can significantly alter its binding properties with a receptor, and screening collections of peptide mutants is a useful technique for probing the receptor-ligand binding domain. Unfortunately, the combinatorial growth of such collections can limit the number of mutations which can be explored using structure-based molecular docking techniques. Genetic algorithm managed peptide mutant screening (GAMPMS) uses a genetic algorithm to conduct a heuristic search of the peptide's mutation space for peptides with optimal binding activity, significantly reducing the computational requirements of the virtual screening. The GAMPMS procedure was implemented and used to explore the binding domain of the nicotinic acetylcholine receptor (nAChR) ?3?2-isoform with a library of 64,000 ?-conotoxin (?-CTx) MII peptide mutants. To assess GAMPMS's performance, it was compared with a virtual screening procedure that used AutoDock to predict the binding affinity of each of the ?-CTx MII peptide mutants with the ?3?2-nAChR. The GAMPMS implementation performed AutoDock simulations for as few as 1140 of the 64,000 ?-CTx MII peptide mutants and could consistently identify a set of 10 peptides with an aggregated binding energy that was at least 98% of the aggregated binding energy of the 10 top peptides from the exhaustive AutoDock screening. PMID:25975567

  6. Image processing meta-algorithm development via genetic manipulation of existing algorithm graphs

    NASA Astrophysics Data System (ADS)

    Schalkoff, Robert J.; Shaaban, Khaled M.

    1999-07-01

    Automatic algorithm generation for image processing applications is not a new idea, however previous work is either restricted to morphological operates or impractical. In this paper, we show recent research result in the development and use of meta-algorithms, i.e. algorithms which lead to new algorithms. Although the concept is generally applicable, the application domain in this work is restricted to image processing. The meta-algorithm concept described in this paper is based upon out work in dynamic algorithm. The paper first present the concept of dynamic algorithms which, on the basis of training and archived algorithmic experience embedded in an algorithm graph (AG), dynamically adjust the sequence of operations applied to the input image data. Each node in the tree-based representation of a dynamic algorithm with out degree greater than 2 is a decision node. At these nodes, the algorithm examines the input data and determines which path will most likely achieve the desired results. This is currently done using nearest-neighbor classification. The details of this implementation are shown. The constrained perturbation of existing algorithm graphs, coupled with a suitable search strategy, is one mechanism to achieve meta-algorithm an doffers rich potential for the discovery of new algorithms. In our work, a meta-algorithm autonomously generates new dynamic algorithm graphs via genetic recombination of existing algorithm graphs. The AG representation is well suited to this genetic-like perturbation, using a commonly- employed technique in artificial neural network synthesis, namely the blueprint representation of graphs. A number of exam. One of the principal limitations of our current approach is the need for significant human input in the learning phase. Efforts to overcome this limitation are discussed. Future research directions are indicated.

  7. A Genetic Algorithm for the Point to Multipoint Routing Problem with Varying Number of Requests

    E-print Network

    Wainwright, Roger L.

    A Genetic Algorithm for the Point to Multipoint Routing Problem with Varying Number of Requests Problem that uses a genetic algorithm and a heuristic Steiner tree algorithm. Our genetic algorithm allows to Multipoint Routing Problem that uses a genetic algorithm and a heuristic Steiner tree algorithm. Using both

  8. A New Challenge for Compression Algorithms: Genetic Sequences.

    ERIC Educational Resources Information Center

    Grumbach, Stephane; Tahi, Fariza

    1994-01-01

    Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to

  9. A novel BTC decoding algorithm based on the genetic algorithm in optical communication systems

    NASA Astrophysics Data System (ADS)

    Yuan, Jian-guo; Tian, Yang; Hu, Xia; Huang, Sheng; Lin, Jin-zhao; Pang, Yu

    2014-03-01

    Combining the advantages of both the genetic algorithm (GA) and the chase decoding algorithm, a novel improved decoding algorithm of the block turbo code (BTC) with lower computation complexity and more rapid decoding speed is proposed in order to meet the developing demands of optical communication systems. Compared with the traditional chase decoding algorithm, the computation complexity can be reduced and the decoding speed can be accelerated by applying the novel algorithm. The simulation results show that the net coding gain (NCG) of the novel BTC decoding algorithm is 1.1 dB more than that of the traditional chase decoding algorithm at the bit error rate (BER) of 10-6. Therefore, the novel decoding algorithm has better decoding correction-error performance and is suitable for the BTC in optical communication systems.

  10. A Modified Decision Tree Algorithm Based on Genetic Algorithm for Mobile User Classification Problem

    PubMed Central

    Liu, Dong-sheng; Fan, Shu-jiang

    2014-01-01

    In order to offer mobile customers better service, we should classify the mobile user firstly. Aimed at the limitations of previous classification methods, this paper puts forward a modified decision tree algorithm for mobile user classification, which introduced genetic algorithm to optimize the results of the decision tree algorithm. We also take the context information as a classification attributes for the mobile user and we classify the context into public context and private context classes. Then we analyze the processes and operators of the algorithm. At last, we make an experiment on the mobile user with the algorithm, we can classify the mobile user into Basic service user, E-service user, Plus service user, and Total service user classes and we can also get some rules about the mobile user. Compared to C4.5 decision tree algorithm and SVM algorithm, the algorithm we proposed in this paper has higher accuracy and more simplicity. PMID:24688389

  11. Terrainosaurus: realistic terrain synthesis using genetic algorithms

    E-print Network

    Saunders, Ryan L.

    2007-04-25

    Synthetically generated terrain models are useful across a broad range of applications, including computer generated art & animation, virtual reality and gaming, and architecture. Existing algorithms for terrain generation ...

  12. Multidisciplinary design optimization using genetic algorithms

    NASA Technical Reports Server (NTRS)

    Unal, Resit

    1994-01-01

    Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

  13. Spacecraft Attitude Maneuver Planning Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Kornfeld, Richard P.

    2004-01-01

    A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This approach for attitude path planning makes full use of a priori constraint knowledge and is computationally tractable enough to be executed onboard a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used as is or as an initial solution to initialize additional deterministic optimization algorithms. A number of representative case examples for time-fixed and time-varying conditions yielded search times that are typically on the order of minutes, thus demonstrating the viability of this method. This approach is applicable to all deep space and planet Earth missions requiring greater spacecraft autonomy, and greatly facilitates navigation and science observation planning.

  14. PDE Nozzle Optimization Using a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Billings, Dana; Turner, James E. (Technical Monitor)

    2000-01-01

    Genetic algorithms, which simulate evolution in natural systems, have been used to find solutions to optimization problems that seem intractable to standard approaches. In this study, the feasibility of using a GA to find an optimum, fixed profile nozzle for a pulse detonation engine (PDE) is demonstrated. The objective was to maximize impulse during the detonation wave passage and blow-down phases of operation. Impulse of each profile variant was obtained by using the CFD code Mozart/2.0 to simulate the transient flow. After 7 generations, the method has identified a nozzle profile that certainly is a candidate for optimum solution. The constraints on the generality of this possible solution remain to be clarified.

  15. Optimized Dynamical Decoupling via Genetic Algorithms

    E-print Network

    Gregory Quiroz; Daniel A. Lidar

    2013-08-07

    We utilize genetic algorithms to find optimal dynamical decoupling (DD) sequences for a single-qubit system subjected to a general decoherence model under a variety of control pulse conditions. We focus on the case of sequences with equal pulse-intervals and perform the optimization with respect to pulse type and order. In this manner we obtain robust DD sequences, first in the limit of ideal pulses, then when including pulse imperfections such as finite pulse duration and qubit rotation (flip-angle) errors. Although our optimization is numerical, we identify a deterministic structure underlies the top-performing sequences. We use this structure to devise DD sequences which outperform previously designed concatenated DD (CDD) and quadratic DD (QDD) sequences in the presence of pulse errors. We explain our findings using time-dependent perturbation theory and provide a detailed scaling analysis of the optimal sequences.

  16. Genetic Algorithm Approaches to Prebiobiotic Chemistry Modeling

    NASA Technical Reports Server (NTRS)

    Lohn, Jason; Colombano, Silvano

    1997-01-01

    We model an artificial chemistry comprised of interacting polymers by specifying two initial conditions: a distribution of polymers and a fixed set of reversible catalytic reactions. A genetic algorithm is used to find a set of reactions that exhibit a desired dynamical behavior. Such a technique is useful because it allows an investigator to determine whether a specific pattern of dynamics can be produced, and if it can, the reaction network found can be then analyzed. We present our results in the context of studying simplified chemical dynamics in theorized protocells - hypothesized precursors of the first living organisms. Our results show that given a small sample of plausible protocell reaction dynamics, catalytic reaction sets can be found. We present cases where this is not possible and also analyze the evolved reaction sets.

  17. Clinical pathways scheduling using hybrid genetic algorithm.

    PubMed

    Du, Gang; Jiang, Zhibin; Yao, Yang; Diao, Xiaodi

    2013-06-01

    In order to improve the standard of management in hospitals and effectively control the cost of clinical treatments, this research primarily focuses on optimizing the scheduling of clinical pathways (CPs). A mathematical model for CP scheduling is constructed, and the hybrid genetic algorithm (HGA, combining a genetic algorithm with particle swarm optimization) is proposed for solving this problem so as to distribute medical resources and schedule the treatments of patients reasonably and effectively. The optimal search space can be further enlarged by introducing a new mutation mechanism, which allows a more satisfactory solution to be found. In particular, the relative patient waiting time and relative time efficiency are used as measure indexes, which are more scientific and effective than the usual indexes of absolute time and absolute time efficiency. After comparing absolute waiting time, relative waiting time, utilization of absolute waiting time, and utilization of relative waiting time waiting respectively, the conclusion can confidently be drawn that task scheduling obviously enhances patients' time efficiency, reduces time wastage and therefore promotes patient satisfaction with medical processes. Moreover, the patients can to a certain degree move away from their usual passive role in medical processes by using this scheduling system. In order to further validate the rationality and validity of the proposed method, the heuristic rules for CP scheduling are also tested using the same case. The results demonstrate that the proposed HGA achieves superior performance, in terms of precision, over those heuristic rules for CP scheduling. Therefore, we utilize HGA to optimize CP scheduling, thus providing a decision-making mechanism for medical staff and enhancing the efficiency of medical processes. This research has both theoretical and practical significance for electronic CP management, in particular. PMID:23576080

  18. Transonic Wing Shape Optimization Using a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.; Pulliam, Thomas H.; Kwak, Dochan (Technical Monitor)

    2002-01-01

    A method for aerodynamic shape optimization based on a genetic algorithm approach is demonstrated. The algorithm is coupled with a transonic full potential flow solver and is used to optimize the flow about transonic wings including multi-objective solutions that lead to the generation of pareto fronts. The results indicate that the genetic algorithm is easy to implement, flexible in application and extremely reliable.

  19. Coil 2000 Challenge Submission: Genetic Algorithms and Hill-climbers

    E-print Network

    Putten, Peter van der

    Coil 2000 Challenge Submission: Genetic Algorithms and Hill-climbers Dr Jonathan Carter Huxley.n.carter@ic.ac.uk METHOD We have used a combination of Genetic Algorithms and Hill-climbers to generate if-then type rules" and "upper" are relevant bounds for that variable. No limit was place on the number of variables tested

  20. A Test of Genetic Algorithms in Relevance Feedback.

    ERIC Educational Resources Information Center

    Lopez-Pujalte, Cristina; Guerrero Bote, Vicente P.; Moya Anegon, Felix de

    2002-01-01

    Discussion of information retrieval, query optimization techniques, and relevance feedback focuses on genetic algorithms, which are derived from artificial intelligence techniques. Describes an evaluation of different genetic algorithms using a residual collection method and compares results with the Ide dec-hi method (Salton and Buckley, 1990

  1. A "Hands on" Strategy for Teaching Genetic Algorithms to Undergraduates

    ERIC Educational Resources Information Center

    Venables, Anne; Tan, Grace

    2007-01-01

    Genetic algorithms (GAs) are a problem solving strategy that uses stochastic search. Since their introduction (Holland, 1975), GAs have proven to be particularly useful for solving problems that are "intractable" using classical methods. The language of genetic algorithms (GAs) is heavily laced with biological metaphors from evolutionary

  2. Cheating for Problem Solving: A Genetic Algorithm with Social Interactions

    E-print Network

    Aickelin, Uwe

    Cheating for Problem Solving: A Genetic Algorithm with Social Interactions Rafael Lahoz.aickelin@nottingham.ac.uk ABSTRACT We propose a variation of the standard genetic algorithm that incorporates social interaction populations, i.e. animals, even human beings and microorganisms, social interactions often affect the fitness

  3. MULTISCALE PARALLEL GENETIC ALGORITHMS FOR OPTIMAL GROUNDWATER REMEDIATION DESIGN

    E-print Network

    Minsker, Barbara S.

    MULTISCALE PARALLEL GENETIC ALGORITHMS FOR OPTIMAL GROUNDWATER REMEDIATION DESIGN BY MEGHNA BABBAR for the degree of Master of Science in Environmental Engineering in Civil Engineering in the Graduate College of the University of Illinois at Urbana-Champaign, 2002 Urbana, Illinois #12;iii ABSTRACT Genetic algorithms (GAs

  4. Use of a genetic algorithm for compact stellarator coil design

    E-print Network

    Use of a genetic algorithm for compact stellarator coil design W.H. Miner, Jr., P.M. Valanju Fusion than those obtained with traditional methods. A new coil design procedure which uses a genetic algorithm as the core optimization method is described and the resulting advanced coil designs presented. 1

  5. Using Genetic Algorithms to Optimize Operating System Parameters

    E-print Network

    Feitelson, Dror

    Using Genetic Algorithms to Optimize Operating System Parameters Dror G. Feitelson Michael Naaman files containing information about the local workload, and genetic algorithms are used to select of parame ters that can be modified by the system administrator in order to tune system performance

  6. Higher-Order Quantum-Inspired Genetic Algorithms

    E-print Network

    Robert Nowotniak; Jacek Kucharski

    2014-07-02

    This paper presents a theory and an empirical evaluation of Higher-Order Quantum-Inspired Genetic Algorithms. Fundamental notions of the theory have been introduced, and a novel Order-2 Quantum-Inspired Genetic Algorithm (QIGA2) has been presented. Contrary to all QIGA algorithms which represent quantum genes as independent qubits, in higher-order QIGAs quantum registers are used to represent genes strings which allows modelling of genes relations using quantum phenomena. Performance comparison has been conducted on a benchmark of 20 deceptive combinatorial optimization problems. It has been presented that using higher quantum orders is beneficial for genetic algorithm efficiency, and the new QIGA2 algorithm outperforms the old QIGA algorithm which was tuned in highly compute intensive metaoptimization process.

  7. G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

    NASA Technical Reports Server (NTRS)

    Rogers, David

    1991-01-01

    G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

  8. Seeding the Population: Improved Performance in a Genetic Algorithm for the Rectilinear Steiner Problem

    E-print Network

    Julstrom, Bryant A.

    Seeding the Population: Improved Performance in a Genetic Algorithm for the Rectilinear Steiner Problem Bryant A. Julstrom St. Cloud State University Keywords|Combinatorial optimization, rectilinear Steiner problem, genetic algorithms, seeding the pop- ulation. Abstract|A hybrid genetic algorithm

  9. COMPUTING AN ADAPTIVE MESH IN FLUID PROBLEMS USING NEURAL NETWORK AND GENETIC ALGORITHM WITH ADAPTIVE RELAXATION

    E-print Network

    COMPUTING AN ADAPTIVE MESH IN FLUID PROBLEMS USING NEURAL NETWORK AND GENETIC ALGORITHM) and Adaptive Smoothing Errors (ASE), and a Genetic Algorithm (GA) employing a new concept named Adaptive; genetic algorithm; adaptive mesh; finite element method #12;

  10. OBJECT FILE PROGRAM RECOMBINATION OF EXISTING SOFTWARE PROGRAMS USING GENETIC ALGORITHMS

    E-print Network

    Somayaji, Anil

    OBJECT FILE PROGRAM RECOMBINATION OF EXISTING SOFTWARE PROGRAMS USING GENETIC ALGORITHMS by Blair FILE PROGRAM RECOMBINATION OF EXISTING SOFTWARE PROGRAMS USING GENETIC ALGORITHMS" by Blair Carleton OF EXISTING SOFTWARE PROGRAMS USING GENETIC ALGORITHMS DEPARTMENT OR SCHOOL: Faculty of Computer Science

  11. Parameter Expanded Algorithms for Bayesian Latent Variable Modelling of Genetic

    E-print Network

    Craiu, V. Radu

    Parameter Expanded Algorithms for Bayesian Latent Variable Modelling of Genetic Pleiotropy Data variable models has been motivated by genetics association stud- ies in which a single genetic factor Lizhen Xu Radu V. Craiu Lei Sun Andrew D. Paterson November 19, 2014 Abstract Motivated by genetic

  12. Data quality measurement on categorical data using genetic algorithm

    E-print Network

    Vizhi, J Malar

    2012-01-01

    Data quality on categorical attribute is a difficult problem that has not received as much attention as numerical counterpart. Our basic idea is to employ association rule for the purpose of data quality measurement. Strong rule generation is an important area of data mining. Association rule mining problems can be considered as a multi objective problem rather than as a single objective one. The main area of concentration was the rules generated by association rule mining using genetic algorithm. The advantage of using genetic algorithm is to discover high level prediction rules is that they perform a global search and cope better with attribute interaction than the greedy rule induction algorithm often used in data mining. Genetic algorithm based approach utilizes the linkage between association rule and feature selection. In this paper, we put forward a Multi objective genetic algorithm approach for data quality on categorical attributes. The result shows that our approach is outperformed by the objectives...

  13. Robot path planning using a genetic algorithm

    NASA Technical Reports Server (NTRS)

    Cleghorn, Timothy F.; Baffes, Paul T.; Wang, Liu

    1988-01-01

    Robot path planning can refer either to a mobile vehicle such as a Mars Rover, or to an end effector on an arm moving through a cluttered workspace. In both instances there may exist many solutions, some of which are better than others, either in terms of distance traversed, energy expended, or joint angle or reach capabilities. A path planning program has been developed based upon a genetic algorithm. This program assumes global knowledge of the terrain or workspace, and provides a family of good paths between the initial and final points. Initially, a set of valid random paths are constructed. Successive generations of valid paths are obtained using one of several possible reproduction strategies similar to those found in biological communities. A fitness function is defined to describe the goodness of the path, in this case including length, slope, and obstacle avoidance considerations. It was found that with some reproduction strategies, the average value of the fitness function improved for successive generations, and that by saving the best paths of each generation, one could quite rapidly obtain a collection of good candidate solutions.

  14. Lunar Habitat Optimization Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    SanScoucie, M. P.; Hull, P. V.; Tinker, M. L.; Dozier, G. V.

    2007-01-01

    Long-duration surface missions to the Moon and Mars will require bases to accommodate habitats for the astronauts. Transporting the materials and equipment required to build the necessary habitats is costly and difficult. The materials chosen for the habitat walls play a direct role in protection against each of the mentioned hazards. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. Clearly, an optimization method is warranted for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces; therefore, a habitat wall design tool utilizing genetic algorithms (GAs) has been developed. GAs use a "survival of the fittest" philosophy where the most fit individuals are more likely to survive and reproduce. This habitat design optimization tool is a multiobjective formulation of up-mass, heat loss, structural analysis, meteoroid impact protection, and radiation protection. This Technical Publication presents the research and development of this tool as well as a technique for finding the optimal GA search parameters.

  15. Closed Loop System Identification with Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Whorton, Mark S.

    2004-01-01

    High performance control design for a flexible space structure is challenging since high fidelity plant models are di.cult to obtain a priori. Uncertainty in the control design models typically require a very robust, low performance control design which must be tuned on-orbit to achieve the required performance. Closed loop system identi.cation is often required to obtain a multivariable open loop plant model based on closed-loop response data. In order to provide an accurate initial plant model to guarantee convergence for standard local optimization methods, this paper presents a global parameter optimization method using genetic algorithms. A minimal representation of the state space dynamics is employed to mitigate the non-uniqueness and over-parameterization of general state space realizations. This control-relevant system identi.cation procedure stresses the joint nature of the system identi.cation and control design problem by seeking to obtain a model that minimizes the di.erence between the predicted and actual closed-loop performance.

  16. Decision Support for Road Decommissioning and Restoration by Using Genetic Algorithms

    E-print Network

    Decision Support for Road Decommissioning and Restoration by Using Genetic Algorithms and Dynamic are developed using dynamic programming and genetic algorithms. Each model accepts road survey data from

  17. Genetic algorithm based fuzzy control of spacecraft autonomous rendezvous

    NASA Technical Reports Server (NTRS)

    Karr, C. L.; Freeman, L. M.; Meredith, D. L.

    1990-01-01

    The U.S. Bureau of Mines is currently investigating ways to combine the control capabilities of fuzzy logic with the learning capabilities of genetic algorithms. Fuzzy logic allows for the uncertainty inherent in most control problems to be incorporated into conventional expert systems. Although fuzzy logic based expert systems have been used successfully for controlling a number of physical systems, the selection of acceptable fuzzy membership functions has generally been a subjective decision. High performance fuzzy membership functions for a fuzzy logic controller that manipulates a mathematical model simulating the autonomous rendezvous of spacecraft are learned using a genetic algorithm, a search technique based on the mechanics of natural genetics. The membership functions learned by the genetic algorithm provide for a more efficient fuzzy logic controller than membership functions selected by the authors for the rendezvous problem. Thus, genetic algorithms are potentially an effective and structured approach for learning fuzzy membership functions.

  18. Research on Laser Marking Speed Optimization by Using Genetic Algorithm

    PubMed Central

    Wang, Dongyun; Yu, Qiwei; Zhang, Yu

    2015-01-01

    Laser Marking Machine is the most common coding equipment on product packaging lines. However, the speed of laser marking has become a bottleneck of production. In order to remove this bottleneck, a new method based on a genetic algorithm is designed. On the basis of this algorithm, a controller was designed and simulations and experiments were performed. The results show that using this algorithm could effectively improve laser marking efficiency by 25%. PMID:25955831

  19. Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.

    2004-01-01

    A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

  20. Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.

    2005-01-01

    A genetic algorithm approach suitable for solving multi-objective problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding Pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the Pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide Pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

  1. Quantum Algorithms and the Genetic Code

    E-print Network

    Apoorva Patel

    2001-02-06

    Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identification of a base-pairing with a quantum query gives a natural (and first ever) explanation of why living organisms have 4 nucleotide bases and 20 amino acids. It is amazing that these numbers arise as solutions to an optimisation problem. Components of the DNA structure which implement Grover's algorithm are identified, and a physical scenario is presented for the execution of the quantum algorithm. It is proposed that enzymes play a crucial role in maintaining quantum coherence of the process. Experimental tests that can verify this scenario are pointed out.

  2. GENETIC ALGORITHMS FOR A SINGLE-TRACK VEHICLE AUTONOMOUS PILOT

    E-print Network

    Vrajitoru, Dana

    GENETIC ALGORITHMS FOR A SINGLE-TRACK VEHICLE AUTONOMOUS PILOT Dana Vrajitoru Intelligent Systems algorithms to an autonomous pilot designed for motorized single-track vehicles (motorcycles). The pilot-agents, autonomous pilot. 1 #12;1 Introduction Single track vehicles (STV) present somewhat different challenges than

  3. Genetic Algorithms for Open Shop Scheduling and ReScheduling Sushil J. Louis Zhijie Xu

    E-print Network

    Louis, Sushil J.

    Genetic Algorithms for Open Shop Scheduling and Re璖cheduling Sushil J. Louis Zhijie Xu Department into the genetic algorithm's population to speed up and augment genetic search on a related open shop re system quickly finds better solutions than the genetic algorithm alone. Keywords: Genetic Algorithms

  4. An improved localization algorithm based on genetic algorithm in wireless sensor networks.

    PubMed

    Peng, Bo; Li, Lei

    2015-04-01

    Wireless sensor network (WSN) are widely used in many applications. A WSN is a wireless decentralized structure network comprised of nodes, which autonomously set up a network. The node localization that is to be aware of position of the node in the network is an essential part of many sensor network operations and applications. The existing localization algorithms can be classified into two categories: range-based and range-free. The range-based localization algorithm has requirements on hardware, thus is expensive to be implemented in practice. The range-free localization algorithm reduces the hardware cost. Because of the hardware limitations of WSN devices, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. However, these techniques usually have higher localization error compared to the range-based algorithms. DV-Hop is a typical range-free localization algorithm utilizing hop-distance estimation. In this paper, we propose an improved DV-Hop algorithm based on genetic algorithm. Simulation results show that our proposed algorithm improves the localization accuracy compared with previous algorithms. PMID:25852782

  5. Evolving homeostatic tissue using genetic algorithms

    PubMed Central

    Gerlee, Philip; Basanta, David; Anderson, Alexander R.A.

    2013-01-01

    Multicellular organisms maintain form and function through a multitude of homeostatic mechanisms. The details of these mechanisms are in many cases unknown, and so are their evolutionary origin and their link to development. In order to illuminate these issues we have investigated the evolution of structural homeostasis in the simplest of cases, a tissue formed by a mono-layer of cells. To this end, we made use of a 3-dimensional hybrid cellular automaton, an individual-based model in which the behaviour of each cell depends on its local environment. Using an evolutionary algorithm (EA) we evolved cell signalling networks, both with a fixed and an incremental fitness evaluation, which give rise to and maintain a mono-layer tissue structure. Analysis of the solutions provided by the EA shows that the two evaluation methods gives rise to different types of solutions to the problem of homeostasis. The fixed method leads to almost optimal solutions, where the tissue relies on a high rate of cell turnover, while the solutions from the incremental scheme behave in a more conservative manner, only dividing when necessary. In order to test the robustness of the solutions we subjected them to environmental stress, by wounding the tissue, and to genetic stress, by introducing mutations. The results show that the robustness very much depends on the mechanism responsible for maintaining homeostasis. The two evolved cell types analysed present contrasting mechanisms by which tissue homeostasis can be maintained. This compares well to different tissue types found in multicellular organisms. For example the epithelial cells lining the colon in humans are shed at a considerable rate, while in other tissue types, which are not as exposed, the conservative type of homeostatic mechanism is normally found. These results will hopefully shed light on how multicellular organisms have evolved homeostatic mechanisms and what might occur when these mechanisms fail, as in the case of cancer. PMID:21419156

  6. Mobile transporter path planning using a genetic algorithm approach

    NASA Technical Reports Server (NTRS)

    Baffes, Paul; Wang, Lui

    1988-01-01

    The use of an optimization technique known as a genetic algorithm for solving the mobile transporter path planning problem is investigated. The mobile transporter is a traveling robotic vehicle proposed for the Space Station which must be able to reach any point of the structure autonomously. Specific elements of the genetic algorithm are explored in both a theoretical and experimental sense. Recent developments in genetic algorithm theory are shown to be particularly effective in a path planning problem domain, though problem areas can be cited which require more research. However, trajectory planning problems are common in space systems and the genetic algorithm provides an attractive alternative to the classical techniques used to solve these problems.

  7. Holographic diffuser design using a modified genetic algorithm

    E-print Network

    Yao, Jianping

    Holographic diffuser design using a modified genetic algorithm Mengtao Wen Jianping Yao, MEMBER SPIE Microwave Photonics Research Laboratory School of Information Technology and Engineering SPIE Nanyang Technological University School of Electrical and Electronic Engineering Nanyang Avenue

  8. Optimization of computer-generated binary holograms using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Cojoc, Dan; Alexandrescu, Adrian

    1999-11-01

    The aim of this paper is to compare genetic algorithms against direct point oriented coding in the design of binary phase Fourier holograms, computer generated. These are used as fan-out elements for free space optical interconnection. Genetic algorithms are optimization methods which model the natural process of genetic evolution. The configuration of the hologram is encoded to form a chromosome. To start the optimization, a population of different chromosomes randomly generated is considered. The chromosomes compete, mate and mutate until the best chromosome is obtained according to a cost function. After explaining the operators that are used by genetic algorithms, this paper presents two examples with 32 X 32 genes in a chromosome. The crossover type and the number of mutations are shown to be important factors which influence the convergence of the algorithm. GA is demonstrated to be a useful tool to design namely binary phase holograms of complicate structures.

  9. Genetic Algorithms applications to optimization and system identification

    E-print Network

    Lin, Yun-Jeng

    1998-01-01

    Genetic Algorithms (GA) are very different from the traditional optimization techniques. GA is a new generation of artificial intelligence and its principles mimic the behavior of the biologic genes in the natural world. Its execution is simple...

  10. Variable ordering optimization of ROBDD using genetic algorithm

    E-print Network

    Ha, Chunghun

    2000-01-01

    for large-sized Boolean functions because of the hugh computation time and lack of computer memory. The above mentioned weaknesses can be overcome by simplifying the procedure of genetic algorithm, improving construction methods of ROBDD, and developing new...

  11. REPRESENTING RECTILINEAR STEINER TREES IN GENETIC ALGORITHMS

    E-print Network

    Julstrom, Bryant A.

    of Computer Science St. Cloud State University 720 Fourth Avenue South St. Cloud, MN 56301 julstrom and with popula- tions seeded with a single chromosome that represented a short rectilinear Steiner tree. The algorithm identi- #12;ed much shorter trees using the weighted coding, and seeding the population improved

  12. Superscattering of light optimized by a genetic algorithm

    SciTech Connect

    Mirzaei, Ali Miroshnichenko, Andrey E.; Shadrivov, Ilya V.; Kivshar, Yuri S.

    2014-07-07

    We analyse scattering of light from multi-layer plasmonic nanowires and employ a genetic algorithm for optimizing the scattering cross section. We apply the mode-expansion method using experimental data for material parameters to demonstrate that our genetic algorithm allows designing realistic core-shell nanostructures with the superscattering effect achieved at any desired wavelength. This approach can be employed for optimizing both superscattering and cloaking at different wavelengths in the visible spectral range.

  13. Internal quantum efficiency analysis of solar cell by genetic algorithm

    SciTech Connect

    Xiong, Kanglin; Yang, Hui; Lu, Shulong; Zhou, Taofei; Wang, Rongxin; Qiu, Kai; Dong, Jianrong; Jiang, Desheng

    2010-11-15

    To investigate factors limiting the performance of a GaAs solar cell, genetic algorithm is employed to fit the experimentally measured internal quantum efficiency (IQE) in the full spectra range. The device parameters such as diffusion lengths and surface recombination velocities are extracted. Electron beam induced current (EBIC) is performed in the base region of the cell with obtained diffusion length agreeing with the fit result. The advantage of genetic algorithm is illustrated. (author)

  14. Genetic-Algorithm Tool For Search And Optimization

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven

    1995-01-01

    SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

  15. Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms

    E-print Network

    Gibbs, Trevor Howard

    2011-08-08

    PLACEMENT OPTIMIZATION IN GAS RESERVOIRS USING GENETIC ALGORITHMS A Thesis by TREVOR HOWARD GIBBS Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE May 2010 Major Subject: Petroleum Engineering HORIZONTAL WELL PLACEMENT OPTIMIZATION IN GAS RESERVOIRS USING GENETIC ALGORITHMS A Thesis by TREVOR HOWARD GIBBS Submitted to the Office of Graduate Studies of Texas A...

  16. A novel algorithm combining finite state method and genetic algorithm for solving crude oil scheduling problem.

    PubMed

    Duan, Qian-Qian; Yang, Gen-Ke; Pan, Chang-Chun

    2014-01-01

    A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method. PMID:24772031

  17. An Agent Inspired Reconfigurable Computing Implementation of a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Weir, John M.; Wells, B. Earl

    2003-01-01

    Many software systems have been successfully implemented using an agent paradigm which employs a number of independent entities that communicate with one another to achieve a common goal. The distributed nature of such a paradigm makes it an excellent candidate for use in high speed reconfigurable computing hardware environments such as those present in modem FPGA's. In this paper, a distributed genetic algorithm that can be applied to the agent based reconfigurable hardware model is introduced. The effectiveness of this new algorithm is evaluated by comparing the quality of the solutions found by the new algorithm with those found by traditional genetic algorithms. The performance of a reconfigurable hardware implementation of the new algorithm on an FPGA is compared to traditional single processor implementations.

  18. The search for black hole binaries using a genetic algorithm

    E-print Network

    Antoine Petiteau; Yu Shang; Stanislav Babak

    2009-08-25

    In this work we use genetic algorithm to search for the gravitational wave signal from the inspiralling massive Black Hole binaries in the simulated LISA data. We consider a single signal in the Gaussian instrumental noise. This is a first step in preparation for analysis of the third round of the mock LISA data challenge. We have extended a genetic algorithm utilizing the properties of the signal and the detector response function. The performance of this method is comparable, if not better, to already existing algorithms.

  19. A simple algorithm for optimization and model fitting: AGA (asexual genetic algorithm)

    NASA Astrophysics Data System (ADS)

    Cant, J.; Curiel, S.; Mart韓ez-G髆ez, E.

    2009-07-01

    Context: Mathematical optimization can be used as a computational tool to obtain the optimal solution to a given problem in a systematic and efficient way. For example, in twice-differentiable functions and problems with no constraints, the optimization consists of finding the points where the gradient of the objective function is zero and using the Hessian matrix to classify the type of each point. Sometimes, however it is impossible to compute these derivatives and other type of techniques must be employed such as the steepest descent/ascent method and more sophisticated methods such as those based on the evolutionary algorithms. Aims: We present a simple algorithm based on the idea of genetic algorithms (GA) for optimization. We refer to this algorithm as AGA (asexual genetic algorithm) and apply it to two kinds of problems: the maximization of a function where classical methods fail and model fitting in astronomy. For the latter case, we minimize the chi-square function to estimate the parameters in two examples: the orbits of exoplanets by taking a set of radial velocity data, and the spectral energy distribution (SED) observed towards a YSO (Young Stellar Object). Methods: The algorithm AGA may also be called genetic, although it differs from standard genetic algorithms in two main aspects: a) the initial population is not encoded; and b) the new generations are constructed by asexual reproduction. Results: Applying our algorithm in optimizing some complicated functions, we find the global maxima within a few iterations. For model fitting to the orbits of exoplanets and the SED of a YSO, we estimate the parameters and their associated errors.

  20. Genetic Algorithms In Software and In Hardware ---A Performance Analysis Of Workstation and Custom Computing Machine

    E-print Network

    Nelson, Brent E.

    Genetic Algorithms In Software and In Hardware --- A Performance Analysis Of Workstation and Custom implementation we found that a simple four璅PGA genetic algorithm design outperforms a state. 1.1 Genetic Algorithms Genetic algorithms are probabilistic search tech niques frequently applied

  1. The Genetic Algorithm is Useful to Fitting Input Probability Distributions for Simulation Models

    E-print Network

    Strelen, Christoph

    The Genetic Algorithm is Useful to Fitting Input Probability Distributions for Simulation Models, Genetic Algorithm ABSTRACT The genetic algorithm can be applied to selecting theoretical probability the genetic algorithm, one can decide which one of some different families of prob- ability distributions

  2. Reversed Genetic Algorithms for Generation of Bijective S-boxes with Good Cryptographic Properties

    E-print Network

    International Association for Cryptologic Research (IACR)

    Reversed Genetic Algorithms for Generation of Bijective S-boxes with Good Cryptographic Properties of heuristic approaches. Among the latter are the genetic algorithms. In this paper, a genetic algorithm structure and possess no linear redundancy. Keywords: Genetic Algorithms, S-boxes, Nonlinearity 1

  3. OPTIMAL SAMPLING IN A NOISY GENETIC ALGORITHM FOR RISK-BASED REMEDIATION DESIGN

    E-print Network

    Minsker, Barbara S.

    OPTIMAL SAMPLING IN A NOISY GENETIC ALGORITHM FOR RISK-BASED REMEDIATION DESIGN BY GAYATHRI a noisy genetic algorithm to identify promising risk-based corrective action designs [Smalley et al, 2000]. Noisy genetic algorithms are simple genetic algorithms that operate in noisy environments. The noisy

  4. Using Genetic Algorithms for Data Mining Optimization in an Educational Web-based System

    E-print Network

    Using Genetic Algorithms for Data Mining Optimization in an Educational Web-based System Behrouz Minaei-Bidgoli1 , William F. Punch III 1 1 Genetic Algorithms Research and Applications Group (GARAGe to the learner as to how to best proceed. 2 Map the problem to Genetic Algorithm Genetic Algorithms have been

  5. Multiple Query Evaluation Based on an Enhanced Genetic Algorithm.

    ERIC Educational Resources Information Center

    Tamine, Lynda; Chrisment, Claude; Boughanem, Mohand

    2003-01-01

    Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation

  6. Optimization of genomic selection training populations with a genetic algorithm

    Technology Transfer Automated Retrieval System (TEKTRAN)

    In this article, we derive a computationally efficient statistic to measure the reliability of estimates of genetic breeding values for a fixed set of genotypes based on a given training set of genotypes and phenotypes. We adopt a genetic algorithm scheme to find a training set of certain size from ...

  7. Fuzzy Information Retrieval Using Genetic Algorithms and Relevance Feedback.

    ERIC Educational Resources Information Center

    Petry, Frederick E.; And Others

    1993-01-01

    Describes an approach that combines concepts from information retrieval, fuzzy set theory, and genetic programing to improve weighted Boolean query formulation via relevance feedback. Highlights include background on information retrieval systems; genetic algorithms; subproblem formulation; and preliminary results based on a testbed. (Contains 12

  8. Genetic Algorithms Can Improve the Construction of D-Optimal Experimental Designs

    E-print Network

    Zell, Andreas

    Genetic Algorithms Can Improve the Construction of D-Optimal Experimental Designs J. POLAND, A better results. Key-Words: - Genetic Algorithm, Memetic Algorithm, Design of Experiments, DOE, D-Optimal algorithms for constructing D- optimal designs are Monte Carlo algorithms, heuristics, that base on the idea

  9. A parallel genetic algorithm for the set partitioning problem

    SciTech Connect

    Levine, D.

    1994-05-01

    In this dissertation the author reports on his efforts to develop a parallel genetic algorithm and apply it to the solution of set partitioning problem -- a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. He developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set partitioning problem. The genetic algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their subpopulation and occasionally fit strings migrate between the subpopulations. Tests on forty real-world set partitioning problems were carried out on up to 128 nodes of an IBM SP1 parallel computer. The authors found that performance, as measured by the quality of the solution found and the iteration on which it was found, improved as additional subpopulation found and the iteration on which it was found, improved as additional subpopulations were added to the computation. With larger numbers of subpopulations the genetic algorithm was regularly able to find the optimal solution to problems having up to a few thousand integer variables. In two cases, high-quality integer feasible solutions were found for problems with 36,699 and 43,749 integer variables, respectively. A notable limitation they found was the difficulty solving problems with many constraints.

  10. Genetic algorithm and image processing for osteoporosis diagnosis.

    PubMed

    Jennane, R; Almhdie-Imjabber, A; Hambli, R; Ucan, O N; Benhamou, C L

    2010-01-01

    Osteoporosis is considered as a major public health threat. It is characterized by a decrease in the density of bone, decreasing its strength and leading to an increased risk of fracture. In this work, the morphological, topological and mechanical characteristics of 2 populations of arthritic and osteoporotic trabecular bone samples are evaluated using artificial intelligence and recently developed skeletonization algorithms. Results show that genetic algorithms associated with image processing tools can precisely separate the 2 populations. PMID:21096487

  11. Constrained minimization of smooth functions using a genetic algorithm

    NASA Technical Reports Server (NTRS)

    Moerder, Daniel D.; Pamadi, Bandu N.

    1994-01-01

    The use of genetic algorithms for minimization of differentiable functions that are subject to differentiable constraints is considered. A technique is demonstrated for converting the solution of the necessary conditions for a constrained minimum into an unconstrained function minimization. This technique is extended as a global constrained optimization algorithm. The theory is applied to calculating minimum-fuel ascent control settings for an energy state model of an aerospace plane.

  12. Genetic algorithms in optimal multistage distribution network planning

    SciTech Connect

    Miranda, V.; Ranito, J.V.; Proenca, L.M. )

    1994-11-01

    This paper describes a genetic algorithm approach to the optimal multistage planning of distribution networks. The authors describe a mathematical and algorithmic model that they have developed and experimented with success. The paper also presents application examples, with real size systems. The advantages of adopting this new approach are discussed in the planning context, namely in conjunction with the adoption of multicriteria decision making methods.

  13. Hierarchical Genetic Algorithm Approach to Determine Pulse Sequences in NMR

    E-print Network

    Ashok Ajoy; Anil Kumar

    2009-12-04

    We develop a new class of genetic algorithm that computationally determines efficient pulse sequences to implement a quantum gate U in a three-qubit system. The method is shown to be quite general, and the same algorithm can be used to derive efficient sequences for a variety of target matrices. We demonstrate this by implementing the inversion-on-equality gate efficiently when the spin-spin coupling constants $J_{12}=J_{23}=J$ and $J_{13}=0$. We also propose new pulse sequences to implement the Parity gate and Fanout gate, which are about 50% more efficient than the previous best efforts. Moreover, these sequences are shown to require significantly less RF power for their implementation. The proposed algorithm introduces several new features in the conventional genetic algorithm framework. We use matrices instead of linear chains, and the columns of these matrices have a well defined hierarchy. The algorithm is a genetic algorithm coupled to a fast local optimizer, and is hence a hybrid GA. It shows fast convergence, and running on a MATLAB platform takes about 20 minutes on a standard personal computer to derive efficient pulse sequences for any target 8X8 matrix $U$.

  14. Optimization of experimental design in fMRI: a general framework using a genetic algorithm

    E-print Network

    Optimization of experimental design in fMRI: a general framework using a genetic algorithm Tor D uses a genetic algorithm (GA), a class of flexible search algorithms that optimize designs with respect genetic algorithms may be applied to experimental design for fMRI, and we use the framework to explore

  15. A Hybrid Genetic Algorithm for the Point to Multipoint Routing Problem with

    E-print Network

    Wainwright, Roger L.

    A Hybrid Genetic Algorithm for the Point to Multipoint Routing Problem with Single Split Paths Words: Genetic Algorithm, Steiner Trees, Point to Multipoint Routing, Telecommunications Network to Multipoint Routing Problem with Single Split Paths. Our hybrid algorithm uses a genetic algorithm

  16. Genetic algorithms used for the optimization of light-emitting diodes and solar thermal collectors

    E-print Network

    Mayer, Alexandre

    Genetic algorithms used for the optimization of light-emitting diodes and solar thermal collectors of Namur, Rempart de la Vierge 8, 5000 Namur, Belgium ABSTRACT We present a genetic algorithm (GA) we algorithms for addressing complex problems in physics. Keywords: genetic algorithm, optimization, light

  17. Application of Genetic Algorithms to Molecular Biology: Locating Putative Protein Signal Sequences

    E-print Network

    Levin, Michael

    Application of Genetic Algorithms to Molecular Biology: Locating Putative Protein Signal Sequences-7758 mlevin@husc.harvard.edu #12;Summary This paper presents an application of genetic algorithms to a problem difficult task. No good algorithm currently exists for locating brand new signals. A genetic algorithm

  18. A genetic algorithm approach in interface and surface structure optimization

    SciTech Connect

    Zhang, Jian

    2010-05-16

    The thesis is divided into two parts. In the first part a global optimization method is developed for the interface and surface structures optimization. Two prototype systems are chosen to be studied. One is Si[001] symmetric tilted grain boundaries and the other is Ag/Au induced Si(111) surface. It is found that Genetic Algorithm is very efficient in finding lowest energy structures in both cases. Not only existing structures in the experiments can be reproduced, but also many new structures can be predicted using Genetic Algorithm. Thus it is shown that Genetic Algorithm is a extremely powerful tool for the material structures predictions. The second part of the thesis is devoted to the explanation of an experimental observation of thermal radiation from three-dimensional tungsten photonic crystal structures. The experimental results seems astounding and confusing, yet the theoretical models in the paper revealed the physics insight behind the phenomena and can well reproduced the experimental results.

  19. Engineering design optimization using species-conserving genetic algorithms

    NASA Astrophysics Data System (ADS)

    Li, Jian-Ping; Balazs, M. E.; Parks, G. T.

    2007-03-01

    The species conservation technique described here, in which the population of a genetic algorithm is divided into several groups according to their similarity, is inspired by ecology. Each group with similar characteristics is called a species and is centred on a dominating individual, called the species seed. A genetic algorithm based on this species conservation technique, called the species-conserving genetic algorithm (SCGA), was established and has been proved to be effective in finding multiple solutions of multimodal optimization problems. In this article, the SCGA is used to solve engineering design optimization problems. Different distance measures (measures of similarity) are investigated to analyse the performance of the SCGA. It is shown that the Euclidean distance is not the only possible basis for defining a species and sometimes may not make sense in engineering applications. Two structural design problems are used to demonstrate how the choice of a meaningful measure of similarity will help the exploration for significant designs.

  20. The multi-niche crowding genetic algorithm: Analysis and applications

    SciTech Connect

    Cedeno, W.

    1995-09-01

    The ability of organisms to evolve and adapt to the environment has provided mother nature with a rich and diverse set of species. Only organisms well adapted to their environment can survive from one generation to the next, transferring on the traits, that made them successful, to their offspring. Competition for resources and the ever changing environment drives some species to extinction and at the same time others evolve to maintain the delicate balance in nature. In this disertation we present the multi-niche crowding genetic algorithm, a computational metaphor to the survival of species in ecological niches in the face of competition. The multi-niche crowding genetic algorithm maintains stable subpopulations of solutions in multiple niches in multimodal landscapes. The algorithm introduces the concept of crowding selection to promote mating among members with qirnilar traits while allowing many members of the population to participate in mating. The algorithm uses worst among most similar replacement policy to promote competition among members with similar traits while allowing competition among members of different niches as well. We present empirical and theoretical results for the success of the multiniche crowding genetic algorithm for multimodal function optimization. The properties of the algorithm using different parameters are examined. We test the performance of the algorithm on problems of DNA Mapping, Aquifer Management, and the File Design Problem. Applications that combine the use of heuristics and special operators to solve problems in the areas of combinatorial optimization, grouping, and multi-objective optimization. We conclude by presenting the advantages and disadvantages of the algorithm and describing avenues for future investigation to answer other questions raised by this study.

  1. Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm

    NASA Astrophysics Data System (ADS)

    Zu, Yun-Xiao; Zhou, Jie

    2012-01-01

    Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algorithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.

  2. Genetic Algorithms and the Search for Viable String Vacua

    E-print Network

    Steven Abel; John Rizos

    2014-06-16

    Genetic Algorithms are introduced as a search method for finding string vacua with viable phenomenological properties. It is shown, by testing them against a class of Free Fermionic models, that they are orders of magnitude more efficient than a randomised search. As an example, three generation, exophobic, Pati-Salam models with a top Yukawa occur once in every 10^{10} models, and yet a Genetic Algorithm can find them after constructing only 10^5 examples. Such non-deterministic search methods may be the only means to search for Standard Model string vacua with detailed phenomenological requirements.

  3. Genetic Algorithm Modeling with GPU Parallel Computing Technology

    E-print Network

    Cavuoti, Stefano; Brescia, Massimo; Pescap, Antonio; Longo, Giuseppe; Ventre, Giorgio

    2012-01-01

    We present a multi-purpose genetic algorithm, designed and implemented with GPGPU / CUDA parallel computing technology. The model was derived from a multi-core CPU serial implementation, named GAME, already scientifically successfully tested and validated on astrophysical massive data classification problems, through a web application resource (DAMEWARE), specialized in data mining based on Machine Learning paradigms. Since genetic algorithms are inherently parallel, the GPGPU computing paradigm has provided an exploit of the internal training features of the model, permitting a strong optimization in terms of processing performances and scalability.

  4. Air data system optimization using a genetic algorithm

    NASA Technical Reports Server (NTRS)

    Deshpande, Samir M.; Kumar, Renjith R.; Seywald, Hans; Siemers, Paul M., III

    1992-01-01

    An optimization method for flush-orifice air data system design has been developed using the Genetic Algorithm approach. The optimization of the orifice array minimizes the effect of normally distributed random noise in the pressure readings on the calculation of air data parameters, namely, angle of attack, sideslip angle and freestream dynamic pressure. The optimization method is applied to the design of Pressure Distribution/Air Data System experiment (PD/ADS) proposed for inclusion in the Aeroassist Flight Experiment (AFE). Results obtained by the Genetic Algorithm method are compared to the results obtained by conventional gradient search method.

  5. Genetic Algorithms and the Search for Viable String Vacua

    E-print Network

    Abel, Steven

    2014-01-01

    Genetic Algorithms are introduced as a search method for finding string vacua with viable phenomenological properties. It is shown, by testing them against a class of Free Fermionic models, that they are orders of magnitude more efficient than a randomised search. As an example, three generation, exophobic, Pati-Salam models with a top Yukawa occur once in every 10^{10} models, and yet a Genetic Algorithm can find them after constructing only 10^5 examples. Such non-deterministic search methods may be the only means to search for Standard Model string vacua with detailed phenomenological requirements.

  6. Acoustic design of rotor blades using a genetic algorithm

    NASA Technical Reports Server (NTRS)

    Wells, V. L.; Han, A. Y.; Crossley, W. A.

    1995-01-01

    A genetic algorithm coupled with a simplified acoustic analysis was used to generate low-noise rotor blade designs. The model includes thickness, steady loading and blade-vortex interaction noise estimates. The paper presents solutions for several variations in the fitness function, including thickness noise only, loading noise only, and combinations of the noise types. Preliminary results indicate that the analysis provides reasonable assessments of the noise produced, and that genetic algorithm successfully searches for 'good' designs. The results show that, for a given required thrust coefficient, proper blade design can noticeably reduce the noise produced at some expense to the power requirements.

  7. Genetic algorithms and the search for viable string vacua

    NASA Astrophysics Data System (ADS)

    Abel, Steven; Rizos, John

    2014-08-01

    Genetic Algorithms are introduced as a search method for finding string vacua with viable phenomenological properties. It is shown, by testing them against a class of Free Fermionic models, that they are orders of magnitude more efficient than a randomised search. As an example, three generation, exophobic, Pati-Salam models with a top Yukawa occur once in every 1010 models, and yet a Genetic Algorithm can find them after constructing only 105 examples. Such non-deterministic search methods may be the only means to search for Standard Model string vacua with detailed phenomenological requirements.

  8. The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

    PubMed Central

    Ahmed, Zakir Hussain

    2014-01-01

    The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The problem is NP-hard, and it arises in practical transportation and sequencing problems. This paper develops a hybrid genetic algorithm using sequential constructive crossover, 2-opt search, and a local search for obtaining heuristic solution to the problem. The efficiency of the algorithm has been examined against two existing algorithms for some asymmetric and symmetric TSPLIB instances of various sizes. The computational results show that the proposed algorithm is very effective in terms of solution quality and computational time. Finally, we present solution to some more symmetric TSPLIB instances. PMID:24701148

  9. Selection Intensity in Genetic Algorithms with Generation Gaps

    SciTech Connect

    Cantu-Paz, E.

    2000-01-19

    This paper presents calculations of the selection intensity of common selection and replacement methods used in genetic algorithms (GAs) with generation gaps. The selection intensity measures the increase of the average fitness of the population after selection, and it can be used to predict the average fitness of the population at each iteration as well as the number of steps until the population converges to a unique solution. In addition, the theory explains the fast convergence of some algorithms with small generation gaps. The accuracy of the calculations was verified experimentally with a simple test function. The results of this study facilitate comparisons between different algorithms, and provide a tool to adjust the selection pressure, which is indispensable to obtain robust algorithms.

  10. Economic Dispatch Using Genetic Algorithm Based Hybrid Approach

    SciTech Connect

    Tahir Nadeem Malik; Aftab Ahmad; Shahab Khushnood

    2006-07-01

    Power Economic Dispatch (ED) is vital and essential daily optimization procedure in the system operation. Present day large power generating units with multi-valves steam turbines exhibit a large variation in the input-output characteristic functions, thus non-convexity appears in the characteristic curves. Various mathematical and optimization techniques have been developed, applied to solve economic dispatch (ED) problem. Most of these are calculus-based optimization algorithms that are based on successive linearization and use the first and second order differentiations of objective function and its constraint equations as the search direction. They usually require heat input, power output characteristics of generators to be of monotonically increasing nature or of piecewise linearity. These simplifying assumptions result in an inaccurate dispatch. Genetic algorithms have used to solve the economic dispatch problem independently and in conjunction with other AI tools and mathematical programming approaches. Genetic algorithms have inherent ability to reach the global minimum region of search space in a short time, but then take longer time to converge the solution. GA based hybrid approaches get around this problem and produce encouraging results. This paper presents brief survey on hybrid approaches for economic dispatch, an architecture of extensible computational framework as common environment for conventional, genetic algorithm and hybrid approaches based solution for power economic dispatch, the implementation of three algorithms in the developed framework. The framework tested on standard test systems for its performance evaluation. (authors)

  11. Selection of relevant features in a fuzzy genetic learning algorithm.

    PubMed

    Gonzalez, A; Perez, R

    2001-01-01

    Genetic algorithms offer a powerful search method for a variety of learning tasks, and there are different approaches in which they have been applied to learning processes. Structural learning algorithm on vague environment (SLAVE) is a genetic learning algorithm that uses the iterative approach to learn fuzzy rules. SLAVE can select the relevant features of the domain, but when working with large databases the search space is too large and the running time can sometimes be excessive. We propose to improve SLAVE by including a feature selection model in which the genetic algorithm works with individuals (representing individual rules) composed of two structures: one structure representing the relevance status of the involved variables in the rule, the other one representing the assignments variable/value. For this general representation, we study two alternatives depending on the information coded in the first structure. When compared with the initial algorithm, this new approach of SLAVE reduces the number of rules, simplifies the structure of the rules and improves the total accuracy. PMID:18244806

  12. Search for overlapped communities by parallel genetic algorithms

    E-print Network

    Vincenza Carchiolo; Alessandro Longheu; Michele Malgeri; Giuseppe Mangioni

    2009-12-07

    In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive concept of community and the definition of indices of goodness for the obtained results. A lot of algorithms has been presented to reach this goal. In particular, an interesting problem is the search of overlapped communities and it is field seems very interesting a solution based on the use of genetic algorithms. The approach discusses in this paper is based on a parallel implementation of a genetic algorithm and shows the performance benefits of this solution.

  13. Genetic algorithms for multicriteria shape optimization of induction furnace

    NASA Astrophysics Data System (ADS)

    K?s, Pavel; Mach, Franti歟k; Karban, Pavel; Dole瀍l, Ivo

    2012-09-01

    In this contribution we deal with a multi-criteria shape optimization of an induction furnace. We want to find shape parameters of the furnace in such a way, that two different criteria are optimized. Since they cannot be optimized simultaneously, instead of one optimum we find set of partially optimal designs, so called Pareto front. We compare two different approaches to the optimization, one using nonlinear conjugate gradient method and second using variation of genetic algorithm. As can be seen from the numerical results, genetic algorithm seems to be the right choice for this problem. Solution of direct problem (coupled problem consisting of magnetic and heat field) is done using our own code Agros2D. It uses finite elements of higher order leading to fast and accurate solution of relatively complicated coupled problem. It also provides advanced scripting support, allowing us to prepare parametric model of the furnace and simply incorporate various types of optimization algorithms.

  14. Shared Memory Genetic Algorithms in a Multi-Agent Dana Vrajitoru

    E-print Network

    Vrajitoru, Dana

    to our parallel model of genetic algorithms have been used in [10] to distribute the compact geneticShared Memory Genetic Algorithms in a Multi-Agent Context Dana Vrajitoru Intelligent Systems@cs.iusb.edu ABSTRACT In this paper we present a concurrent implementation of genetic algorithms designed for shared

  15. "Offshore Wind farm layout optimization using a Genetic Algorithm" Michael Ameckson

    E-print Network

    Mountziaris, T. J.

    "Offshore Wind farm layout optimization using a Genetic Algorithm" Michael Ameckson Faculty Mentor a Genetic Algorithm. The principle behind Genetic Algorithms is the Darwinian concept of an adaptation procedure based on the mechanics of natural genetics and natural selection. The best fit individual within

  16. Modeling Simple Genetic Algorithms for Permutation Darrell Whitley and NamWook Yoo

    E-print Network

    Whitley, Darrell

    Modeling Simple Genetic Algorithms for Permutation Problems Darrell Whitley and Nam璚ook Yoo@cs.colostate.edu Abstract An exact model of a simple genetic algorithm is developed for permutation based representations INTRODUCTION Several exact models of simple genetic algorithms have been introduced that assume the genetic

  17. Lecture 15 Simulated Annealing and Genetic Algorithm Weinan E1,2

    E-print Network

    Li, Tiejun

    Lecture 15 Simulated Annealing and Genetic Algorithm Weinan E1,2 and Tiejun Li2 1 Department, tieli@pku.edu.cn No.1 Science Building, 1575 #12;Introduction Simulated Annealing Genetic Algorithm Outline Introduction Simulated Annealing Genetic Algorithm #12;Introduction Simulated Annealing Genetic

  18. Stochastic search in structural optimization - Genetic algorithms and simulated annealing

    NASA Technical Reports Server (NTRS)

    Hajela, Prabhat

    1993-01-01

    An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.

  19. AAAA Genetic AlgorithmGenetic AlgorithmGenetic AlgorithmGenetic Algorithm----based Level Sbased Level Sbased Level Sbased Level Setetetet CurveCurveCurveCurve Evolution for Prostate Segmentation on Pelvic CTEvolution for Prostate Segmentation on Pelvic CT

    E-print Network

    Mitchell, Melanie

    . KEYWORDS Genetic algorithm, Medical image processing, Level set method, Segmentation, Prostate cancer. #12 Level Sbased Level Sbased Level Setetetet CurveCurveCurveCurve Evolution for Prostate Segmentation on Pelvic CTEvolution for Prostate Segmentation on Pelvic CTEvolution for Prostate Segmentation on Pelvic

  20. Crossover Improvement for the Genetic Algorithm in Information Retrieval.

    ERIC Educational Resources Information Center

    Vrajitoru, Dana

    1998-01-01

    In information retrieval (IR), the aim of genetic algorithms (GA) is to help a system to find, in a huge documents collection, a good reply to a query expressed by the user. Analysis of phenomena seen during the implementation of a GA for IR has led to a new crossover operation, which is introduced and compared to other learning methods.

  1. Applying Genetic Algorithms To Query Optimization in Document Retrieval.

    ERIC Educational Resources Information Center

    Horng, Jorng-Tzong; Yeh, Ching-Chang

    2000-01-01

    Proposes a novel approach to automatically retrieve keywords and then uses genetic algorithms to adapt the keyword weights. Discusses Chinese text retrieval, term frequency rating formulas, vector space models, bigrams, the PAT-tree structure for information retrieval, query vectors, and relevance feedback. (Author/LRW)

  2. A Parallel Genetic Algorithm for Automated Electronic Circuit Design

    NASA Technical Reports Server (NTRS)

    Lohn, Jason D.; Colombano, Silvano P.; Haith, Gary L.; Stassinopoulos, Dimitris; Norvig, Peter (Technical Monitor)

    2000-01-01

    We describe a parallel genetic algorithm (GA) that automatically generates circuit designs using evolutionary search. A circuit-construction programming language is introduced and we show how evolution can generate practical analog circuit designs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. We present experimental results as applied to analog filter and amplifier design tasks.

  3. HARDWARE IMPLEMENTATION OF A PARALLELIZED GENETIC ALGORITHM FOR

    E-print Network

    Ricks, Kenneth G.

    HARDWARE IMPLEMENTATION OF A PARALLELIZED GENETIC ALGORITHM FOR TASK SCHEDULING by VIJAY TIRUMALAI in Electrical Engineering in the Department of Electrical and Computer Engineering in the Graduate School of the requirements for the degree of Master of Science in Electrical Engineering. Accepted on behalf of the Faculty

  4. Structural Parameter Estimation Using Modal Responses and Utilizing Genetic Algorithm

    E-print Network

    Hines, Eric

    1 Structural Parameter Estimation Using Modal Responses and Utilizing Genetic Algorithm Behnam Arya1 , Masoud Sanayei2 1 Doctoral Candidate, Dept. of Civil and Environmental Engineering, Tufts University, Medford, MA 2 Associate Professor, Dept. of Civil and Environmental Engineering, Tufts University

  5. Automated Design of Algorithms and Genetic Improvement: Contrast and Commonalities

    E-print Network

    Woodward, John

    . Haraldsson University of Stirling Stirling, Scotland, UK soh@cs.stir.ac.uk John R. Woodward University of Stirling Stirling, Scotland, UK jrw@cs.stir.ac.uk Categories and Subject Descriptors I.2.2 [Automatic Based Soft- ware Engineering (SBSE), Genetic Algorithm (GA) 1. INTRODUCTION Recent decades has seen

  6. Simulating Gender Separation and Mating Constraints for Genetic Algorithms

    E-print Network

    Vrajitoru, Dana

    of the sexual reproduction and of the mating schemes has been an interest of research in GAs and evolutionary and evolved into more intelligent ones. In this context, sexual reproduction is the most important mechanism various reproduction modes and types restrictions from nature with the genetic algorithms. We con- sider

  7. Exploring Very Large State Spaces Using Genetic Algorithms

    E-print Network

    Khurshid, Sarfraz

    Exploring Very Large State Spaces Using Genetic Algorithms Patrice Godefroid1 and Sarfraz Khurshid2 this frame- work in conjunction with VeriSoft, a tool for exploring the state spaces of software applications, thereby mak- ing exhaustive state-space exploration intractable. Several approaches have been proposed

  8. Exploring Very Large State Spaces Using Genetic Algorithms

    E-print Network

    Rajamani, Sriram K.

    Exploring Very Large State Spaces Using Genetic Algorithms Patrice Godefroid 1 and Sarfraz Khurshid this framework in conjunction with VeriSoft, a tool for exploring the state spaces of soft颅 ware applications, thereby mak颅 ing exhaustive state颅space exploration intractable. Several approaches have been proposed

  9. Adaptive mutation rate control schemes in genetic algorithms

    E-print Network

    Utrecht, Universiteit

    Adaptive mutation rate control schemes in genetic algorithms Dirk Thierens institute of information and computing sciences, utrecht university technical report UU-CS-2002-056 www.cs.uu.nl #12; Adaptive mutation Sciences Utrecht Univerisity, The Netherlands Abstract. The adaptation of mutation rate parameter values

  10. Path Cost Optimization Using Genetic Algorithm with Supervised Crossover Operator

    E-print Network

    Tse, Chi K. "Michael"

    Path Cost Optimization Using Genetic Algorithm with Supervised Crossover Operator Chi-Tsun Cheng , Kia Fallahi , Henry Leung and Chi K. Tse Dept. of Electronic & Information Engineering, Hong Kong Polytechnic University, Hong Kong Dept. of Electrical & Computer Engineering, University of Calgary, Calgary

  11. Memory-Based Immigrants for Genetic Algorithms in Dynamic Environments

    E-print Network

    Yang, Shengxiang

    Memory-Based Immigrants for Genetic Algorithms in Dynamic Environments Shengxiang Yang Department optimization problems. Among these approches, random immigrants and memory schemes have shown to be bene- ficial in many dynamic problems. This paper proposes a hybrid memory and random immigrants scheme

  12. GENETIC ALGORITHMS AND SILHOUETTE MEASURES APPLIED TO MICROARRAY DATA CLASSIFICATION

    E-print Network

    Wong, Limsoon

    GENETIC ALGORITHMS AND SILHOUETTE MEASURES APPLIED TO MICROARRAY DATA CLASSIFICATION TSUN-CHEN LIN, RU-SHENG LIU, SHU-YUAN CHEN Dept. of Computer Science and Engineering, Yuan Ze University 135 Yuan Graduate School of Biotechnology and Bioinformatics, Yuan Ze University 135 Yuan-Tung Rd, Nei-Li, Chung

  13. Genetic Algorithms with Lego Mindstorms and Matlab Frank Klassner1

    E-print Network

    Klassner, Frank

    Genetic Algorithms with Lego Mindstorms and Matlab Frank Klassner1 James C Peyton-Jones2 Kurt.klassner,james.peyton-jones,kurt.lehmer}@villanova.edu Abstract This paper presents a case study in combining Lego MindstormsTM NXT with Matlab/Simulink to help. Introduction Robotic systems today are enjoying an increased consideration in education as an "electronic

  14. Evolving Musical Performance Profiles Using Genetic Algorithms with Structural Fitness

    E-print Network

    Miranda, Eduardo Reck

    . This paper presents the first stage of our project, which is a GA- based system that evolves performance.miranda}@plymouth.ac.uk ABSTRACT This paper presents a system that uses Genetic Algorithm (GA) to evolve hierarchical pulse sets (i profile for a piece of music is represented using pulse sets and the fitness (for the GA) is derived from

  15. A parallel genetic algorithm for the set partitioning problem

    SciTech Connect

    Levine, D.

    1996-12-31

    This paper describes a parallel genetic algorithm developed for the solution of the set partitioning problem- a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. The genetic algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their own subpopulation and occasionally fit strings migrate between the subpopulations. Tests on forty real-world set partitioning problems were carried out on up to 128 nodes of an IBM SP1 parallel computer. We found that performance, as measured by the quality of the solution found and the iteration on which it was found, improved as additional subpopulations were added to the computation. With larger numbers of subpopulations the genetic algorithm was regularly able to find the optimal solution to problems having up to a few thousand integer variables. In two cases, high- quality integer feasible solutions were found for problems with 36, 699 and 43,749 integer variables, respectively. A notable limitation we found was the difficulty solving problems with many constraints.

  16. A Genetic Algorithm Approach to Focused Software Usage Testing

    E-print Network

    Wu, Annie S.

    A Genetic Algorithm Approach to Focused Software Usage Testing Robert M. Patton, Annie S. Wu Orlando, FL, U.S.A. ABSTRACT Because software system testing typically consists of only a very small the test results from a limited amount of testing based on high-level usage models. It can also be very

  17. Experiences with the PGAPack Parallel Genetic Algorithm library

    SciTech Connect

    Levine, D.; Hallstrom, P.; Noelle, D.; Walenz, B.

    1997-07-01

    PGAPack is the first widely distributed parallel genetic algorithm library. Since its release, several thousand copies have been distributed worldwide to interested users. In this paper we discuss the key components of the PGAPack design philosophy and present a number of application examples that use PGAPack.

  18. Applying Genetic Algorithms to Hierarchical Task Network Planning

    E-print Network

    Levine, John

    Applying Genetic Algorithms to Hierarchical Task Network Planning Lea H. Ruscio, John Levine to solve hierarchical task network (HTN) planning problems. The knowledge base describes decompositions been tested on two simple domains (logistics and disaster relief), and is now being applied to a more

  19. USING GENETIC ALGORITHMS TO DESIGN ENVIRONMENTALLY FRIENDLY PROCESSES

    EPA Science Inventory

    Genetic algorithm calculations are applied to the design of chemical processes to achieve improvements in environmental and economic performance. By finding the set of Pareto (i.e., non-dominated) solutions one can see how different objectives, such as environmental and economic ...

  20. A comparison of binary and continuous genetic algorithm in parameter estimation of a logistic growth model

    NASA Astrophysics Data System (ADS)

    Windarto, Indratno, S. W.; Nuraini, N.; Soewono, E.

    2014-02-01

    Genetic algorithm is an optimization method based on the principles of genetics and natural selection in life organisms. The algorithm begins by defining the optimization variables, defining the cost function (in a minimization problem) or the fitness function (in a maximization problem) and selecting genetic algorithm parameters. The main procedures in genetic algorithm are generating initial population, selecting some chromosomes (individual) as parent's individual, mating, and mutation. In this paper, binary and continuous genetic algorithms were implemented to estimate growth rate and carrying capacity parameter from poultry data cited from literature. For simplicity, all genetic algorithm parameters (selection rate and mutation rate) are set to be constant along implementation of the algorithm. It was found that by selecting suitable mutation rate, both algorithms can estimate these parameters well. Suitable range for mutation rate in continuous genetic algorithm is wider than the binary one.

  1. JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Globus, Al; Langhirt, Eric; Livny, Miron; Ramamurthy, Ravishankar; Soloman, Marvin; Traugott, Steve

    2000-01-01

    A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

  2. Global structual optimizations of surface systems with a genetic algorithm

    SciTech Connect

    Chuang, Feng-Chuan

    2005-05-01

    Global structural optimizations with a genetic algorithm were performed for atomic cluster and surface systems including aluminum atomic clusters, Si magic clusters on the Si(111) 7 x 7 surface, silicon high-index surfaces, and Ag-induced Si(111) reconstructions. First, the global structural optimizations of neutral aluminum clusters Al{sub n} (n up to 23) were performed using a genetic algorithm coupled with a tight-binding potential. Second, a genetic algorithm in combination with tight-binding and first-principles calculations were performed to study the structures of magic clusters on the Si(111) 7 x 7 surface. Extensive calculations show that the magic cluster observed in scanning tunneling microscopy (STM) experiments consist of eight Si atoms. Simulated STM images of the Si magic cluster exhibit a ring-like feature similar to STM experiments. Third, a genetic algorithm coupled with a highly optimized empirical potential were used to determine the lowest energy structure of high-index semiconductor surfaces. The lowest energy structures of Si(105) and Si(114) were determined successfully. The results of Si(105) and Si(114) are reported within the framework of highly optimized empirical potential and first-principles calculations. Finally, a genetic algorithm coupled with Si and Ag tight-binding potentials were used to search for Ag-induced Si(111) reconstructions at various Ag and Si coverages. The optimized structural models of {radical}3 x {radical}3, 3 x 1, and 5 x 2 phases were reported using first-principles calculations. A novel model is found to have lower surface energy than the proposed double-honeycomb chained (DHC) model both for Au/Si(111) 5 x 2 and Ag/Si(111) 5 x 2 systems.

  3. A Genetic Algorithm Approach to Multiple-Response Optimization

    SciTech Connect

    Ortiz, Francisco; Simpson, James R.; Pignatiello, Joseph J.; Heredia-Langner, Alejandro

    2004-10-01

    Many designed experiments require the simultaneous optimization of multiple responses. A common approach is to use a desirability function combined with an optimization algorithm to find the most desirable settings of the controllable factors. However, as the problem grows even moderately in either the number of factors or the number of responses, conventional optimization algorithms can fail to find the global optimum. An alternative approach is to use a heuristic search procedure such as a genetic algorithm (GA). This paper proposes and develops a multiple-response solution technique using a GA in conjunction with an unconstrained desirability function. The GA requires that several parameters be determined in order for the algorithm to operate effectively. We perform a robust designed experiment in order to tune the genetic algorithm to perform well regardless of the complexity of the multiple-response optimization problem. The performance of the proposed GA method is evaluated and compared with the performance of the method that combines the desirability with the generalized reduced gradient (GRG) optimization. The evaluation shows that only the proposed GA approach consistently and effectively solves multiple-response problems of varying complexity.

  4. Longest jobs first algorithm in solving job shop scheduling using adaptive genetic algorithm (GA)

    NASA Astrophysics Data System (ADS)

    Alizadeh Sahzabi, Vahid; Karimi, Iman; Alizadeh Sahzabi, Navid; Mamaani Barnaghi, Peiman

    2012-01-01

    In this paper, genetic algorithm was used to solve job shop scheduling problems. One example discussed in JSSP (Job Shop Scheduling Problem) and I described how we can solve such these problems by genetic algorithm. The goal in JSSP is to gain the shortest process time. Furthermore I proposed a method to obtain best performance on performing all jobs in shortest time. The method mainly, is according to Genetic algorithm (GA) and crossing over between parents always follows the rule which the longest process is at the first in the job queue. In the other word chromosomes is suggested to sorts based on the longest processes to shortest i.e. "longest job first" says firstly look which machine contains most processing time during its performing all its jobs and that is the bottleneck. Secondly, start sort those jobs which are belonging to that specific machine descending. Based on the achieved results," longest jobs first" is the optimized status in job shop scheduling problems. In our results the accuracy would grow up to 94.7% for total processing time and the method improved 4% the accuracy of performing all jobs in the presented example.

  5. Longest jobs first algorithm in solving job shop scheduling using adaptive genetic algorithm (GA)

    NASA Astrophysics Data System (ADS)

    Alizadeh Sahzabi, Vahid; Karimi, Iman; Alizadeh Sahzabi, Navid; Mamaani Barnaghi, Peiman

    2011-12-01

    In this paper, genetic algorithm was used to solve job shop scheduling problems. One example discussed in JSSP (Job Shop Scheduling Problem) and I described how we can solve such these problems by genetic algorithm. The goal in JSSP is to gain the shortest process time. Furthermore I proposed a method to obtain best performance on performing all jobs in shortest time. The method mainly, is according to Genetic algorithm (GA) and crossing over between parents always follows the rule which the longest process is at the first in the job queue. In the other word chromosomes is suggested to sorts based on the longest processes to shortest i.e. "longest job first" says firstly look which machine contains most processing time during its performing all its jobs and that is the bottleneck. Secondly, start sort those jobs which are belonging to that specific machine descending. Based on the achieved results," longest jobs first" is the optimized status in job shop scheduling problems. In our results the accuracy would grow up to 94.7% for total processing time and the method improved 4% the accuracy of performing all jobs in the presented example.

  6. Data Envelopment Analysis Valid Solutions Genetic algorithm Hybrid metaheuristics Conclusions and future works Using Genetic Algorithms for Maximizing

    E-print Network

    Gim茅nez, Domingo

    of real and binary values. Binary part: b0k ... bjk Real part: k 0k ... jk t- 0k ... t- ik t+ 0k ... t+ rk interior DMU to the boundary of the technology). Genetic Algorithms for DEA Aparicio, Gim麓enez, Gonz

  7. A parametric building energy cost optimization tool based on a genetic algorithm

    E-print Network

    Tan, Xiaowei

    2007-09-17

    % confidence intervals for genetic algorithm solutions with population size P = 100 ...........................................71 Fig. 18. Six decision variables case trend lines of average genetic algorithm solution with different population sizes...

  8. OPTIMIZATION OF TURBOMACHINERY AIRFOILS WITH A GENETIC/SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM

    E-print Network

    Dennis, Brian

    OPTIMIZATION OF TURBOMACHINERY AIRFOILS WITH A GENETIC/SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM words: shape optimization, aerodynamic design, turbomachinery, aerodynamics, genetic algorithms-magneto- gasdynamic effects. In the case of a turbomachinery aerodynamics, sources of entropy production other than

  9. A novel pipeline based FPGA implementation of a genetic algorithm

    NASA Astrophysics Data System (ADS)

    Thirer, Nonel

    2014-05-01

    To solve problems when an analytical solution is not available, more and more bio-inspired computation techniques have been applied in the last years. Thus, an efficient algorithm is the Genetic Algorithm (GA), which imitates the biological evolution process, finding the solution by the mechanism of "natural selection", where the strong has higher chances to survive. A genetic algorithm is an iterative procedure which operates on a population of individuals called "chromosomes" or "possible solutions" (usually represented by a binary code). GA performs several processes with the population individuals to produce a new population, like in the biological evolution. To provide a high speed solution, pipelined based FPGA hardware implementations are used, with a nstages pipeline for a n-phases genetic algorithm. The FPGA pipeline implementations are constraints by the different execution time of each stage and by the FPGA chip resources. To minimize these difficulties, we propose a bio-inspired technique to modify the crossover step by using non identical twins. Thus two of the chosen chromosomes (parents) will build up two new chromosomes (children) not only one as in classical GA. We analyze the contribution of this method to reduce the execution time in the asynchronous and synchronous pipelines and also the possibility to a cheaper FPGA implementation, by using smaller populations. The full hardware architecture for a FPGA implementation to our target ALTERA development card is presented and analyzed.

  10. Strain gage selection in loads equations using a genetic algorithm

    NASA Technical Reports Server (NTRS)

    1994-01-01

    Traditionally, structural loads are measured using strain gages. A loads calibration test must be done before loads can be accurately measured. In one measurement method, a series of point loads is applied to the structure, and loads equations are derived via the least squares curve fitting algorithm using the strain gage responses to the applied point loads. However, many research structures are highly instrumented with strain gages, and the number and selection of gages used in a loads equation can be problematic. This paper presents an improved technique using a genetic algorithm to choose the strain gages used in the loads equations. Also presented are a comparison of the genetic algorithm performance with the current T-value technique and a variant known as the Best Step-down technique. Examples are shown using aerospace vehicle wings of high and low aspect ratio. In addition, a significant limitation in the current methods is revealed. The genetic algorithm arrived at a comparable or superior set of gages with significantly less human effort, and could be applied in instances when the current methods could not.

  11. A Dedicated Genetic Algorithm for Localization of Moving Magnetic Objects

    PubMed Central

    Alimi, Roger; Weiss, Eyal; Ram-Cohen, Tsuriel; Geron, Nir; Yogev, Idan

    2015-01-01

    A dedicated Genetic Algorithm (GA) has been developed to localize the trajectory of ferromagnetic moving objects within a bounded perimeter. Localization of moving ferromagnetic objects is an important tool because it can be employed in situations when the object is obscured. This work is innovative for two main reasons: first, the GA has been tuned to provide an accurate and fast solution to the inverse magnetic field equations problem. Second, the algorithm has been successfully tested using real-life experimental data. Very accurate trajectory localization estimations were obtained over a wide range of scenarios. PMID:26393598

  12. Mass spectrometry cancer data classification using wavelets and genetic algorithm.

    PubMed

    Nguyen, Thanh; Nahavandi, Saeid; Creighton, Douglas; Khosravi, Abbas

    2015-12-21

    This paper introduces a hybrid feature extraction method applied to mass spectrometry (MS) data for cancer classification. Haar wavelets are employed to transform MS data into orthogonal wavelet coefficients. The most prominent discriminant wavelets are then selected by genetic algorithm (GA) to form feature sets. The combination of wavelets and GA yields highly distinct feature sets that serve as inputs to classification algorithms. Experimental results show the robustness and significant dominance of the wavelet-GA against competitive methods. The proposed method therefore can be applied to cancer classification models that are useful as real clinical decision support systems for medical practitioners. PMID:26611346

  13. Implementing Genetic Algorithms on Arduino Micro-Controllers

    E-print Network

    Alves, Nuno

    2010-01-01

    Since their conception in 1975, Genetic Algorithms have been an extremely popular approach to find exact or approximate solutions to optimization and search problems. Over the last years there has been an enhanced interest in the field with related techniques, such as grammatical evolution, being developed. Unfortunately, work on developing genetic optimizations for low-end embedded architectures hasn't embraced the same enthusiasm. This short paper tackles that situation by demonstrating how genetic algorithms can be implemented in Arduino Duemilanove, a 16 MHz open-source micro-controller, with limited computation power and storage resources. As part of this short paper, the libraries used in this implementation are released into the public domain under a GPL license.

  14. Genetic algorithms and their use in Geophysical Problems

    SciTech Connect

    Parker, Paul B.

    1999-04-01

    Genetic algorithms (GAs), global optimization methods that mimic Darwinian evolution are well suited to the nonlinear inverse problems of geophysics. A standard genetic algorithm selects the best or ''fittest'' models from a ''population'' and then applies operators such as crossover and mutation in order to combine the most successful characteristics of each model and produce fitter models. More sophisticated operators have been developed, but the standard GA usually provides a robust and efficient search. Although the choice of parameter settings such as crossover and mutation rate may depend largely on the type of problem being solved, numerous results show that certain parameter settings produce optimal performance for a wide range of problems and difficulties. In particular, a low (about half of the inverse of the population size) mutation rate is crucial for optimal results, but the choice of crossover method and rate do not seem to affect performance appreciably. Optimal efficiency is usually achieved with smaller (< 50) populations. Lastly, tournament selection appears to be the best choice of selection methods due to its simplicity and its autoscaling properties. However, if a proportional selection method is used such as roulette wheel selection, fitness scaling is a necessity, and a high scaling factor (> 2.0) should be used for the best performance. Three case studies are presented in which genetic algorithms are used to invert for crustal parameters. The first is an inversion for basement depth at Yucca mountain using gravity data, the second an inversion for velocity structure in the crust of the south island of New Zealand using receiver functions derived from teleseismic events, and the third is a similar receiver function inversion for crustal velocities beneath the Mendocino Triple Junction region of Northern California. The inversions demonstrate that genetic algorithms are effective in solving problems with reasonably large numbers of free parameters and with computationally expensive objective function calculations. More sophisticated techniques are presented for special problems. Niching and island model algorithms are introduced as methods to find multiple, distinct solutions to the nonunique problems that are typically seen in geophysics. Finally, hybrid algorithms are investigated as a way to improve the efficiency of the standard genetic algorithm.

  15. An Airborne Conflict Resolution Approach Using a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Mondoloni, Stephane; Conway, Sheila

    2001-01-01

    An airborne conflict resolution approach is presented that is capable of providing flight plans forecast to be conflict-free with both area and traffic hazards. This approach is capable of meeting constraints on the flight plan such as required times of arrival (RTA) at a fix. The conflict resolution algorithm is based upon a genetic algorithm, and can thus seek conflict-free flight plans meeting broader flight planning objectives such as minimum time, fuel or total cost. The method has been applied to conflicts occurring 6 to 25 minutes in the future in climb, cruise and descent phases of flight. The conflict resolution approach separates the detection, trajectory generation and flight rules function from the resolution algorithm. The method is capable of supporting pilot-constructed resolutions, cooperative and non-cooperative maneuvers, and also providing conflict resolution on trajectories forecast by an onboard FMC.

  16. Comparing a Coevolutionary Genetic Algorithm for Multiobjective Optimization

    NASA Technical Reports Server (NTRS)

    Lohn, Jason D.; Kraus, William F.; Haith, Gary L.; Clancy, Daniel (Technical Monitor)

    2002-01-01

    We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA finds a solution that dominates solutions produced by eight other algorithms, yet the CGA has poor coverage across the Pareto front.

  17. A Genetic Algorithm to Optimize a Tweet for Retweetability

    E-print Network

    Hochreiter, Ronald

    2014-01-01

    Twitter is a popular microblogging platform. When users send out messages, other users have the ability to forward these messages to their own subgraph. Most research focuses on increasing retweetability from a node's perspective. Here, we center on improving message style to increase the chance of a message being forwarded. To this end, we simulate an artificial Twitter-like network with nodes deciding deterministically on retweeting a message or not. A genetic algorithm is used to optimize message composition, so that the reach of a message is increased. When analyzing the algorithm's runtime behavior across a set of different node types, we find that the algorithm consistently succeeds in significantly improving the retweetability of a message.

  18. Comparative application of artificial neural networks and genetic algorithms for multivariate time-series modelling

    E-print Network

    Fernandez, Thomas

    -a, Microcystis, short-term prediction, artificial neural network model, genetic algorithm model, rule sets of rules or concepts. By contrast, genetic algorithms can derive explicit numerical or linguistic modelsComparative application of artificial neural networks and genetic algorithms for multivariate time

  19. Genetic algorithms based robust frequency estimation of sinusoidal signals with stationary errors

    E-print Network

    Kundu, Debasis

    of the sinusoidal model with high degree of accuracy. Among the proposed methods, the genetic algorithm based leastGenetic algorithms based robust frequency estimation of sinusoidal signals with stationary errors July 2009 Keywords: Genetic algorithms L1-norm estimator Least median estimator Least square estimator

  20. Nonparametric Log--Spectrum Estimation using Disconnected Regression Splines and Genetic Algorithms

    E-print Network

    Lee, Thomas

    selection criterion for choosing a ``best'' fitting model, and 3) a genetic algorithm for effectivelyNonparametric Log--Spectrum Estimation using Disconnected Regression Splines and Genetic Algorithms of estimates for testing spectra 3 and 4 . . . . . . . . . . . . . . . . . 25 Keywords: genetic algorithms, log

  1. Retrieving leaf area index using a genetic algorithm with a canopy radiative transfer model

    E-print Network

    Liang, Shunlin

    Retrieving leaf area index using a genetic algorithm with a canopy radiative transfer model) and the inversion of a canopy radiative transfer (RT) model. In recent years, applications of the genetic algorithms area index; Genetic algorithms; Radiative transfer; Inversion; Landsat-7; ETM+ 1. Introduction Land

  2. Terrain-Based Genetic Algorithm (TBGA): Modeling Parameter Space as Terrain

    E-print Network

    Gordon, Scott

    Terrain-Based Genetic Algorithm (TBGA): Modeling Parameter Space as Terrain V. Scott Gordon Sharp Eclipsys Corp Abstract The Terrain-Based Genetic Algorithm (TBGA) is a self-tuning version of the traditional Cellular Genetic Algorithm (CGA). In a TBGA, various combinations of parameter values appear

  3. Data Abstraction for Cognitive Models of Compositional Design in Genetic Algorithms

    E-print Network

    Peterson, James K

    Data Abstraction for Cognitive Models of Compositional Design in Genetic Algorithms Mary Elizabeth valid optimization strategies for job scheduling using genetic algorithms. Our initial designs strategy known as a genetic algorithm (GA) applied in the domain of job scheduling. A given set of external

  4. A genetic algorithm for scaled-based translocon Sami Laroum1

    E-print Network

    Hao, Jin-Kao

    A genetic algorithm for scaled-based translocon simulation Sami Laroum1 , B磂atrice Duval1 and protein segments which cross the membrane. This paper describes the genetic algorithm that we developed Proteins, Classification, Optimization, Genetic Algorithm. 1 Introduction Membrane proteins play

  5. Inferencing Over Incomplete Solution Spaces with Genetic Algorithms for Probabilistic Reasoning 1

    E-print Network

    Indiana University

    Inferencing Over Incomplete Solution Spaces with Genetic Algorithms for Probabilistic Reasoning 1 Engineering Air Force Institute of Technology Wright璓atterson AFB, OH 454337765 fbborghet Bayesian Knowledge Bases(BKB) using genetic algorithms(GA) . The fitness function for a genetic algorithm

  6. Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks

    E-print Network

    Yang, Shengxiang

    Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks network Dynamic multicast Genetic algorithm Immigrants scheme Dynamic optimization a b s t r a c to the changes accordingly. In this paper, we propose to use genetic algorithms with immigrants schemes to solve

  7. Convex Onion Peeling Genetic Algorithm: An Efficient Solution to Map Labeling of Point-Feature

    E-print Network

    Bae, Wan

    Convex Onion Peeling Genetic Algorithm: An Efficient Solution to Map Labeling of Point-Feature Wan-feature and develop a new genetic algorithm to solve this problem. We adopt a data struc- ture called convex onion peeling and utilize it in our pro- posed Convex Onion Peeling Genetic Algorithm (COPGA) to efficiently

  8. A Diversity-controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows

    E-print Network

    Zhu, Kenny Q.

    A Diversity-controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time] and Morrison, et al. [9]. A Diversity-Control-Oriented Genetic Algorithm was presented in [12], in which@comp.nus.edu.sg Abstract This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem

  9. Evolution of Non-Uniform Cellular Automata using a Genetic Algorithm: Diversity and Computation

    E-print Network

    Wilensky, Uri

    Evolution of Non-Uniform Cellular Automata using a Genetic Algorithm: Diversity and Computation,wrand}@northwestern.edu ABSTRACT We used a genetic algorithm to evaluate the cost / benefit of diversity in evolving sets of rules Keywords: Diversity, Genetic Algorithms, Non-Uniform Cellular Automata, Search Spaces 1. SUMMARY Our

  10. A Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems

    E-print Network

    Kansas, University of

    A Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems Proceedings, using genetic algorithms, producing a generation of robots with superior task performance, compared that perform specific tasks in an environment is evolved by using genetic algorithms, hence producing a better

  11. New applications of the genetic algorithm for the interpretation of high-resolution spectra1

    E-print Network

    Nijmegen, University of

    804 New applications of the genetic algorithm for the interpretation of high-resolution spectra1 W. An alternative approach is unassigned fits of the spectra using genetic algorithms (GAs) with special cost, genetic algorithm, biomolecules, structure, van der Waals clusters. R閟um : La spectroscopie 閘ectronique

  12. INDUCING PARAMETERS OF A DECISION TREE FOR EXPERT SYSTEM SHELL MCESE BY GENETIC ALGORITHM

    E-print Network

    Franek, Frantisek

    INDUCING PARAMETERS OF A DECISION TREE FOR EXPERT SYSTEM SHELL MCESE BY GENETIC ALGORITHM I. Bruha-mail: {bruha | franya}@mcmaster.ca KEYWORDS Expert system shell, genetic algorithms, rule-based sys- tems for the whole knowledge base. Genetic algorithms comprise a long process of evolution of a large population

  13. Simulated annealing, weighted simulated an nealing and genetic algorithm at work

    E-print Network

    Besse, Philippe

    Simulated annealing, weighted simulated an nealing and genetic algorithm at work Fran and genetic algorithm are compared when using a sample to minimize an objective function which efficient than the genetic algorithm. With regard to the bias problem, the randomly weighted version

  14. INCORPORATING WITHIN-HOUSEHOLD INTERACTIONS INTO A MODE CHOICE MODEL USING A GENETIC ALGORITHM FOR PARAMETER

    E-print Network

    Toronto, University of

    INCORPORATING WITHIN-HOUSEHOLD INTERACTIONS INTO A MODE CHOICE MODEL USING A GENETIC ALGORITHM is used in parallel to perform the necessary calculations and a genetic algorithm is used for parameter and a genetic algorithm is used for parameter estimation. The next section of this paper discusses some

  15. Journal of Computational Acoustics, SUBSPACE APPROACH TO INVERSION BY GENETIC ALGORITHMS

    E-print Network

    Gerstoft, Peter

    Journal of Computational Acoustics, fc IMACS SUBSPACE APPROACH TO INVERSION BY GENETIC ALGORITHMS;2 and genetic algorithms3;4 to search over the space of likely values of the unknown parameters. The ease is computed using the OASES wavenumber integration code8;9 as the forward model. 2.2. Genetic algorithms

  16. Genetic algorithm and M-estimator based robust sequential estimation of parameters of nonlinear sinusoidal signals

    E-print Network

    Kundu, Debasis

    Genetic algorithm and M-estimator based robust sequential estimation of parameters of nonlinear online xxxx Keywords: Elitism Generational genetic algorithm M-estimator Nonlinear least squares Periodogram estimates Real-coded genetic algorithm Robust estimation Sequential estimation Speech signals a b

  17. Novel Use of a Genetic Algorithm for Protein Structure Prediction: Searching Template and Sequence

    E-print Network

    Moreira, Bruno Contreras

    Novel Use of a Genetic Algorithm for Protein Structure Prediction: Searching Template and Sequence Laboratories, London, United Kingdom ABSTRACT A novel genetic algorithm was ap- plied to all CASP5 targets recognition; comparative model- ing; genetic algorithms; template selec- tion; alignment errors INTRODUCTION

  18. Multi-agent Communication Disorders: Dynamic Breeding Networks in Genetic Algorithms

    E-print Network

    Wilensky, Uri

    Multi-agent Communication Disorders: Dynamic Breeding Networks in Genetic Algorithms Forrest in Genetic Algorithms Slide 2 / 42 Summary In an ABM, agents communicate. These interactions form a social. #12;Multi-agent Communication Disorders: Dynamic Breeding Networks in Genetic Algorithms Slide 3 / 42

  19. A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge

    E-print Network

    International Association for Cryptologic Research (IACR)

    A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge Dan Ding1 , Guizhen Zhu2, China P. R. Abstract. In this paper, we propose a genetic algorithm for solving the shortest vector pruning. The experimental results show that the genetic algorithm runs rather good on the SVP challenge

  20. A Distributed Genetic Algorithm for Parameters Optimization to Detect Microcalcifications in

    E-print Network

    Lanconelli, Nico

    A Distributed Genetic Algorithm for Parameters Optimization to Detect Microcalcifications obtained by applying a distributed genetic algorithm to a problem of parameter op- timization in medical the performance of our system. A distributed genetic algorithm supervising this process allowed to improve of some

  1. A Genetic Algorithm Analysis of N Resonances in p ( ; K + ) Reactions

    E-print Network

    Gent, Universiteit

    A Genetic Algorithm Analysis of N #3; Resonances in p ( ; K + ) #3; Reactions D.G. Ireland #3 resonances cannot be ruled out. Our genetic algorithm method predicts that photon beam asymmetry and double resonances. Key words: Nucleon resonances, Genetic algorithms, Kaon Production PACS: 14.20.Gk, 13.60.Le, 02

  2. Superscattering of light optimized by a genetic algorithm Ali Mirzaei,a)

    E-print Network

    Superscattering of light optimized by a genetic algorithm Ali Mirzaei,a) Andrey E. Miroshnichenko nanowires and employ a genetic algorithm for optimizing the scattering cross section. We apply the mode-expansion method using experimental data for material parameters to demonstrate that our genetic algorithm allows

  3. Beyond the Rotamer Library: Genetic Algorithm Combined with the Disturbing Mutation Process for Upbuilding

    E-print Network

    Luhua, Lai

    Beyond the Rotamer Library: Genetic Algorithm Combined with the Disturbing Mutation Process, China ABSTRACT The disturbing genetic algorithm, incorporating the disturbing mutation process into the genetic algorithm flow, has been developed to extend the searching space of side-chain conforma- tions

  4. A Hardware Genetic Algorithm for the Traveling Salesman Problem on Splash2

    E-print Network

    Nelson, Brent E.

    A Hardware Genetic Algorithm for the Traveling Salesman Problem on Splash2 Paul Graham and Brent in hardware. In this paper, we describe the Splash 2 Parallel Genetic Algorithm (SPGA), which is a parallel quickly than single processor and software璪ased implementations of the genetic algorithm. The four

  5. Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary

    E-print Network

    Hu, Jianjun

    Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model Jianjun Hu1 , Erik Goodman2 1,2 Genetic Algorithm Research and Application Group( GARAGe) 1 and a continuous temporal niching concept. The method is naturally implemented as a new genetic algorithm, QHFC

  6. Optimizing a Model for Siting Offshore Wind Farms using a Genetic Algorithm

    E-print Network

    Mountziaris, T. J.

    Optimizing a Model for Siting Offshore Wind Farms using a Genetic Algorithm *Michael Ameckson environmental impacts [4]. Genetic Algorithms have been used for numerous state of the art modeling placements as a portfolio. Background Apply a Genetic Algorithm to the existing model to analyze the optimal

  7. A New Learning Method for the Design of Hierarchical Fuzzy Controllers Using Messy Genetic Algorithms

    E-print Network

    Hoffmann, Frank

    with a hierarchical prioritized structure is proposed. A messy genetic algorithm is used to learn di erent types ones dealing with exceptional situations. Secondly we use a messy genetic algorithm 5] which process scheme. Messy genetic algorithms therefore allow a exible representation of fuzzy rules in the con

  8. Near Collisions for the Compress Function of Hamsi-256 Found by Genetic Algorithm

    E-print Network

    International Association for Cryptologic Research (IACR)

    Near Collisions for the Compress Function of Hamsi-256 Found by Genetic Algorithm LI Yun-qiang#1. In this paper we present a genetic algorithm to search near collisions for the compress function of Hamsi-256 by Genetic Algorithm (GA). This paper is organized as follows. Section 2 briefly details the Hamsi-256 Hash

  9. Exploring a Financial Product Model with a Two-Population Genetic Algorithm

    E-print Network

    Kimbrough, Steven Orla

    Exploring a Financial Product Model with a Two-Population Genetic Algorithm Steven O. Kimbrough two-population genetic algorithm (GA) has been remarkably successful in finding good, feasible is motivated by the fact that, while evolution programs (EPs) in general and genetic algorithms in particular

  10. An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic

    E-print Network

    Yang, Shengxiang

    An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling a growing interest from the genetic algorithm community due to the importance and practicability in real world applications. This pa- per proposes a new genetic algorithm, based on the inspiration from

  11. Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

    NASA Technical Reports Server (NTRS)

    Shaykhian, Gholam Ali; Sen, S. K.

    2007-01-01

    Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

  12. A Multi-Objective Genetic Algorithm for Outlier Removal.

    PubMed

    Nahum, Oren E; Yosipof, Abraham; Senderowitz, Hanoch

    2015-12-28

    Quantitative structure activity relationship (QSAR) or quantitative structure property relationship (QSPR) models are developed to correlate activities for sets of compounds with their structure-derived descriptors by means of mathematical models. The presence of outliers, namely, compounds that differ in some respect from the rest of the data set, compromise the ability of statistical methods to derive QSAR models with good prediction statistics. Hence, outliers should be removed from data sets prior to model derivation. Here we present a new multi-objective genetic algorithm for the identification and removal of outliers based on the k nearest neighbors (kNN) method. The algorithm was used to remove outliers from three different data sets of pharmaceutical interest (logBBB, factor 7 inhibitors, and dihydrofolate reductase inhibitors), and its performances were compared with those of five other methods for outlier removal. The results suggest that the new algorithm provides filtered data sets that (1) better maintain the internal diversity of the parent data sets and (2) give rise to QSAR models with much better prediction statistics. Equally good filtered data sets in terms of these metrics were obtained when another objective function was added to the algorithm (termed "preservation"), forcing it to remove certain compounds with low probability only. This option is highly useful when specific compounds should be preferably kept in the final data set either because they have favorable activities or because they represent interesting molecular scaffolds. We expect this new algorithm to be useful in future QSAR applications. PMID:26553402

  13. GAz: a genetic algorithm for photometric redshift estimation

    NASA Astrophysics Data System (ADS)

    Hogan, Robert; Fairbairn, Malcolm; Seeburn, Navin

    2015-05-01

    We present a new approach to the problem of estimating the redshift of galaxies from photometric data. The approach uses a genetic algorithm combined with non-linear regression to model the 2SLAQ LRG data set with SDSS DR7 photometry. The genetic algorithm explores the very large space of high order polynomials while only requiring optimization of a small number of terms. We find a ?rms = 0.0408 0.0006 for redshifts in the range 0.4 < z < 0.7. These results are competitive with the current state-of-the-art but can be presented simply as a polynomial which does not require the user to run any code. We demonstrate that the method generalizes well to other data sets and redshift ranges by testing it on SDSS DR11 and on simulated data. For other data sets or applications the code has been made available at https://github.com/rbrthogan/GAz.

  14. Genetic algorithms and the analysis of SnIa data

    E-print Network

    Nesseris, Savvas

    2010-01-01

    The Genetic Algorithm is a heuristic that can be used to produce model independent solutions to an optimization problem, thus making it ideal for use in cosmology and more specifically in the analysis of type Ia supernovae data. In this work we use the Genetic Algorithms (GA) in order to derive a null test on the spatially flat cosmological constant model $\\Lambda$CDM. This is done in two steps: first, we apply the GA to the Constitution SNIa data in order to acquire a model independent reconstruction of the expansion history of the Universe $H(z)$ and second, we use the reconstructed $H(z)$ in conjunction with the Om statistic, which is constant only for the $\\Lambda$CDM model, to derive our constraints. We find that while $\\Lambda$CDM is consistent with the data at the $2\\sigma$ level, some deviations from $\\Lambda$CDM model at low redshifts can be accommodated.

  15. A sustainable genetic algorithm for satellite resource allocation

    NASA Technical Reports Server (NTRS)

    Abbott, R. J.; Campbell, M. L.; Krenz, W. C.

    1995-01-01

    A hybrid genetic algorithm is used to schedule tasks for 8 satellites, which can be modelled as a robot whose task is to retrieve objects from a two dimensional field. The objective is to find a schedule that maximizes the value of objects retrieved. Typical of the real-world tasks to which this corresponds is the scheduling of ground contacts for a communications satellite. An important feature of our application is that the amount of time available for running the scheduler is not necessarily known in advance. This requires that the scheduler produce reasonably good results after a short period but that it also continue to improve its results if allowed to run for a longer period. We satisfy this requirement by developing what we call a sustainable genetic algorithm.

  16. Optimum Actuator Selection with a Genetic Algorithm for Aircraft Control

    NASA Technical Reports Server (NTRS)

    Rogers, James L.

    2004-01-01

    The placement of actuators on a wing determines the control effectiveness of the airplane. One approach to placement maximizes the moments about the pitch, roll, and yaw axes, while minimizing the coupling. For example, the desired actuators produce a pure roll moment without at the same time causing much pitch or yaw. For a typical wing, there is a large set of candidate locations for placing actuators, resulting in a substantially larger number of combinations to examine in order to find an optimum placement satisfying the mission requirements and mission constraints. A genetic algorithm has been developed for finding the best placement for four actuators to produce an uncoupled pitch moment. The genetic algorithm has been extended to find the minimum number of actuators required to provide uncoupled pitch, roll, and yaw control. A simplified, untapered, unswept wing is the model for each application.

  17. Strain gage selection in loads using a genetic algorithm

    SciTech Connect

    Nelson, S. II

    1994-12-31

    Traditionally, structural loads are measured using strain gages. Many research structures such as airplane wings are highly instrumented with strain gages, and the number and selection of gages used in a loads equation can be problematic. A technique using a genetic algorithm to choose the strain gages for in-flight loads is presented. This technique is compared with the current T-value technique and a variant known as the Best Step-down technique. Additionally, a significant limitation in the current methods is revealed. The genetic algorithm arrived at a comparable or superior set of gages with significantly less human effort, and could be applied in instances when current methods could not.

  18. Quantum control using genetic algorithms in quantum communication: superdense coding

    NASA Astrophysics Data System (ADS)

    Dom韓guez-Serna, Francisco; Rojas, Fernando

    2015-06-01

    We present a physical example model of how Quantum Control with genetic algorithms is applied to implement the quantum superdense code protocol. We studied a model consisting of two quantum dots with an electron with spin, including spin-orbit interaction. The electron and the spin get hybridized with the site acquiring two degrees of freedom, spin and charge. The system has tunneling and site energies as time dependent control parameters that are optimized by means of genetic algorithms to prepare a hybrid Bell-like state used as a transmission channel. This state is transformed to obtain any state of the four Bell basis as required by superdense protocol to transmit two bits of classical information. The control process protocol is equivalent to implement one of the quantum gates in the charge subsystem. Fidelities larger than 99.5% are achieved for the hybrid entangled state preparation and the superdense operations.

  19. Genetic Algorithm Application in Optimization of Wireless Sensor Networks

    PubMed Central

    Norouzi, Ali; Zaim, A. Halim

    2014-01-01

    There are several applications known for wireless sensor networks (WSN), and such variety demands improvement of the currently available protocols and the specific parameters. Some notable parameters are lifetime of network and energy consumption for routing which play key role in every application. Genetic algorithm is one of the nonlinear optimization methods and relatively better option thanks to its efficiency for large scale applications and that the final formula can be modified by operators. The present survey tries to exert a comprehensive improvement in all operational stages of a WSN including node placement, network coverage, clustering, and data aggregation and achieve an ideal set of parameters of routing and application based WSN. Using genetic algorithm and based on the results of simulations in NS, a specific fitness function was achieved, optimized, and customized for all the operational stages of WSNs. PMID:24693235

  20. Adaptive process control using fuzzy logic and genetic algorithms

    NASA Technical Reports Server (NTRS)

    Karr, C. L.

    1993-01-01

    Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

  1. GAz: A Genetic Algorithm for Photometric Redshift Estimation

    E-print Network

    Hogan, Robert; Seeburn, Navin

    2014-01-01

    We present a new approach to the problem of estimating the redshift of galaxies from photometric data. The approach uses a genetic algorithm combined with non-linear regression to model the 2SLAQ LRG data set with SDSS DR7 photometry. The genetic algorithm explores the very large space of high order polynomials while only requiring optimisation of a small number of terms. We find a $\\sigma_{\\text{rms}}=0.0408\\pm 0.0006$ for redshifts in the range $0.4

  2. Genetic algorithms and the analysis of SnIa data

    E-print Network

    Savvas Nesseris

    2010-11-08

    The Genetic Algorithm is a heuristic that can be used to produce model independent solutions to an optimization problem, thus making it ideal for use in cosmology and more specifically in the analysis of type Ia supernovae data. In this work we use the Genetic Algorithms (GA) in order to derive a null test on the spatially flat cosmological constant model $\\Lambda$CDM. This is done in two steps: first, we apply the GA to the Constitution SNIa data in order to acquire a model independent reconstruction of the expansion history of the Universe $H(z)$ and second, we use the reconstructed $H(z)$ in conjunction with the Om statistic, which is constant only for the $\\Lambda$CDM model, to derive our constraints. We find that while $\\Lambda$CDM is consistent with the data at the $2\\sigma$ level, some deviations from $\\Lambda$CDM model at low redshifts can be accommodated.

  3. Adaptive Process Control with Fuzzy Logic and Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Karr, C. L.

    1993-01-01

    Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision-making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

  4. First flights of genetic-algorithm Kitty Hawk

    SciTech Connect

    Goldberg, D.E.

    1994-12-31

    The design of complex systems requires an effective methodology of invention. This paper considers the methodology of the Wright brothers in inventing the powered airplane and suggests how successes in the design of genetic algorithms have come at the hands of a Wright-brothers-like approach. Recent reliable subquadratic results in solving hard problems with nontraditional GAs and predictions of the limits of simple GAs are presented as two accomplishments achieved in this manner.

  5. OPTIMIZATION OF LONG RURAL FEEDERS USING A GENETIC ALGORITHM

    SciTech Connect

    Wishart, Michael; Ledwich, Gerard; Ghosh, Arindam; Ivanovich, Grujica

    2010-06-15

    This paper describes the optimization of conductor size and the voltage regulator location and magnitude of long rural distribution lines. The optimization minimizes the lifetime cost of the lines, including capital costs and losses while observing voltage drop and operational constraints using a Genetic Algorithm (GA). The GA optimization is applied to a real Single Wire Earth Return (SWER) network in regional Queensland and results are presented.

  6. A quantum genetic algorithm with quantum crossover and mutation operations

    E-print Network

    Akira SaiToh; Robabeh Rahimi; Mikio Nakahara

    2013-11-22

    In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.

  7. MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm

    PubMed Central

    Elizarraras, Omar; Panduro, Marco; M閚dez, Aldo L.

    2014-01-01

    The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput. PMID:25140339

  8. MAC protocol for ad hoc networks using a genetic algorithm.

    PubMed

    Elizarraras, Omar; Panduro, Marco; M閚dez, Aldo L; Reyna, Alberto

    2014-01-01

    The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput. PMID:25140339

  9. Designing neuroclassifier fusion system by immune genetic algorithm

    NASA Astrophysics Data System (ADS)

    Liang, Jimin; Zhao, Heng; Yang, Wanhai

    2001-09-01

    A multiple neural network classifier fusion system design method using immune genetic algorithm (IGA) is proposed. The IGA is modeled after the mechanics of human immunity. By using vaccination and immune selection in the evolution procedures, the IGA outperforms the traditional genetic algorithms in restraining the degenerate phenomenon and increasing the converging speed. The fusion system consists of N neural network classifiers that work independently and in parallel to classify a given input pattern. The classifiers' outputs are aggregated by a fusion scheme to decide the collective classification results. The goal of the system design is to obtain a fusion system with both good generalization and efficiency in space and time. Two kinds of measures, the accuracy of classification and the size of the neural networks, are used by IGA to evaluate the fusion system. The vaccines are abstracted by a self-adaptive scheme during the evolutionary process. A numerical experiment on the 'alternate labels' problem is implemented and the comparisons of IGA with traditional genetic algorithm are presented.

  10. Genetic Algorithm Optimizes Q-LAW Control Parameters

    NASA Technical Reports Server (NTRS)

    Lee, Seungwon; von Allmen, Paul; Petropoulos, Anastassios; Terrile, Richard

    2008-01-01

    A document discusses a multi-objective, genetic algorithm designed to optimize Lyapunov feedback control law (Q-law) parameters in order to efficiently find Pareto-optimal solutions for low-thrust trajectories for electronic propulsion systems. These would be propellant-optimal solutions for a given flight time, or flight time optimal solutions for a given propellant requirement. The approximate solutions are used as good initial solutions for high-fidelity optimization tools. When the good initial solutions are used, the high-fidelity optimization tools quickly converge to a locally optimal solution near the initial solution. Q-law control parameters are represented as real-valued genes in the genetic algorithm. The performances of the Q-law control parameters are evaluated in the multi-objective space (flight time vs. propellant mass) and sorted by the non-dominated sorting method that assigns a better fitness value to the solutions that are dominated by a fewer number of other solutions. With the ranking result, the genetic algorithm encourages the solutions with higher fitness values to participate in the reproduction process, improving the solutions in the evolution process. The population of solutions converges to the Pareto front that is permitted within the Q-law control parameter space.

  11. A genetic algorithm to reduce stream channel cross section data

    USGS Publications Warehouse

    Berenbrock, C.

    2006-01-01

    A genetic algorithm (GA) was used to reduce cross section data for a hypothetical example consisting of 41 data points and for 10 cross sections on the Kootenai River. The number of data points for the Kootenai River cross sections ranged from about 500 to more than 2,500. The GA was applied to reduce the number of data points to a manageable dataset because most models and other software require fewer than 100 data points for management, manipulation, and analysis. Results indicated that the program successfully reduced the data. Fitness values from the genetic algorithm were lower (better) than those in a previous study that used standard procedures of reducing the cross section data. On average, fitnesses were 29 percent lower, and several were about 50 percent lower. Results also showed that cross sections produced by the genetic algorithm were representative of the original section and that near-optimal results could be obtained in a single run, even for large problems. Other data also can be reduced in a method similar to that for cross section data.

  12. A Hybrid Metaheuristic for Biclustering Based on Scatter Search and Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Nepomuceno, Juan A.; Troncoso, Alicia; Aguilar朢uiz, Jes鷖 S.

    In this paper a hybrid metaheuristic for biclustering based on Scatter Search and Genetic Algorithms is presented. A general scheme of Scatter Search has been used to obtain high-quality biclusters, but a way of generating the initial population and a method of combination based on Genetic Algorithms have been chosen. Experimental results from yeast cell cycle and human B-cell lymphoma are reported. Finally, the performance of the proposed hybrid algorithm is compared with a genetic algorithm recently published.

  13. Automatic Data Filter Customization Using a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Mandrake, Lukas

    2013-01-01

    This work predicts whether a retrieval algorithm will usefully determine CO2 concentration from an input spectrum of GOSAT (Greenhouse Gases Observing Satellite). This was done to eliminate needless runtime on atmospheric soundings that would never yield useful results. A space of 50 dimensions was examined for predictive power on the final CO2 results. Retrieval algorithms are frequently expensive to run, and wasted effort defeats requirements and expends needless resources. This algorithm could be used to help predict and filter unneeded runs in any computationally expensive regime. Traditional methods such as the Fischer discriminant analysis and decision trees can attempt to predict whether a sounding will be properly processed. However, this work sought to detect a subsection of the dimensional space that can be simply filtered out to eliminate unwanted runs. LDAs (linear discriminant analyses) and other systems examine the entire data and judge a "best fit," giving equal weight to complex and problematic regions as well as simple, clear-cut regions. In this implementation, a genetic space of "left" and "right" thresholds outside of which all data are rejected was defined. These left/right pairs are created for each of the 50 input dimensions. A genetic algorithm then runs through countless potential filter settings using a JPL computer cluster, optimizing the tossed-out data s yield (proper vs. improper run removal) and number of points tossed. This solution is robust to an arbitrary decision boundary within the data and avoids the global optimization problem of whole-dataset fitting using LDA or decision trees. It filters out runs that would not have produced useful CO2 values to save needless computation. This would be an algorithmic preprocessing improvement to any computationally expensive system.

  14. Haplotyping algorithms

    SciTech Connect

    Sobel, E.; Lange, K.; O`Connell, J.R.

    1996-12-31

    Haplotyping is the logical process of inferring gene flow in a pedigree based on phenotyping results at a small number of genetic loci. This paper formalizes the haplotyping problem and suggests four algorithms for haplotype reconstruction. These algorithms range from exhaustive enumeration of all haplotype vectors to combinatorial optimization by simulated annealing. Application of the algorithms to published genetic analyses shows that manual haplotyping is often erroneous. Haplotyping is employed in screening pedigrees for phenotyping errors and in positional cloning of disease genes from conserved haplotypes in population isolates. 26 refs., 6 figs., 3 tabs.

  15. EVOLVING RETRIEVAL ALGORITHMS WITH A GENETIC PROGRAMMING SCHEME

    SciTech Connect

    J. THEILER; ET AL

    1999-06-01

    The retrieval of scene properties (surface temperature, material type, vegetation health, etc.) from remotely sensed data is the ultimate goal of many earth observing satellites. The algorithms that have been developed for these retrievals are informed by physical models of how the raw data were generated. This includes models of radiation as emitted and/or rejected by the scene, propagated through the atmosphere, collected by the optics, detected by the sensor, and digitized by the electronics. To some extent, the retrieval is the inverse of this ''forward'' modeling problem. But in contrast to this forward modeling, the practical task of making inferences about the original scene usually requires some ad hoc assumptions, good physical intuition, and a healthy dose of trial and error. The standard MTI data processing pipeline will employ algorithms developed with this traditional approach. But we will discuss some preliminary research on the use of a genetic programming scheme to ''evolve'' retrieval algorithms. Such a scheme cannot compete with the physical intuition of a remote sensing scientist, but it may be able to automate some of the trial and error. In this scenario, a training set is used, which consists of multispectral image data and the associated ''ground truth;'' that is, a registered map of the desired retrieval quantity. The genetic programming scheme attempts to combine a core set of image processing primitives to produce an IDL (Interactive Data Language) program which estimates this retrieval quantity from the raw data.

  16. Optimal design of link systems using successive zooming genetic algorithm

    NASA Astrophysics Data System (ADS)

    Kwon, Young-Doo; Sohn, Chang-hyun; Kwon, Soon-Bum; Lim, Jae-gyoo

    2009-07-01

    Link-systems have been around for a long time and are still used to control motion in diverse applications such as automobiles, robots and industrial machinery. This study presents a procedure involving the use of a genetic algorithm for the optimal design of single four-bar link systems and a double four-bar link system used in diesel engine. We adopted the Successive Zooming Genetic Algorithm (SZGA), which has one of the most rapid convergence rates among global search algorithms. The results are verified by experiment and the Recurdyn dynamic motion analysis package. During the optimal design of single four-bar link systems, we found in the case of identical input/output (IO) angles that the initial and final configurations show certain symmetry. For the double link system, we introduced weighting factors for the multi-objective functions, which minimize the difference between output angles, providing balanced engine performance, as well as the difference between final output angle and the desired magnitudes of final output angle. We adopted a graphical method to select a proper ratio between the weighting factors.

  17. An Introduction to Genetic Algorithms and to Their Use in Information Retrieval.

    ERIC Educational Resources Information Center

    Jones, Gareth; And Others

    1994-01-01

    Genetic algorithms, a class of nondeterministic algorithms in which the role of chance makes the precise nature of a solution impossible to guarantee, seem to be well suited to combinatorial-optimization problems in information retrieval. Provides an introduction to techniques and characteristics of genetic algorithms and illustrates their

  18. Autonomous Local Path-Planning for a Mobile Robot Using a Genetic Algorithm

    E-print Network

    Wainwright, Roger L.

    Autonomous Local Path-Planning for a Mobile Robot Using a Genetic Algorithm Kamran H. Sedighi presents results of our work in development of a genetic algorithm based path-planning algorithm for local of the path and the number of turns. The proposed path- planning method allows a free movement of the robot

  19. Autonomous Local Path Planning for a Mobile Robot Using a Genetic Algorithm

    E-print Network

    Manikas, Theodore

    Autonomous Local Path Planning for a Mobile Robot Using a Genetic Algorithm Kamran H. Sedighi presents results of our work in development of a genetic algorithm based path-planning algorithm for local of the path and the number of turns. The proposed path-planning method allows a free movement of the robot

  20. Breaking Ties with Secondary Fitness in a Genetic Algorithm for the Bin Packing Problem

    E-print Network

    Julstrom, Bryant A.

    Breaking Ties with Secondary Fitness in a Genetic Algorithm for the Bin Packing Problem Justin 56301 USA julstrom@stcloudstate.edu ABSTRACT In a genetic algorithm with integer fitnesses, ties such ties to the algorithm's advantage. Such a secondary fitness for the Bin Packing Problem is based

  1. Analysis of the numerical effects of parallelism on a parallel genetic algorithm

    SciTech Connect

    Hart, W.E.; Belew, R.K.; Kohn, S.; Baden, S.

    1995-09-18

    This paper examines the effects of relaxed synchronization on both the numerical and parallel efficiency of parallel genetic algorithms (GAs). We describe a coarse-grain geographically structured parallel genetic algorithm. Our experiments show that asynchronous versions of these algorithms have a lower run time than-synchronous GAs. Furthermore, we demonstrate that this improvement in performance is partly due to the fact that the numerical efficiency of the asynchronous genetic algorithm is better than the synchronous genetic algorithm. Our analysis includes a critique of the utility of traditional parallel performance measures for parallel GAs, and we evaluate the claims made by several researchers that parallel GAs can have superlinear speedup.

  2. Genetic algorithm for multiple bus line coordination on urban arterial.

    PubMed

    Yang, Zhen; Wang, Wei; Chen, Shuyan; Ding, Haoyang; Li, Xiaowei

    2015-01-01

    Bus travel time on road section is defined and analyzed with the effect of multiple bus lines. An analytical model is formulated to calculate the total red time a bus encounters when travelling along the arterial. Genetic algorithm is used to optimize the offset scheme of traffic signals to minimize the total red time that all bus lines encounter in two directions of the arterial. The model and algorithm are applied to the major part of Zhongshan North Street in the city of Nanjing. The results show that the methods in this paper can reduce total red time of all the bus lines by 31.9% on the object arterial and thus improve the traffic efficiency of the whole arterial and promote public transport priority. PMID:25663837

  3. A genetic algorithm based method for docking flexible molecules

    SciTech Connect

    Judson, R.S.; Jaeger, E.P.; Treasurywala, A.M.

    1993-11-01

    The authors describe a computational method for docking flexible molecules into protein binding sites. The method uses a genetic algorithm (GA) to search the combined conformation/orientation space of the molecule to find low energy conformation. Several techniques are described that increase the efficiency of the basic search method. These include the use of several interacting GA subpopulations or niches; the use of a growing algorithm that initially docks only a small part of the molecule; and the use of gradient minimization during the search. To illustrate the method, they dock Cbz-GlyP-Leu-Leu (ZGLL) into thermolysin. This system was chosen because a well refined crystal structure is available and because another docking method had previously been tested on this system. Their method is able to find conformations that lie physically close to and in some cases lower in energy than the crystal conformation in reasonable periods of time on readily available hardware.

  4. Optimizing Optical Quantum Logic Gates using Genetic Algorithms

    E-print Network

    Zhanghan Wu; Sean D. Huver; Dmitry Uskov; Hwang Lee; Jonathan P. Dowling

    2007-09-04

    We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.

  5. Operational Optimal Ship Routing Using a Hybrid Parallel Genetic Algorithm

    E-print Network

    O. T. Kosmas; D. S. Vlachos

    2009-05-04

    Optimization of ship routing depends on several parameters, like ship and cargo characteristics, environmental factors, topography, international navigation rules, crew comfort etc. The complex nature of the problem leads to oversimplifications in analytical techniques, while stochastic methods like simulated annealing can be both time consuming and sensitive to local minima. In this work, a hybrid parallel genetic algorithm - estimation of distribution algorithm is developed in the island model, to operationally calculate the optimal ship routing. The technique, which is applicable not only to clusters but to grids as well, is very fast and has been applied to very difficult environments, like the Greek seas with thousands of islands and extreme micro-climate conditions.

  6. An Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems

    PubMed Central

    Salcedo-Sanz, S.; Del Ser, J.; Geem, Z. W.

    2014-01-01

    This paper presents a novel fuzzy clustering technique based on grouping genetic algorithms (GGAs), which are a class of evolutionary algorithms especially modified to tackle grouping problems. Our approach hinges on a GGA devised for fuzzy clustering by means of a novel encoding of individuals (containing elements and clusters sections), a new fitness function (a superior modification of the Davies Bouldin index), specially tailored crossover and mutation operators, and the use of a scheme based on a local search and a parallelization process, inspired from an island-based model of evolution. The overall performance of our approach has been assessed over a number of synthetic and real fuzzy clustering problems with different objective functions and distance measures, from which it is concluded that the proposed approach shows excellent performance in all cases. PMID:24977235

  7. Application of genetic algorithms to tuning fuzzy control systems

    NASA Technical Reports Server (NTRS)

    Espy, Todd; Vombrack, Endre; Aldridge, Jack

    1993-01-01

    Real number genetic algorithms (GA) were applied for tuning fuzzy membership functions of three controller applications. The first application is our 'Fuzzy Pong' demonstration, a controller that controls a very responsive system. The performance of the automatically tuned membership functions exceeded that of manually tuned membership functions both when the algorithm started with randomly generated functions and with the best manually-tuned functions. The second GA tunes input membership functions to achieve a specified control surface. The third application is a practical one, a motor controller for a printed circuit manufacturing system. The GA alters the positions and overlaps of the membership functions to accomplish the tuning. The applications, the real number GA approach, the fitness function and population parameters, and the performance improvements achieved are discussed. Directions for further research in tuning input and output membership functions and in tuning fuzzy rules are described.

  8. A Parallel Genetic Algorithm for Automated Electronic Circuit Design

    NASA Technical Reports Server (NTRS)

    Long, Jason D.; Colombano, Silvano P.; Haith, Gary L.; Stassinopoulos, Dimitris

    2000-01-01

    Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.

  9. Performance of Hybrid Genetic Algorithms Incorporating Local Search T. Elmihoub, A. A. Hopgood, L. Nolle and A. Battersby

    E-print Network

    Hopgood, Adrian

    Performance of Hybrid Genetic Algorithms Incorporating Local Search T. Elmihoub, A. A. Hopgood, L on the performance of hybrid genetic algorithms. It compares the performance of two genetic璴ocal hybrids using in the algorithm convergence speed. INTRODUCTION The ability of genetic algorithms to capture a global view

  10. Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, CA, 2001 Combining Genetic Algorithms and Case-Based Reasoning for Genetic

    E-print Network

    Kansas, University of

    Combining Genetic Algorithms and Case-Based Reasoning for Genetic Learning of a Casebase: A Conceptual@ittc.ukans.edu Abstract In this paper, we present a conceptual frame- work that combines genetic algorithms and case as the system runs. We propose to use genetic algorithms to gen- erate useful cases since there is not any

  11. Design Space Exploration of incompletely specified Embedded Systems by Genetic Algorithms

    E-print Network

    Huss, Sorin A.

    Design Space Exploration of incompletely specified Embedded Systems by Genetic Algorithms Stephan design space exploration algorithm, which jointly determines a complete set of Pareto optimal for new modules in a single optimization run. This design space exploration method is based

  12. A Modified Genetic Algorithm Applied to Horizontal Well Placement Optimization in Gas Condensate Reservoirs

    E-print Network

    Morales, Adrian

    2011-02-22

    horizontal well placement problem is optimized by using a modified Genetic Algorithm. The algorithm presented has been modified specifically for gas condensate reservoirs. Unlike oil reservoirs, the cumulative production in gas reservoirs does not vary...

  13. Structural control Architecture Optimization for 3-D Systems Using Advanced Multi-Objective Genetic Algorithms

    E-print Network

    Cha, Young Jin

    2010-01-14

    Gaussian (LQG) control algorithm is used as the active control strategy. The American Society of Civil Engineers (ASCE) control benchmark building definition is used to develop the building system model. The proposed gene manipulation genetic algorithm...

  14. General asymmetric neutral networks and structure design by genetic algorithms: A learning rule for temporal patterns

    SciTech Connect

    Bornholdt, S.; Graudenz, D.

    1993-07-01

    A learning algorithm based on genetic algorithms for asymmetric neural networks with an arbitrary structure is presented. It is suited for the learning of temporal patterns and leads to stable neural networks with feedback.

  15. Dynamic and fault tolerant three-dimensional cellular genetic algorithms

    E-print Network

    Al Naqi, Asmaa

    2012-11-29

    In the area of artificial intelligence, the development of Evolutionary Algorithms (EAs) has been very active, especially in the last decade. These algorithms started to evolve when scientists from various regions of the ...

  16. An Evolvement-based Genetic Algorithm for Computer-aided Molecular Docking

    NASA Astrophysics Data System (ADS)

    Ling, Kang; Xiaoyu, Zhao; Xi, Chen; Xicheng, Wang

    2010-05-01

    Species dynamics model is introduced into the genetic algorithm to reflect the true state of evolution. An adaptive evolution algorithm is developed. In the algorithm, an adaptive strategy is used to overcome the difficulty of confirming the crossover and mutation probabilities. Small population strategy and optimal strategy ensure the diversity of the populations. Numerical results show that introducing species dynamics model can improve the efficiency of the algorithm. Based on the genetic algorithm, a new molecular docking program is developed. Docking result indicates that the algorithm can effectively solve the molecular docking problem.

  17. Simulating and Synthesizing Substructures Using Neural Network and Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Liu, Youhua; Kapania, Rakesh K.; VanLandingham, Hugh F.

    1997-01-01

    The feasibility of simulating and synthesizing substructures by computational neural network models is illustrated by investigating a statically indeterminate beam, using both a 1-D and a 2-D plane stress modelling. The beam can be decomposed into two cantilevers with free-end loads. By training neural networks to simulate the cantilever responses to different loads, the original beam problem can be solved as a match-up between two subsystems under compatible interface conditions. The genetic algorithms are successfully used to solve the match-up problem. Simulated results are found in good agreement with the analytical or FEM solutions.

  18. Query Optimization Using Genetic Algorithms in the Vector Space Model

    E-print Network

    Mashagba, Eman Al; Nassar, Mohammad Othman

    2011-01-01

    In information retrieval research; Genetic Algorithms (GA) can be used to find global solutions in many difficult problems. This study used different similarity measures (Dice, Inner Product) in the VSM, for each similarity measure we compared ten different GA approaches based on different fitness functions, different mutations and different crossover strategies to find the best strategy and fitness function that can be used when the data collection is the Arabic language. Our results shows that the GA approach which uses one-point crossover operator, point mutation and Inner Product similarity as a fitness function is the best IR system in VSM.

  19. Modeling Interacting Galaxies Using a Parallel Genetic Algorithm

    E-print Network

    Christian Theis; Stefan Harfst

    1999-10-10

    Modeling of interacting galaxies suffers from an extended parameter space prohibiting traditional grid based search strategies. As an alternative approach a combination of a Genetic Algorithm (GA) with fast restricted N-body simulations can be applied. A typical fit takes about 3-6 CPU-hours on a PentiumII processor. Here we present a parallel implementation of our GA which reduces the CPU-requirement of a parameter determination to a few minutes on 100 nodes of a CRAY T3E.

  20. Model-Robust Optimal Designs: A Genetic Algorithm Approach

    SciTech Connect

    Heredia-Langner, Alejandro; Montgomery, Douglas C.; Carlyle, W M.; Borror, Connie M.

    2004-07-01

    A model-robust design is an experimental design that has high efficiency with respect to a particular criterion for every member of a set of candidate models that are of interest to the experimenter. We present a technique to construct model-robust alphabetically optimal designs using genetic algorithms. The technique is useful in situations where computer-generated designs are most likely to be employed, particularly experiments with mixtures and response surface experiments in constrained regions. Examples illustrating the procedure are provided.

  1. Properties of nucleon resonances by means of a genetic algorithm

    SciTech Connect

    Fernandez-Ramirez, C.; Moya de Guerra, E.; Udias, A.

    2008-06-15

    We present an optimization scheme that employs a genetic algorithm (GA) to determine the properties of low-lying nucleon excitations within a realistic photo-pion production model based upon an effective Lagrangian. We show that with this modern optimization technique it is possible to reliably assess the parameters of the resonances and the associated error bars as well as to identify weaknesses in the models. To illustrate the problems the optimization process may encounter, we provide results obtained for the nucleon resonances {delta}(1230) and {delta}(1700). The former can be easily isolated and thus has been studied in depth, while the latter is not as well known experimentally.

  2. A new chromatic dispersion compensation method based on genetic algorithm

    NASA Astrophysics Data System (ADS)

    Liu, Chun-wu; Qin, Jiang-yi; Huang, Zhi-ping; Zhang, Yi-meng

    2013-08-01

    In the 40Gbps high-speed optical fiber communication system, chromatic dispersion of optical signal brings about to generation of inter-symbol interface which influences the quality of optical fiber communication. In order to solve the above questions in the 40Gbps differential quarter phase-shift keying (DQPSK) optical fiber communication system, a new method of chromatic dispersion compensation based on genetic algorithm is proposed according to the demodulation of DQPSK optical signal and the trait of chromatic dispersion. Result shows that the system's receiving sensitivity has been enhanced up to six orders of magnitude.

  3. Optimal brushless DC motor design using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Rahideh, A.; Korakianitis, T.; Ruiz, P.; Keeble, T.; Rothman, M. T.

    2010-11-01

    This paper presents a method for the optimal design of a slotless permanent magnet brushless DC (BLDC) motor with surface mounted magnets using a genetic algorithm. Characteristics of the motor are expressed as functions of motor geometries. The objective function is a combination of losses, volume and cost to be minimized simultaneously. Electrical and mechanical requirements (i.e. voltage, torque and speed) and other limitations (e.g. upper and lower limits of the motor geometries) are cast into constraints of the optimization problem. One sample case is used to illustrate the design and optimization technique.

  4. Random search optimization based on genetic algorithm and discriminant function

    NASA Technical Reports Server (NTRS)

    Kiciman, M. O.; Akgul, M.; Erarslanoglu, G.

    1990-01-01

    The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

  5. Full design of fuzzy controllers using genetic algorithms

    NASA Technical Reports Server (NTRS)

    Homaifar, Abdollah; Mccormick, ED

    1992-01-01

    This paper examines the applicability of genetic algorithms (GA) in the complete design of fuzzy logic controllers. While GA has been used before in the development of rule sets or high performance membership functions, the interdependence between these two components dictates that they should be designed together simultaneously. GA is fully capable of creating complete fuzzy controllers given the equations of motion of the system, eliminating the need for human input in the design loop. We show the application of this new method to the development of a cart controller.

  6. Properties of Nucleon Resonances by means of a Genetic Algorithm

    E-print Network

    C. Fernandez-Ramirez; E. Moya de Guerra; A. Udias; J. M. Udias

    2008-06-24

    We present an optimization scheme that employs a Genetic Algorithm (GA) to determine the properties of low-lying nucleon excitations within a realistic photo-pion production model based upon an effective Lagrangian. We show that with this modern optimization technique it is possible to reliably assess the parameters of the resonances and the associated error bars as well as to identify weaknesses in the models. To illustrate the problems the optimization process may encounter, we provide results obtained for the nucleon resonances $\\Delta$(1230) and $\\Delta$(1700). The former can be easily isolated and thus has been studied in depth, while the latter is not as well known experimentally.

  7. Evolution of Digital Logic Functionality via a Genetic Algorithm

    E-print Network

    Frenz, Christopher M; Julien, Wilson

    2009-01-01

    Digital logic forms the functional basics of most modern electronic equipment and as such the creation of novel digital logic circuits is an active area of computer engineering research. This study demonstrates that genetic algorithms can be used to evolve functionally useful sets of logic gate interconnections to create useful digital logic circuits. The efficacy of this approach is illustrated via the evolution of AND, OR, XOR, NOR, and XNOR functionality from sets of NAND gates, thereby illustrating that evolutionary methods have the potential be applied to the design of digital electronics.

  8. Evolutionary Computation: from Genetic Algorithms to Genetic Programming

    E-print Network

    Fernandez, Thomas

    . The encoding for genetic information (genome) is done in a way that admits asexual reproduction which results in offspring that are genetically identical to the parent. Sexual reproduction allows some exchange and re

  9. Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

    NASA Technical Reports Server (NTRS)

    Plassman, Gerald E.; Sobieszczanski-Sobieski, Jaroslaw

    2000-01-01

    Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

  10. An Evolved Wavelet Library Based on Genetic Algorithm

    PubMed Central

    Vaithiyanathan, D.; Seshasayanan, R.; Kunaraj, K.; Keerthiga, J.

    2014-01-01

    As the size of the images being captured increases, there is a need for a robust algorithm for image compression which satiates the bandwidth limitation of the transmitted channels and preserves the image resolution without considerable loss in the image quality. Many conventional image compression algorithms use wavelet transform which can significantly reduce the number of bits needed to represent a pixel and the process of quantization and thresholding further increases the compression. In this paper the authors evolve two sets of wavelet filter coefficients using genetic algorithm (GA), one for the whole image portion except the edge areas and the other for the portions near the edges in the image (i.e., global and local filters). Images are initially separated into several groups based on their frequency content, edges, and textures and the wavelet filter coefficients are evolved separately for each group. As there is a possibility of the GA settling in local maximum, we introduce a new shuffling operator to prevent the GA from this effect. The GA used to evolve filter coefficients primarily focuses on maximizing the peak signal to noise ratio (PSNR). The evolved filter coefficients by the proposed method outperform the existing methods by a 0.31?dB improvement in the average PSNR and a 0.39?dB improvement in the maximum PSNR. PMID:25405225

  11. Optimization of an antenna array using genetic algorithms

    SciTech Connect

    Kiehbadroudinezhad, Shahideh; Noordin, Nor Kamariah; Sali, A.; Abidin, Zamri Zainal

    2014-06-01

    An array of antennas is usually used in long distance communication. The observation of celestial objects necessitates a large array of antennas, such as the Giant Metrewave Radio Telescope (GMRT). Optimizing this kind of array is very important when observing a high performance system. The genetic algorithm (GA) is an optimization solution for these kinds of problems that reconfigures the position of antennas to increase the u-v coverage plane or decrease the sidelobe levels (SLLs). This paper presents how to optimize a correlator antenna array using the GA. A brief explanation about the GA and operators used in this paper (mutation and crossover) is provided. Then, the results of optimization are discussed. The results show that the GA provides efficient and optimum solutions among a pool of candidate solutions in order to achieve the desired array performance for the purposes of radio astronomy. The proposed algorithm is able to distribute the u-v plane more efficiently than GMRT with a more than 95% distribution ratio at snapshot, and to fill the u-v plane from a 20% to more than 68% filling ratio as the number of generations increases in the hour tracking observations. Finally, the algorithm is able to reduce the SLL to 21.75 dB.

  12. Optimization of soft-morphological filters by genetic algorithms

    NASA Astrophysics Data System (ADS)

    Huttunen, Heikki; Kuosmanen, Pauli; Koskinen, Lasse; Astola, Jaakko T.

    1994-06-01

    In this work we present a new approach to robust image modeling. the proposed method is based on M-estimation algorithms. However, unlike in other M-estimator based image processing algorithms, the new algorithm takes into consideration spatial relations between picture elements. The contribution of the sample to the model depends not only on the current residual of that sample, but also on the neighboring residuals. In order to test the proposed algorithm we apply it to an image filtering problem, where images are modeled as piecewise polynomials. We show that the filter based on our algorithm has excellent detail preserving properties while suppressing additive Gaussian and impulsive noise very efficiently.

  13. Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI

    E-print Network

    Louis, Sushil J.

    Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI Sushil J Louis and Chris Miles Evolutionary Computing Systems Laboratory Department of Computer Science and Engineering-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic

  14. Combining CaseBased Memory with Genetic Algorithm Search for Competent Game AI

    E-print Network

    Louis, Sushil J.

    Combining Case瑽ased Memory with Genetic Algorithm Search for Competent Game AI Sushil J Louis and Chris Miles Evolutionary Computing Systems Laboratory Department of Computer Science and Engineering璱njected genetic algorithms for learning how to competently play computer strategy games. Case璱njected genetic

  15. Genetic Algorithms based Parameter Identification of Yeast Fed-Batch Cultivation

    E-print Network

    Borissova, Daniela

    variations of the SGA and MpGA have been developed [1, 4, 6, 9] . Among them are the modified geneticGenetic Algorithms based Parameter Identification of Yeast Fed-Batch Cultivation Maria Angelova.pencheva@clbme.bas.bg Abstract. Different kinds of genetic algorithms have been investigated for a parameter identification

  16. Seismic Velocity Inversion with Genetic Algorithms Sushil J. Louis Qinxue Chen

    E-print Network

    Louis, Sushil J.

    Seismic Velocity Inversion with Genetic Algorithms Sushil J. Louis Qinxue Chen Genetic Adaptive to generating good seismic velocity models and that our two璬imensional crossover operators always performed parallelizability of genetic algorithms make a strong case for their use in seismic inversion. Keywords: velocity

  17. Genetic Algorithms and Experimental Discrimination of SUSY Models

    E-print Network

    B. C. Allanach; D. Grellscheid; F. Quevedo

    2004-07-28

    We introduce genetic algorithms as a means to estimate the accuracy required to discriminate among different models using experimental observables. We exemplify the technique in the context of the minimal supersymmetric standard model. If supersymmetric particles are discovered, models of supersymmetry breaking will be fit to the observed spectrum and it is beneficial to ask beforehand: what accuracy is required to always allow the discrimination of two particular models and which are the most important masses to observe? Each model predicts a bounded patch in the space of observables once unknown parameters are scanned over. The questions can be answered by minimising a "distance" measure between the two hypersurfaces. We construct a distance measure that scales like a constant fraction of an observable. Genetic algorithms, including concepts such as natural selection, fitness and mutations, provide a solution to the minimisation problem. We illustrate the efficiency of the method by comparing three different classes of string models for which the above questions could not be answered with previous techniques. The required accuracy is in the range accessible to the Large Hadron Collider (LHC) when combined with a future linear collider (LC) facility. The technique presented here can be applied to more general classes of models or observables.

  18. Actuator Placement Via Genetic Algorithm for Aircraft Morphing

    NASA Technical Reports Server (NTRS)

    Crossley, William A.; Cook, Andrea M.

    2001-01-01

    This research continued work that began under the support of NASA Grant NAG1-2119. The focus of this effort was to continue investigations of Genetic Algorithm (GA) approaches that could be used to solve an actuator placement problem by treating this as a discrete optimization problem. In these efforts, the actuators are assumed to be "smart" devices that change the aerodynamic shape of an aircraft wing to alter the flow past the wing, and, as a result, provide aerodynamic moments that could provide flight control. The earlier work investigated issued for the problem statement, developed the appropriate actuator modeling, recognized the importance of symmetry for this problem, modified the aerodynamic analysis routine for more efficient use with the genetic algorithm, and began a problem size study to measure the impact of increasing problem complexity. The research discussed in this final summary further investigated the problem statement to provide a "combined moment" problem statement to simultaneously address roll, pitch and yaw. Investigations of problem size using this new problem statement provided insight into performance of the GA as the number of possible actuator locations increased. Where previous investigations utilized a simple wing model to develop the GA approach for actuator placement, this research culminated with application of the GA approach to a high-altitude unmanned aerial vehicle concept to demonstrate that the approach is valid for an aircraft configuration.

  19. Using the Genetic Algorithm to Find Coils for Compact Stellarators

    NASA Astrophysics Data System (ADS)

    Miner, , Jr.; Valanju, P. M.; Hirshman, S. P.; Brooks, A.; Pomphrey, N.

    1999-11-01

    Stellarators are now optimized by finding the shape of the plasma surface that produces a desired mix of physics properties. The challenge is to find a practical coil set that creates that optimized surface with sufficient accuracy to retain the desired physics properties and still meet engineering and experimental constraints. Given the wide range of possible coil geometries, this is a daunting task requiring iterations between a practical coil geometry and the physics properties produced by it. A novel technique, the Genetic Algorithm (GA) (D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Leaning), (Addison Wesley, New York) 1989., has recently been applied to this problem. The GA is a computational search procedure for finding the global minimum of a target function using natural selection. This technique has been applied to the design of coils for the NCSX. Typically > 30 coil contours are needed to reproduce the necessary accuracy. Using GA, the result can be improved by choosing a small subset (e.g. 10) contours, each carrying different currents from among a much larger number (e.g. 50).

  20. Optimal Robust Motion Controller Design Using Multiobjective Genetic Algorithm

    PubMed Central

    Sve?ko, Rajko

    2014-01-01

    This paper describes the use of a multiobjective genetic algorithm for robust motion controller design. Motion controller structure is based on a disturbance observer in an RIC framework. The RIC approach is presented in the form with internal and external feedback loops, in which an internal disturbance rejection controller and an external performance controller must be synthesised. This paper involves novel objectives for robustness and performance assessments for such an approach. Objective functions for the robustness property of RIC are based on simple even polynomials with nonnegativity conditions. Regional pole placement method is presented with the aims of controllers' structures simplification and their additional arbitrary selection. Regional pole placement involves arbitrary selection of central polynomials for both loops, with additional admissible region of the optimized pole location. Polynomial deviation between selected and optimized polynomials is measured with derived performance objective functions. A multiobjective function is composed of different unrelated criteria such as robust stability, controllers' stability, and time-performance indexes of closed loops. The design of controllers and multiobjective optimization procedure involve a set of the objectives, which are optimized simultaneously with a genetic algorithm梔ifferential evolution. PMID:24987749

  1. An Indirect Genetic Algorithm for Set Covering Problems Journal of the Operational Research Society, 53 (10): 1118-1126, 2002.

    E-print Network

    Aickelin, Uwe

    1 An Indirect Genetic Algorithm for Set Covering Problems Journal of the Operational Research 1BB UK, uxa@cs.nott.ac.uk Abstract This paper presents a new type of genetic algorithm for the set algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself

  2. Combining neural networks and genetic algorithms for hydrological flow forecasting

    NASA Astrophysics Data System (ADS)

    Neruda, Roman; Srejber, Jan; Neruda, Martin; Pascenko, Petr

    2010-05-01

    We present a neural network approach to rainfall-runoff modeling for small size river basins based on several time series of hourly measured data. Different neural networks are considered for short time runoff predictions (from one to six hours lead time) based on runoff and rainfall data observed in previous time steps. Correlation analysis shows that runoff data, short time rainfall history, and aggregated API values are the most significant data for the prediction. Neural models of multilayer perceptron and radial basis function networks with different numbers of units are used and compared with more traditional linear time series predictors. Out of possible 48 hours of relevant history of all the input variables, the most important ones are selected by means of input filters created by a genetic algorithm. The genetic algorithm works with population of binary encoded vectors defining input selection patterns. Standard genetic operators of two-point crossover, random bit-flipping mutation, and tournament selection were used. The evaluation of objective function of each individual consists of several rounds of building and testing a particular neural network model. The whole procedure is rather computational exacting (taking hours to days on a desktop PC), thus a high-performance mainframe computer has been used for our experiments. Results based on two years worth data from the Ploucnice river in Northern Bohemia suggest that main problems connected with this approach to modeling are ovetraining that can lead to poor generalization, and relatively small number of extreme events which makes it difficult for a model to predict the amplitude of the event. Thus, experiments with both absolute and relative runoff predictions were carried out. In general it can be concluded that the neural models show about 5 per cent improvement in terms of efficiency coefficient over liner models. Multilayer perceptrons with one hidden layer trained by back propagation algorithm and predicting relative runoff show the best behavior so far. Utilizing the genetically evolved input filter improves the performance of yet another 5 per cent. In the future we would like to continue with experiments in on-line prediction using real-time data from Smeda River with 6 hours lead time forecast. Following the operational reality we will focus on classification of the runoffs into flood alert levels, and reformulation of the time series prediction task as a classification problem. The main goal of all this work is to improve flood warning system operated by the Czech Hydrometeorological Institute.

  3. Investigations into a Genetic Algorithm for Protein Sequences Selwyn-Lloyd McPherson

    E-print Network

    Investigations into a Genetic Algorithm for Protein Sequences Selwyn-Lloyd McPherson Biochemistry algorithm is Particle Swarm Optimization (PSO) which attempts to model the group movement of insect swarms and algorithms for tackling challenging problems in engineering and mathematics. As our understanding

  4. Genetic Algorithm Optimization of Artificial Neural Networks for Hydrological Modelling

    NASA Astrophysics Data System (ADS)

    Abrahart, R. J.

    2004-05-01

    This paper will consider the case for genetic algorithm optimization in the development of an artificial neural network model. It will provide a methodological evaluation of reported investigations with respect to hydrological forecasting and prediction. The intention in such operations is to develop a superior modelling solution that will be: \\begin{itemize} more accurate in terms of output precision and model estimation skill; more tractable in terms of personal requirements and end-user control; and/or more robust in terms of conceptual and mechanical power with respect to adverse conditions. The genetic algorithm optimization toolbox could be used to perform a number of specific roles or purposes and it is the harmonious and supportive relationship between neural networks and genetic algorithms that will be highlighted and assessed. There are several neural network mechanisms and procedures that could be enhanced and potential benefits are possible at different stages in the design and construction of an operational hydrological model e.g. division of inputs; identification of structure; initialization of connection weights; calibration of connection weights; breeding operations between successful models; and output fusion associated with the development of ensemble solutions. Each set of opportunities will be discussed and evaluated. Two strategic questions will also be considered: [i] should optimization be conducted as a set of small individual procedures or as one large holistic operation; [ii] what specific function or set of weighted vectors should be optimized in a complex software product e.g. timings, volumes, or quintessential hydrological attributes related to the 'problem situation' - that might require the development flood forecasting, drought estimation, or record infilling applications. The paper will conclude with a consideration of hydrological forecasting solutions developed on the combined methodologies of co-operative co-evolution and operational specialization. The standard approach to neural-evolution is at the network level such that a population of working solutions is manipulated until the fittest member is found. SANE [Symbiotic Adaptive Neuro-Evolution]1 source code offers an alternative method based on co-operative co-evolution in which a population of hidden neurons is evolved. The task of each hidden neuron is to establish appropriate connections that will provide: [i] a functional solution and [ii] performance improvements. Each member of the population attempts to optimize one particular aspect of the overall modelling process and evolution can lead to several different forms of specialization. This method of adaptive evolution also facilitates the creation of symbiotic relationships in which individual members must co-operate with others - who must be present - to permit survival. 1http://www.cs.utexas.edu/users/nn/pages/software/abstracts.html#sane-c

  5. Use of genetic algorithm for the selection of EEG features

    NASA Astrophysics Data System (ADS)

    Asvestas, P.; Korda, A.; Kostopoulos, S.; Karanasiou, I.; Ouzounoglou, A.; Sidiropoulos, K.; Ventouras, E.; Matsopoulos, G.

    2015-09-01

    Genetic Algorithm (GA) is a popular optimization technique that can detect the global optimum of a multivariable function containing several local optima. GA has been widely used in the field of biomedical informatics, especially in the context of designing decision support systems that classify biomedical signals or images into classes of interest. The aim of this paper is to present a methodology, based on GA, for the selection of the optimal subset of features that can be used for the efficient classification of Event Related Potentials (ERPs), which are recorded during the observation of correct or incorrect actions. In our experiment, ERP recordings were acquired from sixteen (16) healthy volunteers who observed correct or incorrect actions of other subjects. The brain electrical activity was recorded at 47 locations on the scalp. The GA was formulated as a combinatorial optimizer for the selection of the combination of electrodes that maximizes the performance of the Fuzzy C Means (FCM) classification algorithm. In particular, during the evolution of the GA, for each candidate combination of electrodes, the well-known (?, ?, ?) features were calculated and were evaluated by means of the FCM method. The proposed methodology provided a combination of 8 electrodes, with classification accuracy 93.8%. Thus, GA can be the basis for the selection of features that discriminate ERP recordings of observations of correct or incorrect actions.

  6. First-Principles Molecular Structure Search with a Genetic Algorithm.

    PubMed

    Supady, Adriana; Blum, Volker; Baldauf, Carsten

    2015-11-23

    The identification of low-energy conformers for a given molecule is a fundamental problem in computational chemistry and cheminformatics. We assess here a conformer search that employs a genetic algorithm for sampling the low-energy segment of the conformation space of molecules. The algorithm is designed to work with first-principles methods, facilitated by the incorporation of local optimization and blacklisting conformers to prevent repeated evaluations of very similar solutions. The aim of the search is not only to find the global minimum but to predict all conformers within an energy window above the global minimum. The performance of the search strategy is (i) evaluated for a reference data set extracted from a database with amino acid dipeptide conformers obtained by an extensive combined force field and first-principles search and (ii) compared to the performance of a systematic search and a random conformer generator for the example of a drug-like ligand with 43 atoms, 8 rotatable bonds, and 1 cis/trans bond. PMID:26484612

  7. Human emotion detector based on genetic algorithm using lip features

    NASA Astrophysics Data System (ADS)

    Brown, Terrence; Fetanat, Gholamreza; Homaifar, Abdollah; Tsou, Brian; Mendoza-Schrock, Olga

    2010-04-01

    We predicted human emotion using a Genetic Algorithm (GA) based lip feature extractor from facial images to classify all seven universal emotions of fear, happiness, dislike, surprise, anger, sadness and neutrality. First, we isolated the mouth from the input images using special methods, such as Region of Interest (ROI) acquisition, grayscaling, histogram equalization, filtering, and edge detection. Next, the GA determined the optimal or near optimal ellipse parameters that circumvent and separate the mouth into upper and lower lips. The two ellipses then went through fitness calculation and were followed by training using a database of Japanese women's faces expressing all seven emotions. Finally, our proposed algorithm was tested using a published database consisting of emotions from several persons. The final results were then presented in confusion matrices. Our results showed an accuracy that varies from 20% to 60% for each of the seven emotions. The errors were mainly due to inaccuracies in the classification, and also due to the different expressions in the given emotion database. Detailed analysis of these errors pointed to the limitation of detecting emotion based on the lip features alone. Similar work [1] has been done in the literature for emotion detection in only one person, we have successfully extended our GA based solution to include several subjects.

  8. Gravitational Lens Modeling with Genetic Algorithms and Particle Swarm Optimizers

    E-print Network

    Rogers, Adam

    2011-01-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automa...

  9. Optimal Design of RF Energy Harvesting Device Using Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Mori, T.; Sato, Y.; Adriano, R.; Igarashi, H.

    2015-11-01

    This paper presents optimal design of an RF energy harvesting device using genetic algorithm (GA). In the present RF harvester, a planar spiral antenna (PSA) is loaded with matching and rectifying circuits. On the first stage of the optimal design, the shape parameters of PSA are optimized using . Then, the equivalent circuit of the optimized PSA is derived for optimization of the circuits. Finally, the parameters of RF energy harvesting circuit are optimized to maximize the output power using GA. It is shown that the present optimization increases the output power by a factor of five. The manufactured energy harvester starts working when the input electric field is greater than 0.5 V/m.

  10. Chiral metamaterial design using optimized pixelated inclusions with genetic algorithm

    NASA Astrophysics Data System (ADS)

    Akturk, Cemal; Karaaslan, Muharrem; Ozdemir, Ersin; Ozkaner, Vedat; Dincer, Furkan; Bakir, Mehmet; Ozer, Zafer

    2015-03-01

    Chiral metamaterials have been a research area for many researchers due to their polarization rotation properties on electromagnetic waves. However, most of the proposed chiral metamaterials are designed depending on experience or time-consuming inefficient simulations. A method is investigated for designing a chiral metamaterial with a strong and natural chirality admittance by optimizing a grid of metallic pixels through both sides of a dielectric sheet placed perpendicular to the incident wave by using a genetic algorithm (GA) technique based on finite element method solver. The effective medium parameters are obtained by using constitutive equations and S parameters. The proposed methodology is very efficient for designing a chiral metamaterial with the desired effective medium parameters. By using GA-based topology, it is proven that a chiral metamaterial can be designed and manufactured more easily and with a low cost.

  11. Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

    NASA Technical Reports Server (NTRS)

    Story, George

    2015-01-01

    Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. One remaining issue is the cost of hybrids versus the existing launch propulsion systems. This paper will review the known state-of-the-art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

  12. Genetic algorithms and solid state NMR pulse sequences

    NASA Astrophysics Data System (ADS)

    Bechmann, Matthias; Clark, John; Sebald, Angelika

    2013-03-01

    The use of genetic algorithms for the optimisation of magic angle spinning NMR pulse sequences is discussed. The discussion uses as an example the optimisation of the C721 dipolar recoupling pulse sequence, aiming to achieve improved efficiency for spin systems characterised by large chemical shielding anisotropies and/or small dipolar coupling interactions. The optimised pulse sequence is found to be robust over a wide range of parameters, requires only minimal a priori knowledge of the spin system for experimental implementations with buildup rates being solely determined by the magnitude of the dipolar coupling interaction, but is found to be less broadbanded than the original C721 pulse sequence. The optimised pulse sequence breaks the synchronicity between r.f. pulses and sample spinning.

  13. Alien Genetic Algorithm for Exploration of Search Space

    NASA Astrophysics Data System (ADS)

    Patel, Narendra; Padhiyar, Nitin

    2010-10-01

    Genetic Algorithm (GA) is a widely accepted population based stochastic optimization technique used for single and multi objective optimization problems. Various versions of modifications in GA have been proposed in last three decades mainly addressing two issues, namely increasing convergence rate and increasing probability of global minima. While both these. While addressing the first issue, GA tends to converge to a local optima and addressing the second issue corresponds the large computational efforts. Thus, to reduce the contradictory effects of these two aspects, we propose a modification in GA by adding an alien member in the population at every generation. Addition of an Alien member in the current population at every generation increases the probability of obtaining global minima at the same time maintaining higher convergence rate. With two test cases, we have demonstrated the efficacy of the proposed GA by comparing with the conventional GA.

  14. An adaptive genetic algorithm for crystal structure prediction.

    PubMed

    Wu, S Q; Ji, M; Wang, C Z; Nguyen, M C; Zhao, X; Umemoto, K; Wentzcovitch, R M; Ho, K M

    2014-01-22

    We present a genetic algorithm (GA) for structural search that combines the speed of structure exploration by classical potentials with the accuracy of density functional theory (DFT) calculations in an adaptive and iterative way. This strategy increases the efficiency of the DFT-based GA by several orders of magnitude. This gain allows a considerable increase in the size and complexity of systems that can be studied by first principles. The performance of the method is illustrated by successful structure identifications of complex binary and ternary intermetallic compounds with 36 and 54 atoms per cell, respectively. The discovery of a multi-TPa Mg-silicate phase with unit cell containing up to 56 atoms is also reported. Such a phase is likely to be an essential component of terrestrial exoplanetary mantles. PMID:24351274

  15. An Intelligent Model for Pairs Trading Using Genetic Algorithms

    PubMed Central

    Huang, Chien-Feng; Hsu, Chi-Jen; Chen, Chi-Chung; Chang, Bao Rong; Li, Chen-An

    2015-01-01

    Pairs trading is an important and challenging research area in computational finance, in which pairs of stocks are bought and sold in pair combinations for arbitrage opportunities. Traditional methods that solve this set of problems mostly rely on statistical methods such as regression. In contrast to the statistical approaches, recent advances in computational intelligence (CI) are leading to promising opportunities for solving problems in the financial applications more effectively. In this paper, we present a novel methodology for pairs trading using genetic algorithms (GA). Our results showed that the GA-based models are able to significantly outperform the benchmark and our proposed method is capable of generating robust models to tackle the dynamic characteristics in the financial application studied. Based upon the promising results obtained, we expect this GA-based method to advance the research in computational intelligence for finance and provide an effective solution to pairs trading for investment in practice. PMID:26339236

  16. Clustering online social network communities using genetic algorithms

    E-print Network

    Hajeer, Mustafa H; Dasgupta, Dipankar; Sanyal, Sugata

    2013-01-01

    To analyze the activities in an Online Social network (OSN), we introduce the concept of "Node of Attraction" (NoA) which represents the most active node in a network community. This NoA is identified as the origin/initiator of a post/communication which attracted other nodes and formed a cluster at any point in time. In this research, a genetic algorithm (GA) is used as a data mining method where the main objective is to determine clusters of network communities in a given OSN dataset. This approach is efficient in handling different type of discussion topics in our studied OSN - comments, emails, chat expressions, etc. and can form clusters according to one or more topics. We believe that this work can be useful in finding the source for spread of this GA-based clustering of online interactions and reports some results of experiments with real-world data and demonstrates the performance of proposed approach.

  17. An adaptive genetic algorithm for crystal structure prediction

    SciTech Connect

    Wu, Shunqing; Ji, Min; Wang, Cai-Zhuang; Nguyen, Manh Cuong; Zhao, Xin; Umemoto, K.; Wentzcovitch, R. M.; Ho, Kai-Ming

    2013-10-31

    We present a genetic algorithm (GA) for structural search that combines the speed of structure exploration by classical potentials with the accuracy of density functional theory (DFT) calculations in an adaptive and iterative way. This strategy increases the efficiency of the DFT-based GA by several orders of magnitude. This gain allows a considerable increase in the size and complexity of systems that can be studied by first principles. The performance of the method is illustrated by successful structure identifications of complex binary and ternary intermetallic compounds with 36 and 54 atoms per cell, respectively. The discovery of a multi-TPa Mg-silicate phase with unit cell containing up to 56 atoms is also reported. Such a phase is likely to be an essential component of terrestrial exoplanetary mantles.

  18. Darwin Meets Einstein: LISA Data Analysis Using Genetic Algorithms

    E-print Network

    Jeff Crowder; Neil J. Cornish; Lucas Reddinger

    2006-01-17

    This work presents the first application of the method of Genetic Algorithms (GAs) to data analysis for the Laser Interferometer Space Antenna (LISA). In the low frequency regime of the LISA band there are expected to be tens of thousands galactic binary systems that will be emitting gravitational waves detectable by LISA. The challenge of parameter extraction of such a large number of sources in the LISA data stream requires a search method that can efficiently explore the large parameter spaces involved. As signals of many of these sources will overlap, a global search method is desired. GAs represent such a global search method for parameter extraction of multiple overlapping sources in the LISA data stream. We find that GAs are able to correctly extract source parameters for overlapping sources. Several optimizations of a basic GA are presented with results derived from applications of the GA searches to simulated LISA data.

  19. Genetic algorithms and solid state NMR pulse sequences

    E-print Network

    Bechmann, Matthias; Sebald, Angelika

    2013-01-01

    The use of genetic algorithms for the optimisation of magic angle spinning NMR pulse sequences is discussed. The discussion uses as an example the optimisation of the C7 dipolar recoupling pulse sequence, aiming to achieve improved efficiency for spin systems characterised by large chemical shielding anisotropies and/or small dipolar coupling interactions. The optimised pulse sequence is found to be robust over a wide range of parameters, requires only minimal a priori knowledge of the spin system for experimental implementations with buildup rates being solely determined by the magnitude of the dipolar coupling interaction, but is found to be less broadbanded than the original C7 pulse sequence. The optimised pulse sequence breaks the synchronicity between r.f. pulses and sample spinning.

  20. Strawberry Maturity Neural Network Detectng System Based on Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Xu, Liming

    The quick and non-detective detection of agriculture product is one of the measures to increase the precision and productivity of harvesting and grading. Having analyzed H frequency of different maturities in different light intensities, the results show that H frequency for the same maturity has little influence in different light intensities; Under the same light intensity, three strawberry maturities are changing in order. After having confirmed the H frequency section to distinguish the different strawberry maturity, the triplelayer feed-forward neural network system to detect strawberry maturity was designed by using genetic algorithm. The test results show that the detecting precision ratio is 91.7%, it takes 160ms to distinguish one strawberry. Therefore, the online non-detective detecting the strawberry maturity could be realized.

  1. Optimization and implementation of piezoelectric radiators using the genetic algorithm

    NASA Astrophysics Data System (ADS)

    Bai, Mingsian R.; Huang, Chinghong

    2003-06-01

    Very thin and small (45 mm35 mm0.35 mm) piezoelectric radiators have been developed in this research. The system is modeled by using the energy method in conjunction with the assumed-modes method. Electrical system, mechanical system, and acoustic loading have all been accounted for during the modeling stage. On the basis of the simulation model, the genetic algorithm (GA) is employed to optimize the overall configurations for a low resonance frequency and a large gain. The resulting designs are then implemented and evaluated experimentally. Performance indices for the experimental evaluation include the frequency response, the directional response, the sensitivity, and the efficiency. It is found in the experimental results that the piezoelectric radiators are able to produce comparable acoustical output with significantly less electrical input than the voice-coil panel speakers.

  2. Cloud identification using genetic algorithms and massively parallel computation

    NASA Technical Reports Server (NTRS)

    Buckles, Bill P.; Petry, Frederick E.

    1996-01-01

    As a Guest Computational Investigator under the NASA administered component of the High Performance Computing and Communication Program, we implemented a massively parallel genetic algorithm on the MasPar SIMD computer. Experiments were conducted using Earth Science data in the domains of meteorology and oceanography. Results obtained in these domains are competitive with, and in most cases better than, similar problems solved using other methods. In the meteorological domain, we chose to identify clouds using AVHRR spectral data. Four cloud speciations were used although most researchers settle for three. Results were remarkedly consistent across all tests (91% accuracy). Refinements of this method may lead to more timely and complete information for Global Circulation Models (GCMS) that are prevalent in weather forecasting and global environment studies. In the oceanographic domain, we chose to identify ocean currents from a spectrometer having similar characteristics to AVHRR. Here the results were mixed (60% to 80% accuracy). Given that one is willing to run the experiment several times (say 10), then it is acceptable to claim the higher accuracy rating. This problem has never been successfully automated. Therefore, these results are encouraging even though less impressive than the cloud experiment. Successful conclusion of an automated ocean current detection system would impact coastal fishing, naval tactics, and the study of micro-climates. Finally we contributed to the basic knowledge of GA (genetic algorithm) behavior in parallel environments. We developed better knowledge of the use of subpopulations in the context of shared breeding pools and the migration of individuals. Rigorous experiments were conducted based on quantifiable performance criteria. While much of the work confirmed current wisdom, for the first time we were able to submit conclusive evidence. The software developed under this grant was placed in the public domain. An extensive user's manual was written and distributed nationwide to scientists whose work might benefit from its availability. Several papers, including two journal articles, were produced.

  3. Novel genetic algorithm search procedure for LEED surface structure determination.

    PubMed

    Viana, M L; dos Reis, D D; Soares, E A; Van Hove, M A; Moritz, W; de Carvalho, V E

    2014-06-01

    Low Energy Electron Diffraction (LEED) is one of the most powerful experimental techniques for surface structure analysis but until now only a trial-and-error approach has been successful. So far, fitting procedures developed to optimize structural and nonstructural parameters-by minimization of the R-factor-have had a fairly small convergence radius, suitable only for local optimization. However, the identification of the global minimum among the several local minima is essential for complex surface structures. Global optimization methods have been applied to LEED structure determination, but they still require starting from structures that are relatively close to the correct one, in order to find the final structure. For complex systems, the number of trial structures and the resulting computation time increase so rapidly that the task of finding the correct model becomes impractical using the present methodologies. In this work we propose a new search method, based on Genetic Algorithms, which is able to determine the correct structural model starting from completely random structures. This method-called here NGA-LEED for Novel Genetic Algorithm for LEED-utilizes bond lengths and symmetry criteria to select reasonable trial structures before performing LEED calculations. This allows a reduction of the parameter space and, consequently of the calculation time, by several orders of magnitude. A refinement of the parameters by least squares fit of simulated annealing is performed only at some intermediate stages and in the final step. The method was successfully tested for two systems, Ag(1?1?1)(4犠4)-O and Au(1?1?0)-(1犠2), both in theory versus theory and in theory versus experiment comparisons. Details of the implementation as well as the results for these two systems are presented. PMID:24824047

  4. A new perspective on dark energy modeling via genetic algorithms

    SciTech Connect

    Nesseris, Savvas; Garc韆-Bellido, Juan E-mail: juan.garciabellido@uam.es

    2012-11-01

    We use Genetic Algorithms to extract information from several cosmological probes, such as the type Ia supernovae (SnIa), the Baryon Acoustic Oscillations (BAO) and the growth rate of matter perturbations. This is done by implementing a model independent and bias-free reconstruction of the various scales and distances that characterize the data, like the luminosity d{sub L}(z) and the angular diameter distance d{sub A}(z) in the SnIa and BAO data, respectively, or the dependence with redshift of the matter density ?{sub m}(a) in the growth rate data, f?{sub 8}(z). These quantities can then be used to reconstruct the expansion history of the Universe, and the resulting Dark Energy (DE) equation of state w(z) in the context of FRW models, or the mass radial function ?{sub M}(r) in LTB models. In this way, the reconstruction is completely independent of our prior bias. Furthermore, we use this method to test the Etherington relation, ie the well-known relation between the luminosity and the angular diameter distance, ??d{sub L}(z)/(1+z){sup 2}d{sub A}(z), which is equal to 1 in metric theories of gravity. We find that the present data seem to suggest a 3-? deviation from one at redshifts z ? 0.5. Finally, we present a novel way, within the Genetic Algorithm paradigm, to analytically estimate the errors on the reconstructed quantities by calculating a Path Integral over all possible functions that may contribute to the likelihood. We show that this can be done regardless of the data being correlated or uncorrelated with each other and we also explicitly demonstrate that our approach is in good agreement with other error estimation techniques like the Fisher Matrix approach and the Bootstrap Monte Carlo.

  5. A genetic algorithm for finding pulse sequences for NMR quantum computing

    E-print Network

    M. J. Rethinam; A. K. Javali; E. C. Behrman; J. E. Steck; S. R. Skinner

    2004-04-29

    We present a genetic algorithm for finding a set of pulse sequences, or rotations, for a given quantum logic gate, as implemented by NMR. We demonstrate the utility of the method by showing that shorter sequences than have been previously published can be found for both a CNOT and for the central part of Shor's algorithm (for N=15.) Artificial intelligence techniques like the genetic algorithm here presented have an enormous potential for simplifying the implementation of working quantum computers.

  6. Aerodynamic Shape Optimization Using A Real-Number-Encoded Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.; Pulliam, Thomas H.

    2001-01-01

    A new method for aerodynamic shape optimization using a genetic algorithm with real number encoding is presented. The algorithm is used to optimize three different problems, a simple hill climbing problem, a quasi-one-dimensional nozzle problem using an Euler equation solver and a three-dimensional transonic wing problem using a nonlinear potential solver. Results indicate that the genetic algorithm is easy to implement and extremely reliable, being relatively insensitive to design space noise.

  7. Finding Ground States of Sherrington-Kirkpatrick Spin Glasses with Hierarchical BOA and Genetic Algorithms

    E-print Network

    Kobe, Sigismund

    Finding Ground States of Sherrington-Kirkpatrick Spin Glasses with Hierarchical BOA and Genetic- erarchical Bayesian optimization algorithm (hBOA) to reli- ably identify ground states of SK instances. Performance of hBOA is compared to that of the genetic algorithm with two common crossover operators

  8. An Efficient Solution Method for Weber Problems with Barriers based on Genetic Algorithms

    E-print Network

    Klamroth, Kathrin

    An Efficient Solution Method for Weber Problems with Barriers based on Genetic Algorithms M is presented that, by iteratively executing a genetic algorithm for the selection of subproblems, quickly finds, such that the objective models, in this 1 #12;case, the total transportation costs. In realistic location models, various

  9. Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling

    E-print Network

    Hwang, Kai

    Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling Shanshan, we propose a new Space-Time Genetic Algorithm (STGA) for trusted job scheduling, which is very fast and easy to implement. Under our new model, a job can possibly fail if the site se- curity level is lower

  10. User-Based Document Clustering by Redescribing Subject Descriptions with a Genetic Algorithm.

    ERIC Educational Resources Information Center

    Gordon, Michael D.

    1991-01-01

    Discussion of clustering of documents and queries in information retrieval systems focuses on the use of a genetic algorithm to adapt subject descriptions so that documents become more effective in matching relevant queries. Various types of clustering are explained, and simulation experiments used to test the genetic algorithm are described. (27

  11. Order-Based Fitness Functions for Genetic Algorithms Applied to Relevance Feedback.

    ERIC Educational Resources Information Center

    Lopez-Pujalte, Cristina; Guerrero-Bote, Vicente P.; de Moya-Anegon, Felix

    2003-01-01

    Discusses genetic algorithms in information retrieval, especially for relevance feedback, and evaluates the efficacy of a genetic algorithm with various order-based fitness functions for relevance feedback in a test database. Compares results with the Ide dec-hi method, one of the best traditional methods. (Contains 56 references.) (Author/LRW)

  12. New knowledge-based genetic algorithm for excavator boom structural optimization

    NASA Astrophysics Data System (ADS)

    Hua, Haiyan; Lin, Shuwen

    2014-03-01

    Due to the insufficiency of utilizing knowledge to guide the complex optimal searching, existing genetic algorithms fail to effectively solve excavator boom structural optimization problem. To improve the optimization efficiency and quality, a new knowledge-based real-coded genetic algorithm is proposed. A dual evolution mechanism combining knowledge evolution with genetic algorithm is established to extract, handle and utilize the shallow and deep implicit constraint knowledge to guide the optimal searching of genetic algorithm circularly. Based on this dual evolution mechanism, knowledge evolution and population evolution can be connected by knowledge influence operators to improve the configurability of knowledge and genetic operators. Then, the new knowledge-based selection operator, crossover operator and mutation operator are proposed to integrate the optimal process knowledge and domain culture to guide the excavator boom structural optimization. Eight kinds of testing algorithms, which include different genetic operators, are taken as examples to solve the structural optimization of a medium-sized excavator boom. By comparing the results of optimization, it is shown that the algorithm including all the new knowledge-based genetic operators can more remarkably improve the evolutionary rate and searching ability than other testing algorithms, which demonstrates the effectiveness of knowledge for guiding optimal searching. The proposed knowledge-based genetic algorithm by combining multi-level knowledge evolution with numerical optimization provides a new effective method for solving the complex engineering optimization problem.

  13. MEMS Design Synthesis: Integrating Case-based Reasoning and Multi-objective Genetic Algorithms

    E-print Network

    Agogino, Alice M.

    MEMS Design Synthesis: Integrating Case-based Reasoning and Multi-objective Genetic Algorithms-Electro-Mechanical Systems (MEMS) design tool that uses a multi-objective genetic algorithm (MOGA) to synthesize and optimize conceptual designs. CBR utilizes previously successful MEMS designs and sub-assemblies as building blocks

  14. A Comparative Study of Immune System Based Genetic Algorithms in Dynamic Environments

    E-print Network

    Yang, Shengxiang

    A Comparative Study of Immune System Based Genetic Algorithms in Dynamic Environments Shengxiang. This paper investigates several GAs inspired by the ideas of biological immune system and transformation to the immune system based genetic algorithm to deal with dynamic environments. Using a series of systematically

  15. MECHANISTIC-BASED GENETIC ALGORITHM SEARCH ON A BEOWULF CLUSTER OF LINUX PCS

    E-print Network

    Hoffman, Forrest M.

    MECHANISTIC-BASED GENETIC ALGORITHM SEARCH ON A BEOWULF CLUSTER OF LINUX PCS Jin-Ping Gwo), Beowulf Linux cluster. ABSTRACT A simple genetic algorithm (SGA) was implemented on a cluster of Linux PCs Beowulf project was also facilitated by the freely available Linux operating system. The open source

  16. Plasma X-ray Spectra Analysis Using Genetic Algorithms Igor E. Golovkin

    E-print Network

    Louis, Sushil J.

    Plasma X-ray Spectra Analysis Using Genetic Algorithms Igor E. Golovkin Department of Physics Reno Reno, NV 89557 sushil@cs.unr.edu Abstract X-ray spectroscopic analysis is a powerful tool for plasma diagnostics. We use genetic algorithms to automatically analyze experi- mental X-ray line spectra

  17. Empirical Modelling of Genetic Algorithms Richard Myers rich@cs.york.ac.uk

    E-print Network

    Hancock, Edwin

    Empirical Modelling of Genetic Algorithms Richard Myers rich@cs.york.ac.uk Department of Computer as the standard for genetic algorithms, although there are others, e.g. the evolutionary strategies (Schwefel life (Jefferson, Collins, Cooper, Dyer, Flowers, Korf, Taylor, and WangJefferson et al.1991

  18. A Genetic Algorithms Approach to Modeling the Performance of Memory-bound Computations

    E-print Network

    Snavely, Allan

    , CA 94720 Abstract Benchmarks that measure memory bandwidth, such as STREAM, Apex-MAPS and Multi of such benchmarks. A Genetic Algorithm approach is used to "learn" bandwidth as a function of cache hit rates per ma Performance Modeling and Prediction, Memory Bound Applica- tions, Machine Learning, Genetic Algorithms, Cache

  19. Effect of Global Parallelism on the Behavior of a Steady State Genetic Algorithm for Design Optimization

    E-print Network

    Davison, Brian D.

    applied global parallelism to GADO (Genetic Algorithm for Design Optimization) be- cause among experi- ments conducted in several design optimization domains in order to examine the effect of globalEffect of Global Parallelism on the Behavior of a Steady State Genetic Algorithm for Design

  20. Improving the Diversity Defense of Genetic Algorithm-Based Moving Target Approaches

    E-print Network

    Erway, Jennifer

    Improving the Diversity Defense of Genetic Algorithm-Based Moving Target Approaches Michael B). For example, Genetic Algorithms (GAs) have been successfully used to find alternative configurations that can the configurations are secure, this situation limits the diversity the approach can achieve. This paper describes how

  1. Population Diversity in Genetic Algorithm for Vehicle Routing Problem with Time Windows

    E-print Network

    Zhu, Kenny Q.

    Population Diversity in Genetic Algorithm for Vehicle Routing Problem with Time Windows Kenny Q@comp.nus.edu.sg 1 Introduction Traditional genetic algorithms (GA) often suffer from loss of diversity through, the main- tenance of diversity is one of the most fundamental issues of GA. Previous studies on population

  2. A Multi-Tiered Genetic Algorithm for Data Mining and Hypothesis Refinement

    E-print Network

    Taylor, Christopher M.

    2009-01-01

    , and are thus limited in their ability to describe patterns. Genetic algorithms provide a more flexible approach, and yet the genetic algorithms that have been employed don't capitalize on the fact that data models have two levels: individual rules...

  3. Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design

    E-print Network

    Wu, Annie S.

    Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design Viet C. Trinh of Electrical Engineering and Computer Science University of Central Florida Orlando, FL 32816, USA ABSTRACT Genetic algorithms are commonly used to perform searches on complex search spaces for optimum solutions

  4. Using genetic algorithms to select and create features for pattern classification. Technical report

    SciTech Connect

    Chang, E.I.; Lippmann, R.P.

    1991-03-11

    Genetic algorithms were used to select and create features and to select reference exemplar patterns for machine vision and speech pattern classification tasks. On a 15-feature machine-vision inspection task, it was found that genetic algorithms performed no better than conventional approaches to feature selection but required much more computation. For a speech recognition task, genetic algorithms required no more computation time than traditional approaches but reduced the number of features required by a factor of five (from 153 to 33 features). On a difficult artificial machine-vision task, genetic algorithms were able to create new features (polynomial functions of the original features) that reduced classification error rates from 10 to almost 0 percent. Neural net and nearest-neighbor classifiers were unable to provide such low error rates using only the original features. Genetic algorithms were also used to reduce the number of reference exemplar patterns and to select the value of k for a k-nearest-neighbor classifier. On a .338 training pattern vowel recognition problem with 10 classes, genetic algorithms simultaneously reduced the number of stored exemplars from 338 to 63 and selected k without significantly decreasing classification accuracy. In all applications, genetic algorithms were easy to apply and found good solutions in many fewer trials than would be required by an exhaustive search. Run times were long but not unreasonable. These results suggest that genetic algorithms may soon be practical for pattern classification problems as faster serial and parallel computers are developed.

  5. Comparing Darwinian, Baldwinian, and Lamarckian Search in a Genetic Algorithm for the 4Cycle Problem

    E-print Network

    Julstrom, Bryant A.

    organism's experiences can modify its geno type. However, genetic algorithms can implement and exploit not modify the chromosome; this fitness represents the chromosome's inherent fitness and the organism's caComparing Darwinian, Baldwinian, and Lamarckian Search in a Genetic Algorithm for the 4瑿ycle

  6. USING GENETIC ALGORITHMS TO EVOLVE CHARACTER BEHAVIOURS IN MODERN VIDEO GAMES

    E-print Network

    Katchabaw, Michael James

    USING GENETIC ALGORITHMS TO EVOLVE CHARACTER BEHAVIOURS IN MODERN VIDEO GAMES T. Bullen and M tbullen@uwo.ca, katchab@csd.uwo.ca KEYWORDS Artificial intelligence, bots, genetic algorithms for the most expert developers. The behaviours of non-player characters in a game are typically defined

  7. Parameter Estimation of Stellar Population Synthesis Using A Combined Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Jin-shu, HAN

    2015-10-01

    For the galaxies composed of different kinds of stars, it is important to estimate the parameters of stellar population synthesis quickly and accurately from the massive data of galactic spectra. It is presented in this paper that the combination of the genetic algorithm (GA) with the simulated annealing (SA) algorithm has the complementary advantages of the good global search ability and fast convergence of GA, as well as the strong local search ability of the SA algorithm. In both the speed and accuracy of the parameter estimation of stellar population synthesis, the GA-SA combined algorithm is superior to the single SA algorithm.

  8. Double Motor Coordinated Control Based on Hybrid Genetic Algorithm and CMAC

    NASA Astrophysics Data System (ADS)

    Cao, Shaozhong; Tu, Ji

    A novel hybrid cerebellar model articulation controller (CMAC) and online adaptive genetic algorithm (GA) controller is introduced to control two Brushless DC motor (BLDCM) which applied in a biped robot. Genetic Algorithm simulates the random learning among the individuals of a group, and CMAC simulates the self-learning of an individual. To validate the ability and superiority of the novel algorithm, experiments have been done in MATLAB/SIMULINK. Analysis among GA, hybrid GA-CMAC and CMAC feed-forward control is also given. The results prove that the torque ripple of the coordinated control system is eliminated by using the hybrid GA-CMAC algorithm.

  9. GenMin: An enhanced genetic algorithm for global optimization

    NASA Astrophysics Data System (ADS)

    Tsoulos, Ioannis G.; Lagaris, I. E.

    2008-06-01

    A new method that employs grammatical evolution and a stopping rule for finding the global minimum of a continuous multidimensional, multimodal function is considered. The genetic algorithm used is a hybrid genetic algorithm in conjunction with a local search procedure. We list results from numerical experiments with a series of test functions and we compare with other established global optimization methods. The accompanying software accepts objective functions coded either in Fortran 77 or in C++. Program summaryProgram title: GenMin Catalogue identifier: AEAR_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAR_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 35 810 No. of bytes in distributed program, including test data, etc.: 436 613 Distribution format: tar.gz Programming language: GNU-C++, GNU-C, GNU Fortran 77 Computer: The tool is designed to be portable in all systems running the GNU C++ compiler Operating system: The tool is designed to be portable in all systems running the GNU C++ compiler RAM: 200 KB Word size: 32 bits Classification: 4.9 Nature of problem: A multitude of problems in science and engineering are often reduced to minimizing a function of many variables. There are instances that a local optimum does not correspond to the desired physical solution and hence the search for a better solution is required. Local optimization techniques are frequently trapped in local minima. Global optimization is hence the appropriate tool. For example, solving a nonlinear system of equations via optimization, employing a least squares type of objective, one may encounter many local minima that do not correspond to solutions (i.e. they are far from zero). Solution method: Grammatical evolution and a stopping rule. Running time: Depending on the objective function. The test example given takes only a few seconds to run.

  10. Efficient Improvement of Silage Additives by Using Genetic Algorithms

    PubMed Central

    Davies, Zoe S.; Gilbert, Richard J.; Merry, Roger J.; Kell, Douglas B.; Theodorou, Michael K.; Griffith, Gareth W.

    2000-01-01

    The enormous variety of substances which may be added to forage in order to manipulate and improve the ensilage process presents an empirical, combinatorial optimization problem of great complexity. To investigate the utility of genetic algorithms for designing effective silage additive combinations, a series of small-scale proof of principle silage experiments were performed with fresh ryegrass. Having established that significant biochemical changes occur over an ensilage period as short as 2 days, we performed a series of experiments in which we used 50 silage additive combinations (prepared by using eight bacterial and other additives, each of which was added at six different levels, including zero [i.e., no additive]). The decrease in pH, the increase in lactate concentration, and the free amino acid concentration were measured after 2 days and used to calculate a 揻itness value that indicated the quality of the silage (compared to a control silage made without additives). This analysis also included a 揷ost element to account for different total additive levels. In the initial experiment additive levels were selected randomly, but subsequently a genetic algorithm program was used to suggest new additive combinations based on the fitness values determined in the preceding experiments. The result was very efficient selection for silages in which large decreases in pH and high levels of lactate occurred along with low levels of free amino acids. During the series of five experiments, each of which comprised 50 treatments, there was a steady increase in the amount of lactate that accumulated; the best treatment combination was that used in the last experiment, which produced 4.6 times more lactate than the untreated silage. The additive combinations that were found to yield the highest fitness values in the final (fifth) experiment were assessed to determine a range of biochemical and microbiological quality parameters during full-term silage fermentation. We found that these combinations compared favorably both with uninoculated silage and with a commercial silage additive. The evolutionary computing methods described here are a convenient and efficient approach for designing silage additives. PMID:10742224

  11. Acta Cryst. (1997). B53, 916-922 Multi-Solution Genetic Algorithm Approach to Surface Structure Determination Using

    E-print Network

    Marks, Laurence D.

    1997-01-01

    916 Acta Cryst. (1997). B53, 916-922 Multi-Solution Genetic Algorithm Approach to Surface Structure-solution genetic algorithm search method utilizing direct methods to solve surface structures from surface of approaches such as simulated annealing (Sheldrick, 1990; Bhat, 1990) and more recently genetic algorithms

  12. Introducing Distance Tracing of Evolutionary Dynamics in a Feasible-Infeasible Two-Population (FI-2Pop) Genetic Algorithm

    E-print Network

    Kimbrough, Steven Orla

    Pop) Genetic Algorithm for Constrained Optimization Steven Orla Kimbrough University of Pennsylvania. i #12;Contents 1 Context and Background 1 2 Constraint Handling in Genetic Algorithms 2 3- eration and dynamics of genetic algorithms (GAs) for constrained optimization. The technique applies

  13. Hybrid Genetic Algorithms: A Review Tarek A. El-Mihoub, Adrian A. Hopgood, Lars Nolle, Alan Battersby

    E-print Network

    Hopgood, Adrian

    Hybrid Genetic Algorithms: A Review Tarek A. El-Mihoub, Adrian A. Hopgood, Lars Nolle, Alan Battersby Abstract--Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems. A genetic algorithm is able to incorporate other

  14. Applying genetic algorithms to the location allocation of shelter sites Xiang Li, Hsiang-te Kung, Jerry Bartholomew, Esra Ozdenerol

    E-print Network

    Li, Xiang

    Applying genetic algorithms to the location allocation of shelter sites Xiang Li, Hsiang-te Kung-hard problem. This paper aims to tackle this problem by genetic algorithms. An extended, problem-specific genetic algorithm is proposed and applied to the location allocation of 50 shelter centers in Shelby

  15. GLOBAL OPTIMIZATION AND REFLECTIVITY DATA FITTING FOR X-RAY MULTILAYER MIRRORS BY MEANS OF GENETIC ALGORITHMS

    E-print Network

    Neumaier, Arnold

    ), Italy ABSTRACT Genetic Algorithms give a powerful and efficient mathematical technique for the solution the best individuals will approximate the optimum parameters. Genetic Algorithms have already been largely. Regarding the case of stacked interferential reflectors (multilayers), Genetic Algorithms have already been

  16. Annealed Genetic Algorithm for Multiple Time Series Prediction K.Y. Szeto and K.H. Cheung

    E-print Network

    Liu, Yunhao

    Annealed Genetic Algorithm for Multiple Time Series Prediction K.Y. Szeto and K.H. Cheung Hong Kong for multiple time series using genetic algorithm is presented. The formulation includes the encoding for the evolution of rules. Overall performance of annealed genetic algorithm with Lee metric is statistically

  17. A Cellular Genetic Algorithm for training Recurrent Neural Networks \\Lambda Kim W. C. Ku M. W. Mak W. C. Siu

    E-print Network

    Mak, Man-Wai

    A Cellular Genetic Algorithm for training Recurrent Neural Networks \\Lambda Kim W. C. Ku M. W. Mak, which uses cel lular genetic algorithms, is proposed. In this paper, the performance of training by a gradient descent method is compared with that by a cellular genetic algorithm. Ex perimental results

  18. Simulation of the Evolution of Information Content in Transcription Factor Binding Sites Using a Parallelized Genetic Algorithm

    E-print Network

    Gobbert, Matthias K.

    a Parallelized Genetic Algorithm Joseph Cornish*, Robert Forder**, Ivan Erill*, Matthias K. Gobbert** *Department a genetic algorithm in parallel using a server-client organization to simulate the evolution are not able to recognize correlation information in binding sites. We implement a genetic algorithm

  19. Natural Selection as an Inhibitor of Genetic Diversity Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics

    E-print Network

    Stephan, Frank

    Natural Selection as an Inhibitor of Genetic Diversity Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics Ruta Mehta Georgia Institute of Technology rmehta@cc.gatech.edu Ioannis of genetic diversity in the long term limit, a widely believed conjecture in genetics [4]. In game theoretic

  20. Genetic Bee Colony (GBC) algorithm: A new gene selection method for microarray cancer classification.

    PubMed

    Alshamlan, Hala M; Badr, Ghada H; Alohali, Yousef A

    2015-06-01

    Naturally inspired evolutionary algorithms prove effectiveness when used for solving feature selection and classification problems. Artificial Bee Colony (ABC) is a relatively new swarm intelligence method. In this paper, we propose a new hybrid gene selection method, namely Genetic Bee Colony (GBC) algorithm. The proposed algorithm combines the used of a Genetic Algorithm (GA) along with Artificial Bee Colony (ABC) algorithm. The goal is to integrate the advantages of both algorithms. The proposed algorithm is applied to a microarray gene expression profile in order to select the most predictive and informative genes for cancer classification. In order to test the accuracy performance of the proposed algorithm, extensive experiments were conducted. Three binary microarray datasets are use, which include: colon, leukemia, and lung. In addition, another three multi-class microarray datasets are used, which are: SRBCT, lymphoma, and leukemia. Results of the GBC algorithm are compared with our recently proposed technique: mRMR when combined with the Artificial Bee Colony algorithm (mRMR-ABC). We also compared the combination of mRMR with GA (mRMR-GA) and Particle Swarm Optimization (mRMR-PSO) algorithms. In addition, we compared the GBC algorithm with other related algorithms that have been recently published in the literature, using all benchmark datasets. The GBC algorithm shows superior performance as it achieved the highest classification accuracy along with the lowest average number of selected genes. This proves that the GBC algorithm is a promising approach for solving the gene selection problem in both binary and multi-class cancer classification. PMID:25880524

  1. Improved interpretation of satellite altimeter data using genetic algorithms

    NASA Technical Reports Server (NTRS)

    Messa, Kenneth; Lybanon, Matthew

    1992-01-01

    Genetic algorithms (GA) are optimization techniques that are based on the mechanics of evolution and natural selection. They take advantage of the power of cumulative selection, in which successive incremental improvements in a solution structure become the basis for continued development. A GA is an iterative procedure that maintains a 'population' of 'organisms' (candidate solutions). Through successive 'generations' (iterations) the population as a whole improves in simulation of Darwin's 'survival of the fittest'. GA's have been shown to be successful where noise significantly reduces the ability of other search techniques to work effectively. Satellite altimetry provides useful information about oceanographic phenomena. It provides rapid global coverage of the oceans and is not as severely hampered by cloud cover as infrared imagery. Despite these and other benefits, several factors lead to significant difficulty in interpretation. The GA approach to the improved interpretation of satellite data involves the representation of the ocean surface model as a string of parameters or coefficients from the model. The GA searches in parallel, a population of such representations (organisms) to obtain the individual that is best suited to 'survive', that is, the fittest as measured with respect to some 'fitness' function. The fittest organism is the one that best represents the ocean surface model with respect to the altimeter data.

  2. Toward Developing Genetic Algorithms to Aid in Critical Infrastructure Modeling

    SciTech Connect

    Not Available

    2007-05-01

    Today抯 society relies upon an array of complex national and international infrastructure networks such as transportation, telecommunication, financial and energy. Understanding these interdependencies is necessary in order to protect our critical infrastructure. The Critical Infrastructure Modeling System, CIMS, examines the interrelationships between infrastructure networks. CIMS development is sponsored by the National Security Division at the Idaho National Laboratory (INL) in its ongoing mission for providing critical infrastructure protection and preparedness. A genetic algorithm (GA) is an optimization technique based on Darwin抯 theory of evolution. A GA can be coupled with CIMS to search for optimum ways to protect infrastructure assets. This includes identifying optimum assets to enforce or protect, testing the addition of or change to infrastructure before implementation, or finding the optimum response to an emergency for response planning. This paper describes the addition of a GA to infrastructure modeling for infrastructure planning. It first introduces the CIMS infrastructure modeling software used as the modeling engine to support the GA. Next, the GA techniques and parameters are defined. Then a test scenario illustrates the integration with CIMS and the preliminary results.

  3. A new perspective on Dark Energy modeling via Genetic Algorithms

    E-print Network

    Nesseris, Savvas

    2012-01-01

    We use Genetic Algorithms to extract information from several cosmological probes, such as the type Ia supernovae (SnIa), the Baryon Acoustic Oscillations (BAO) and the growth rate of matter perturbations. This information consists of a model independent and bias-free reconstruction of the various scales and distances that characterize the data, like the luminosity $d_L(z)$ and the angular diameter distance $d_A(z)$ in the SnIa and BAO data, respectively, or the dependence with redshift of the matter density $\\om_m(a)$ in the growth rate data, $f\\sigma_8(z)$. This information can then be used to reconstruct the expansion history of the Universe, and the resulting Dark Energy (DE) equation of state $w(z)$ in the context of FRW models, or the mass radial function $\\om_M(r)$ in LTB models. In this way, the reconstruction is completely independent of our prior bias. Furthermore, we use this method to test the Etherington relation, ie the well-known relation between the luminosity and the angular diameter distance...

  4. Optimizing SRF Gun Cavity Profiles in a Genetic Algorithm Framework

    SciTech Connect

    Alicia Hofler, Pavel Evtushenko, Frank Marhauser

    2009-09-01

    Automation of DC photoinjector designs using a genetic algorithm (GA) based optimization is an accepted practice in accelerator physics. Allowing the gun cavity field profile shape to be varied can extend the utility of this optimization methodology to superconducting and normal conducting radio frequency (SRF/RF) gun based injectors. Finding optimal field and cavity geometry configurations can provide guidance for cavity design choices and verify existing designs. We have considered two approaches for varying the electric field profile. The first is to determine the optimal field profile shape that should be used independent of the cavity geometry, and the other is to vary the geometry of the gun cavity structure to produce an optimal field profile. The first method can provide a theoretical optimal and can illuminate where possible gains can be made in field shaping. The second method can produce more realistically achievable designs that can be compared to existing designs. In this paper, we discuss the design and implementation for these two methods for generating field profiles for SRF/RF guns in a GA based injector optimization scheme and provide preliminary results.

  5. Genetic Algorithm (GA)-Based Inclinometer Layout Optimization

    PubMed Central

    Liang, Weijie; Zhang, Ping; Chen, Xianping; Cai, Miao; Yang, Daoguo

    2015-01-01

    This paper presents numerical simulation results of an airflow inclinometer with sensitivity studies and thermal optimization of the printed circuit board (PCB) layout for an airflow inclinometer based on a genetic algorithm (GA). Due to the working principle of the gas sensor, the changes of the ambient temperature may cause dramatic voltage drifts of sensors. Therefore, eliminating the influence of the external environment for the airflow is essential for the performance and reliability of an airflow inclinometer. In this paper, the mechanism of an airflow inclinometer and the influence of different ambient temperatures on the sensitivity of the inclinometer will be examined by the ANSYS-FLOTRAN CFD program. The results show that with changes of the ambient temperature on the sensing element, the sensitivity of the airflow inclinometer is inversely proportional to the ambient temperature and decreases when the ambient temperature increases. GA is used to optimize the PCB thermal layout of the inclinometer. The finite-element simulation method (ANSYS) is introduced to simulate and verify the results of our optimal thermal layout, and the results indicate that the optimal PCB layout greatly improves (by more than 50%) the sensitivity of the inclinometer. The study may be useful in the design of PCB layouts that are related to sensitivity improvement of gas sensors. PMID:25897500

  6. Programmable genetic algorithm IP core for sensing and surveillance applications

    NASA Astrophysics Data System (ADS)

    Katkoori, Srinivas; Fernando, Pradeep; Sankaran, Hariharan; Stoica, Adrian; Keymeulen, Didier; Zebulum, Ricardo

    2009-05-01

    Real-time evolvable systems are possible with a hardware implementation of Genetic Algorithms (GA). We report the design of an IP core that implements a general purpose GA engine which has been successfully synthesized and verified on a Xilinx Virtex II Pro FPGA Device (XC2VP30). The placed and routed IP core has an area utilization of only 13% and clock speed of 50MHz. The GA core can be customized in terms of the population size, number of generations, cross-over and mutation rates, and the random number generator seed. The GA engine can be tailored to a given application by interfacing with the application specific fitness evaluation module as well as the required storage memory (to store the current and new populations). The core is soft in nature i.e., a gate-level netlist is provided which can be readily integrated with the user's system. The GA IP core can be readily used in FPGA based platforms for space and military applications (for e.g., surveillance, target tracking). The main advantages of the IP core are its programmability, small footprint, and low power consumption. Examples of concept systems in sensing and surveillance domains will be presented.

  7. Genetic algorithm optimized triply compensated pulses in NMR spectroscopy

    NASA Astrophysics Data System (ADS)

    Manu, V. S.; Veglia, Gianluigi

    2015-11-01

    Sensitivity and resolution in NMR experiments are affected by magnetic field inhomogeneities (of both external and RF), errors in pulse calibration, and offset effects due to finite length of RF pulses. To remedy these problems, built-in compensation mechanisms for these experimental imperfections are often necessary. Here, we propose a new family of phase-modulated constant-amplitude broadband pulses with high compensation for RF inhomogeneity and heteronuclear coupling evolution. These pulses were optimized using a genetic algorithm (GA), which consists in a global optimization method inspired by Nature's evolutionary processes. The newly designed ? and ? / 2 pulses belong to the 'type A' (or general rotors) symmetric composite pulses. These GA-optimized pulses are relatively short compared to other general rotors and can be used for excitation and inversion, as well as refocusing pulses in spin-echo experiments. The performance of the GA-optimized pulses was assessed in Magic Angle Spinning (MAS) solid-state NMR experiments using a crystalline U-13C, 15N NAVL peptide as well as U-13C, 15N microcrystalline ubiquitin. GA optimization of NMR pulse sequences opens a window for improving current experiments and designing new robust pulse sequences.

  8. Innovative Applications of Genetic Algorithms to Problems in Accelerator Physics

    SciTech Connect

    Hofler, Alicia; Terzic, Balsa; Kramer, Matthew; Zvezdin, Anton; Morozov, Vasiliy; Roblin, Yves; Lin, Fanglei; Jarvis, Colin

    2013-01-01

    The genetic algorithm (GA) is a relatively new technique that implements the principles nature uses in biological evolution in order to optimize a multidimensional nonlinear problem. The GA works especially well for problems with a large number of local extrema, where traditional methods (such as conjugate gradient, steepest descent, and others) fail or, at best, underperform. The field of accelerator physics, among others, abounds with problems which lend themselves to optimization via GAs. In this paper, we report on the successful application of GAs in several problems related to the existing CEBAF facility, the proposed MEIC at Jefferson Lab, and a radio frequency (RF) gun based injector. These encouraging results are a step forward in optimizing accelerator design and provide an impetus for application of GAs to other problems in the field. To that end, we discuss the details of the GAs used, including a newly devised enhancement, which leads to improved convergence to the optimum and make recommendations for future GA developments and accelerator applications.

  9. A Moving Target Environment for Computer Configurations Using Genetic Algorithms

    SciTech Connect

    Crouse, Michael; Fulp, Errin W.

    2011-10-31

    Moving Target (MT) environments for computer systems provide security through diversity by changing various system properties that are explicitly defined in the computer configuration. Temporal diversity can be achieved by making periodic configuration changes; however in an infrastructure of multiple similarly purposed computers diversity must also be spatial, ensuring multiple computers do not simultaneously share the same configuration and potential vulnerabilities. Given the number of possible changes and their potential interdependencies discovering computer configurations that are secure, functional, and diverse is challenging. This paper describes how a Genetic Algorithm (GA) can be employed to find temporally and spatially diverse secure computer configurations. In the proposed approach a computer configuration is modeled as a chromosome, where an individual configuration setting is a trait or allele. The GA operates by combining multiple chromosomes (configurations) which are tested for feasibility and ranked based on performance which will be measured as resistance to attack. The result of successive iterations of the GA are secure configurations that are diverse due to the crossover and mutation processes. Simulations results will demonstrate this approach can provide at MT environment for a large infrastructure of similarly purposed computers by discovering temporally and spatially diverse secure configurations.

  10. Application of genetic algorithm on optimization of laser beam shaping.

    PubMed

    Tsai, Cheng-Mu; Fang, Yi-Chin; Lin, Chia-Te

    2015-06-15

    This study proposes a newly developed optimization method for an aspherical lens system employed in a refractive laser beam shaping system, which performs transformations on laser spots such that they are transformed into flat-tops of any size. In this paper, a genetic algorithm (GA) with multipoint search is proposed as the optimization method, together with macro language in optical simulation software, in order to search for ideal and optimized parameters. In comparison to a traditional two-dimensional (2D) computational method, using the one-dimensional (1D) computation for laser beam shaping can search for the optimal solution approximately twice as fast (after experiments). The optimal results show that when the laser spot shrinks from 3 mm to 1.07 mm, 88% uniformity is achieved, and when the laser spot increases from 3 mm to 5.273 mm, 90% uniformity is achieved. The distances between the lenses for both systems described above are even smaller than the thickness for the first lens, enabling us to conclude that our design objectives of extra light and slimness in the system are achieved. PMID:26193566

  11. Innovative applications of genetic algorithms to problems in accelerator physics

    NASA Astrophysics Data System (ADS)

    Hofler, Alicia; Terzi?, Bal歛; Kramer, Matthew; Zvezdin, Anton; Morozov, Vasiliy; Roblin, Yves; Lin, Fanglei; Jarvis, Colin

    2013-01-01

    The genetic algorithm (GA) is a powerful technique that implements the principles nature uses in biological evolution to optimize a multidimensional nonlinear problem. The GA works especially well for problems with a large number of local extrema, where traditional methods (such as conjugate gradient, steepest descent, and others) fail or, at best, underperform. The field of accelerator physics, among others, abounds with problems which lend themselves to optimization via GAs. In this paper, we report on the successful application of GAs in several problems related to the existing Continuous Electron Beam Accelerator Facility nuclear physics machine, the proposed Medium-energy Electron-Ion Collider at Jefferson Lab, and a radio frequency gun-based injector. These encouraging results are a step forward in optimizing accelerator design and provide an impetus for application of GAs to other problems in the field. To that end, we discuss the details of the GAs used, include a newly devised enhancement which leads to improved convergence to the optimum, and make recommendations for future GA developments and accelerator applications.

  12. Robust Sparse Matching and Motion Estimation Using Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Shahbazi, M.; Sohn, G.; Th閍u, J.; M閚ard, P.

    2015-03-01

    In this paper, we propose a robust technique using genetic algorithm for detecting inliers and estimating accurate motion parameters from putative correspondences containing any percentage of outliers. The proposed technique aims to increase computational efficiency and modelling accuracy in comparison with the state-of-the-art via the following contributions: i) guided generation of initial populations for both avoiding degenerate solutions and increasing the rate of useful hypotheses, ii) replacing random search with evolutionary search, iii) possibility of evaluating the individuals of every population by parallel computation, iv) being performable on images with unknown internal orientation parameters, iv) estimating the motion model via detecting a minimum, however more than enough, set of inliers, v) ensuring the robustness of the motion model against outliers, degeneracy and poorperspective camera models, vi) making no assumptions about the probability distribution of inliers and/or outliers residuals from the estimated motion model, vii) detecting all the inliers by setting the threshold on their residuals adaptively with regard to the uncertainty of the estimated motion model and the position of the matches. The proposed method was evaluated both on synthetic data and real images. The results were compared with the most popular techniques from the state-of-the-art, including RANSAC, MSAC, MLESAC, Least Trimmed Squares and Least Median of Squares. Experimental results proved that the proposed approach perform better than others in terms of accuracy of motion estimation, accuracy of inlier detection and the computational efficiency.

  13. [A genetic optimization designing method for microorganism detection genechip probe based on genetic algorithm].

    PubMed

    Liu, Guo-Chuan; Bai, Zhi-Jun; Shu, Wen-Jie; Bo, Xiao-Chen; Wang, Sheng-Qi; Lu, Lin; Wang, Jia-Yong

    2008-03-01

    A new automatic selection approach of microorganism specific fragment combination is presented in this paper. Genetic algorithm is used to search optimal solution on the basis of classification ability of SNP combination, which is evaluated by the rough set theory. Other related experimental parameters are also been incorporated. Experimental results show that the method can find the best SNP combination pattern efficiently and accurately, which implies that it is a reliable approach to the genechip probe design. PMID:18581869

  14. The potential of genetic algorithms for conceptual design of rotor systems

    NASA Technical Reports Server (NTRS)

    Crossley, William A.; Wells, Valana L.; Laananen, David H.

    1993-01-01

    The capabilities of genetic algorithms as a non-calculus based, global search method make them potentially useful in the conceptual design of rotor systems. Coupling reasonably simple analysis tools to the genetic algorithm was accomplished, and the resulting program was used to generate designs for rotor systems to match requirements similar to those of both an existing helicopter and a proposed helicopter design. This provides a comparison with the existing design and also provides insight into the potential of genetic algorithms in design of new rotors.

  15. Synthesis of optimal digital shapers with arbitrary noise using a genetic algorithm

    NASA Astrophysics Data System (ADS)

    Regad韔, Alberto; S醤chez-Prieto, Sebasti醤; Tabero, Jes鷖; Gonz醠ez-Casta駉, Diego M.

    2015-09-01

    This paper presents structure, design and implementation of a novel technique for determining the optimal shaping, in time-domain, for spectrometers by means of a Genetic Algorithm (GA) specifically designed for this purpose. The proposed algorithm is able to adjust automatically the coefficients for shaping an input signal. Results of this experiment have been compared to a previous simulated annealing algorithm. Finally, its performance and capabilities were tested using simulation data and a real particle detector, as a scintillator.

  16. In-Space Radiator Shape Optimization using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Hull, Patrick V.; Kittredge, Ken; Tinker, Michael; SanSoucie, Michael

    2006-01-01

    Future space exploration missions will require the development of more advanced in-space radiators. These radiators should be highly efficient and lightweight, deployable heat rejection systems. Typical radiators for in-space heat mitigation commonly comprise a substantial portion of the total vehicle mass. A small mass savings of even 5-10% can greatly improve vehicle performance. The objective of this paper is to present the development of detailed tools for the analysis and design of in-space radiators using evolutionary computation techniques. The optimality criterion is defined as a two-dimensional radiator with a shape demonstrating the smallest mass for the greatest overall heat transfer, thus the end result is a set of highly functional radiator designs. This cross-disciplinary work combines topology optimization and thermal analysis design by means of a genetic algorithm The proposed design tool consists of the following steps; design parameterization based on the exterior boundary of the radiator, objective function definition (mass minimization and heat loss maximization), objective function evaluation via finite element analysis (thermal radiation analysis) and optimization based on evolutionary algorithms. The radiator design problem is defined as follows: the input force is a driving temperature and the output reaction is heat loss. Appropriate modeling of the space environment is added to capture its effect on the radiator. The design parameters chosen for this radiator shape optimization problem fall into two classes, variable height along the width of the radiator and a spline curve defining the -material boundary of the radiator. The implementation of multiple design parameter schemes allows the user to have more confidence in the radiator optimization tool upon demonstration of convergence between the two design parameter schemes. This tool easily allows the user to manipulate the driving temperature regions thus permitting detailed design of in-space radiators for unique situations. Preliminary results indicate an optimized shape following that of the temperature distribution regions in the "cooler" portions of the radiator. The results closely follow the expected radiator shape.

  17. Automated Test Assembly for Cognitive Diagnosis Models Using a Genetic Algorithm

    ERIC Educational Resources Information Center

    Finkelman, Matthew; Kim, Wonsuk; Roussos, Louis A.

    2009-01-01

    Much recent psychometric literature has focused on cognitive diagnosis models (CDMs), a promising class of instruments used to measure the strengths and weaknesses of examinees. This article introduces a genetic algorithm to perform automated test assembly alongside CDMs. The algorithm is flexible in that it can be applied whether the goal is to

  18. Machine Learning for Information Retrieval: Neural Networks, Symbolic Learning, and Genetic Algorithms.

    ERIC Educational Resources Information Center

    Chen, Hsinchun

    1995-01-01

    Presents an overview of artificial-intelligence-based inductive learning techniques and their use in information science research. Three methods are discussed: the connectionist Hopfield network; the symbolic ID3/ID5R; evolution-based genetic algorithms. The knowledge representations and algorithms of these methods are examined in the context of

  19. Semi-deterministic and genetic algorithms for global optimization of microfluidic protein folding

    E-print Network

    Santiago, Juan G.

    Semi-deterministic and genetic algorithms for global optimization of microfluidic protein folding - In this paper we reformulate global optimization problems in terms of boundary value problems (BVP). This allows algorithm. Keywords: Shape optimization, Global optimization, Dynamical systems, Boundary value problem

  20. Comparison between interactive (subjective) and traditional (numerical) inversion by Genetic Algorithms

    E-print Network

    Boschetti, Fabio

    Comparison between interactive (subjective) and traditional (numerical) inversion by Genetic Algorithms F. Boschetti L. Moresi CSIRO, Exploration and Mining, CSIRO, Exploration and Mining, 39 Fairway@ned.dem.csiro.au Abstract- Inversion algorithms employ numerical evaluation of the mismatch between model and data to guide

  1. Combining Genetic Algorithms & Simulation to Search for Failure Scenarios in System Models

    E-print Network

    Combining Genetic Algorithms & Simulation to Search for Failure Scenarios in System Models The 5th International Conference on Advances in System Simulation Oct. 27-Nov. 1, 2013 Project Team: Kevin Mills Algorithm (GA) steers a population of simulators to search for parameter combinations that lead to system

  2. A Sequential Similarity Metric for Case Injected Genetic Algorithms applied to TSPs

    E-print Network

    Louis, Sushil J.

    A Sequential Similarity Metric for Case Injected Genetic Algorithms applied to TSPs Sushil J. Louis Genetic Adaptive Systems LAB Dept. of Computer Science University of Nevada Reno, NV 89557 sushil@cs.unr.edu Yongmian Zhang Genetic Adaptive Systems LAB Dept. of Computer Science University of Nevada Reno, NV 89557

  3. A weight based genetic algorithm for selecting views

    NASA Astrophysics Data System (ADS)

    Talebian, Seyed H.; Kareem, Sameem A.

    2013-03-01

    Data warehouse is a technology designed for supporting decision making. Data warehouse is made by extracting large amount of data from different operational systems; transforming it to a consistent form and loading it to the central repository. The type of queries in data warehouse environment differs from those in operational systems. In contrast to operational systems, the analytical queries that are issued in data warehouses involve summarization of large volume of data and therefore in normal circumstance take a long time to be answered. On the other hand, the result of these queries must be answered in a short time to enable managers to make decisions as short time as possible. As a result, an essential need in this environment is in improving the performances of queries. One of the most popular methods to do this task is utilizing pre-computed result of queries. In this method, whenever a new query is submitted by the user instead of calculating the query on the fly through a large underlying database, the pre-computed result or views are used to answer the queries. Although, the ideal option would be pre-computing and saving all possible views, but, in practice due to disk space constraint and overhead due to view updates it is not considered as a feasible choice. Therefore, we need to select a subset of possible views to save on disk. The problem of selecting the right subset of views is considered as an important challenge in data warehousing. In this paper we suggest a Weighted Based Genetic Algorithm (WBGA) for solving the view selection problem with two objectives.

  4. The use of genetic algorithms to model protoplanetary discs

    NASA Astrophysics Data System (ADS)

    Hetem, Annibal; Gregorio-Hetem, Jane

    2007-12-01

    The protoplanetary discs of T Tauri and Herbig Ae/Be stars have previously been studied using geometric disc models to fit their spectral energy distribution (SED). The simulations provide a means to reproduce the signatures of various circumstellar structures, which are related to different levels of infrared excess. With the aim of improving our previous model, which assumed a simple flat-disc configuration, we adopt here a reprocessing flared-disc model that assumes hydrostatic, radiative equilibrium. We have developed a method to optimize the parameter estimation based on genetic algorithms (GAs). This paper describes the implementation of the new code, which has been applied to Herbig stars from the Pico dos Dias Survey catalogue, in order to illustrate the quality of the fitting for a variety of SED shapes. The star AB Aur was used as a test of the GA parameter estimation, and demonstrates that the new code reproduces successfully a canonical example of the flared-disc model. The GA method gives a good quality of fit, but the range of input parameters must be chosen with caution, as unrealistic disc parameters can be derived. It is confirmed that the flared-disc model fits the flattened SEDs typical of Herbig stars; however, embedded objects (increasing SED slope) and debris discs (steeply decreasing SED slope) are not well fitted with this configuration. Even considering the limitation of the derived parameters, the automatic process of SED fitting provides an interesting tool for the statistical analysis of the circumstellar luminosity of large samples of young stars.

  5. GRAVITATIONAL LENS MODELING WITH GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZERS

    SciTech Connect

    Rogers, Adam; Fiege, Jason D.

    2011-02-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point-spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least-squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automatically, which represents the trade-off between the image {chi}{sup 2} and regularization effects, and allows an estimate of the optimally regularized solution for each lens parameter set. In the final step of the optimization procedure, the lens model with the lowest {chi}{sup 2} is used while the global optimizer solves for the source intensity distribution directly. This allows us to accurately determine the number of degrees of freedom in the problem to facilitate comparison between lens models and enforce positivity on the source profile. In practice, we find that the GA conducts a more thorough search of the parameter space than the PSO.

  6. The use of genetic algorithm to model protoplanetary discs

    E-print Network

    A. Hetem Jr.; J. Gregorio-Hetem

    2007-09-12

    The protoplanetary discs of T Tauri and Herbig Ae/Be stars have been studied by using geometric disc models to fit their spectral energy distribution (SED). The simulations provide means to reproduce the signatures of different circumstellar structures, which are related to different levels of infrared excess. Aiming to improve our previous model that assumed a simple flat disc configuration, in the present work we adopt a reprocessing flared disc model that considers hydrostatic, radiative equilibrium (Dullemond et al. 2001). We developed a method to optimise the parameters estimation based on genetic algorithms (GA). This paper is dedicated to describe the implementation of the new code, which has been applied for Herbig stars from the Pico dos Dias Survey catalogue, in order to illustrate the quality of the fitting for a variety of SED shapes. The star AB Aur was used as a test of the GA parameters estimation, demonstrating that the new code reproduces successfully a canonical example of the flared disc model. The GA method gives good quality of fittings, but the range of input parameters must be chosen with caution, since unrealistic disc parameters can be derived. The flared disc model is confirmed to fit the flattened SEDs typical from Herbig stars, however the embedded objects (increasing SED slope) and debris discs (steeper SED) are not well fitted with this configuration. Even considering the limitation of the derived parameters, the automatic process of SED fitting provides an interesting tool for the statistical analysis of the circumstellar luminosity of large samples of young stars.

  7. The Frontiers of Real-coded Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Kobayashi, Shigenobu

    Real-coded genetic algorithms (RCGA) are expected to solve efficiently real parameter optimization problems of multimodality, parameter dependency, and ill-scale. Multi-parental crossovers such as the simplex crossover (SPX) and the UNDX-m as extensions of the unimodal normal distribution crossove (UNDX) show relatively good performance for RCGA. The minimal generation gap (MGG) is used widely as a generation alternation model for RCGA. However, the MGG is not suited for multi-parental crossovers. Both the SPX and the UNDX-m have their own drawbacks respectively. Therefore, RCGA composed of them cannot be applied to highly dimensional problems, because their hidden faults appear. This paper presents a new and robust faramework for RCGA. First, we propose a generation alternation model called JGG (just generation gap) suited for multi-parental crossovers. The JGG replaces parents with children completely every generation. To solve the asymmetry and bias of children distribution generated by the SPX and the UNDX-m, an enhanced SPX (e-SPX) and an enhanced UNDX (e-UNDX) are proposed. Moreover, we propose a crossover called REX(?,n+k) as a generlization of the e-UNDX, where ? and n+k denote some probability distribution and the number of parents respectively. A concept of the globally descent direction (GDD) is introduced to handle the situations where the population does not cover any optimum. The GDD can be used under the big valley structure. Then, we propose REXstar as an extention of the REX(?,n+k) that can generate children to the GDD efficiently. Several experiments show excellent performance and robustness of the REXstar. Finally, the future work is discussed.

  8. Gravitational Lens Modeling with Genetic Algorithms and Particle Swarm Optimizers

    NASA Astrophysics Data System (ADS)

    Rogers, Adam; Fiege, Jason D.

    2011-02-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point-spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our "matrix-free" approach avoids construction of the lens and blurring operators while retaining the least-squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automatically, which represents the trade-off between the image ?2 and regularization effects, and allows an estimate of the optimally regularized solution for each lens parameter set. In the final step of the optimization procedure, the lens model with the lowest ?2 is used while the global optimizer solves for the source intensity distribution directly. This allows us to accurately determine the number of degrees of freedom in the problem to facilitate comparison between lens models and enforce positivity on the source profile. In practice, we find that the GA conducts a more thorough search of the parameter space than the PSO.

  9. An analysis of posynomial MOSFET models using genetic algorithms and visualization

    E-print Network

    Salameh, Lynne Rafik

    2007-01-01

    Analog designers are interested in optimization tools which automate the process of circuit sizing. Geometric programming, which uses posynomial models of MOSFET parameters, represents one such tool. Genetic algorithms ...

  10. An Analysis of Posynomial MOSFET Models Using Genetic Algorithms and Visualization

    E-print Network

    Salameh, Lynne Rafik

    2007-06-05

    Analog designers are interested in optimization tools which automate the process of circuit sizing. Geometric programming, which uses posynomial models of MOSFET parameters, represents one such tool. Genetic algorithms ...

  11. Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity

    USGS Publications Warehouse

    Louis, S.J.; Raines, G.L.

    2003-01-01

    We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic algorithm searches through a space of transition rule parameters of a two dimensional cellular automata model to find rule parameters that fit observed mining activity data. Previous work by one of the authors in calibrating the cellular automaton took weeks - the genetic algorithm takes a day and produces rules leading to about the same (or better) fit to observed data. These preliminary results indicate that genetic algorithms are a viable tool in calibrating cellular automata for this application. Experience gained during the calibration of this cellular automata suggests that mineral resource information is a critical factor in the quality of the results. With automated calibration, further refinements of how the mineral-resource information is provided to the cellular automaton will probably improve our model.

  12. Genetic algorithm based optimization in engineering design using fuzzy constraints and fitness functions

    E-print Network

    Vijayakumar, Bhuvaneshwaran

    2001-01-01

    The motivation for this work has been the use of tools, such as genetic algorithms and fuzzy sets, to address the various issues that are involved in an engineering design optimization problem. In order to address the variety, generality...

  13. Design Synthesis of Microelectromechanical Systems Using Genetic Algorithms with Component-Based

    E-print Network

    Agogino, Alice M.

    Design Synthesis of Microelectromechanical Systems Using Genetic Algorithms with Component-Based Genotype Representation Ying Zhang Systems Engineering Program University of California Berkeley, CA 94720, USA yzh@berkeley.edu Alice M. Agogino Department of Mechanical Engineering University of California

  14. Genetic Algorithms with Memory-and Elitism-Based Immigrants in Dynamic Environments

    E-print Network

    Yang, Shengxiang

    Genetic Algorithms with Memory- and Elitism- Based Immigrants in Dynamic Environments Shengxiang in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme addresses dynamic environments

  15. Identification of Convection Constants for Electronic Packages Using Modified Genetic Algorithm and Reduced-Basis Method

    E-print Network

    Yang, Zhenglin

    A new inverse analysis method is presented to identify parameters of heat convection in microelectronic packages. This approach adopts a modified Micro Genetic Algorithm (礕A) in finding the global optimum of parameters. ...

  16. A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Valenzuela-Rendon, Manuel

    1993-01-01

    The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms.

  17. A Genetic Algorithm for Generating Radar Transmit Codes to Minimize the Target Profile Estimation Error

    E-print Network

    Smith-Matrinez, Brien; Agah, Arvin; Stiles, James M.

    2013-01-01

    This article presents the design and development of a genetic algorithm (GA) to generate long-range transmit codes with low autocorrelation side lobes for radar to minimize target profile estimation error. The GA described in this work has a...

  18. Application of Genetic Algorithms and Thermogravimetry to Determine the Kinetics of Polyurethane Foam in Smoldering Combustion

    E-print Network

    Rein, Guillermo; Lautenberger, Chris; Fernandez-Pello, Carlos; Torero, Jose L; Urban, David

    In this work, the kinetic parameters governing the thermal and oxidative degradation of flexible polyurethane foam are determined using thermogravimetric data and a genetic algorithm. These kinetic parameters are needed ...

  19. A Genetic Algorithm Approach to Nonlinear Least Squares Estimation

    ERIC Educational Resources Information Center

    Olinsky, Alan D.; Quinn, John T.; Mangiameli, Paul M.; Chen, Shaw K.

    2004-01-01

    A common type of problem encountered in mathematics is optimizing nonlinear functions. Many popular algorithms that are currently available for finding nonlinear least squares estimators, a special class of nonlinear problems, are sometimes inadequate. They might not converge to an optimal value, or if they do, it could be to a local rather than

  20. Hybrid Model Based on Genetic Algorithms and SVM Applied to Variable Selection within Fruit Juice Classification

    PubMed Central

    Fernandez-Lozano, C.; Canto, C.; Gestal, M.; Andrade-Garda, J. M.; Rabu馻l, J. R.; Dorado, J.; Pazos, A.

    2013-01-01

    Given the background of the use of Neural Networks in problems of apple juice classification, this paper aim at implementing a newly developed method in the field of machine learning: the Support Vector Machines (SVM). Therefore, a hybrid model that combines genetic algorithms and support vector machines is suggested in such a way that, when using SVM as a fitness function of the Genetic Algorithm (GA), the most representative variables for a specific classification problem can be selected. PMID:24453933

  1. Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Benford, Andrew; Tinker, Michael L.

    2004-01-01

    The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

  2. Investigation of genetic algorithm design representation for multi-objective truss optimization

    E-print Network

    Pathi, Soumya Sundar

    2006-10-30

    -1 INVESTIGATION OF GENETIC ALGORITHM DESIGN REPRESENTATION FOR MULTI-OBJECTIVE TRUSS OPTIMIZATION A Thesis by SOUMYA SUNDAR PATHI Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements... for the degree of MASTER OF SCIENCE August 2006 Major Subject: Civil Engineering INVESTIGATION OF GENETIC ALGORITHM DESIGN REPRESENTATION FOR MULTI-OBJECTIVE TRUSS OPTIMIZATION A Thesis by SOUMYA SUNDAR PATHI Submitted...

  3. Genetic Algorithm Based Approach For The Optimal Allocation of Facts Devices

    NASA Astrophysics Data System (ADS)

    Bhattacharyya, B.; Goswami, S. K.

    2010-06-01

    This paper presents Genetic Algorithm (GA) based approach for the allocation of FACTS devices for the improvement of Power transfer capacity in an interconnected Power System. Simulations are done on IEEE 30 BUS System. The result obtained by the GA (Genetic Algorithm) approach is compared with that of obtained by PSO (Particle Swarm Optimization) method. The comparison shows how the system performance can be greatly improved with the GA based proposed approach.

  4. Modified Niched Pareto Multi-objective Genetic Algorithm for Construction Scheduling Optimization

    E-print Network

    Kim, Kyungki

    2012-10-19

    -objective Genetic Algorithm for Construction Scheduling Optimization. (August 2011) Kyungki Kim, B.S., Dongguk University Chair of Advisory Committee: Dr. John Walewski This research proposes a Genetic Algorithm based decision support model that provides... when there are many objectives to achieve. The Critical Path Method (CPM) is one of the most well-known scheduling methods that were invented to achieve greater activity coordination. CPM?s invention was prompted by prevailing deficiencies...

  5. A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

    PubMed Central

    Tsai, Chun-Wei; Tseng, Shih-Pang; Yang, Chu-Sing

    2014-01-01

    This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up being part of the final solution; as such, they can be saved away to eliminate the redundant computations at the later generations of a GA. To evaluate the performance of the proposed algorithm, we use it not only to solve the traveling salesman problem but also to provide an extensive analysis on the impact it may have on the quality of the end result. Our experimental results indicate that the proposed algorithm can significantly reduce the computation time of GA and GA-based algorithms while limiting the degradation of the quality of the end result to a very small percentage compared to traditional GA. PMID:24892038

  6. KES' 01 N. Baba et al. (Eds.) IOS Press, 2001 112 Probabilistic Model-building Genetic Algorithms Using

    E-print Network

    Tsutsui, Shigeyoshi

    KES' 01 N. Baba et al. (Eds.) IOS Press, 2001 112 Probabilistic Model-building Genetic Algorithms, Osaka 580-8502, Japan, tsutsui@hannan-u.ac.jp *2 Illinois Genetic Algorithms Laboratory, Department been a growing interest in developing evolutionary algorithms based on probabilistic modeling

  7. This is the documentation for the genetic algorithm program, as described in chapter Program MAP_GENETIC_ALGORITHM

    E-print Network

    Cambridge, University of

    -linear models can capture their interactions, but we may wish to use the neural network backwards and identify described these algorithms as "search procedures based on the mechanics of natural selection and natural) and heat treatment temperature (K) (MAP_NEURAL_AUSTENITIC_YIELD): iqbalcode.c - A C program used to run

  8. An Improved Hierarchical Genetic Algorithm for Sheet Cutting Scheduling with Process Constraints

    PubMed Central

    Rao, Yunqing; Qi, Dezhong; Li, Jinling

    2013-01-01

    For the first time, an improved hierarchical genetic algorithm for sheet cutting problem which involves n cutting patterns for m non-identical parallel machines with process constraints has been proposed in the integrated cutting stock model. The objective of the cutting scheduling problem is minimizing the weighted completed time. A mathematical model for this problem is presented, an improved hierarchical genetic algorithm (ant colony梙ierarchical genetic algorithm) is developed for better solution, and a hierarchical coding method is used based on the characteristics of the problem. Furthermore, to speed up convergence rates and resolve local convergence issues, a kind of adaptive crossover probability and mutation probability is used in this algorithm. The computational result and comparison prove that the presented approach is quite effective for the considered problem. PMID:24489491

  9. A Constrained Genetic Algorithm with Adaptively Defined Fitness Function in MRS Quantification

    NASA Astrophysics Data System (ADS)

    Papakostas, G. A.; Karras, D. A.; Mertzios, B. G.; Graveron-Demilly, D.; van Ormondt, D.

    MRS Signal quantification is a rather involved procedure and has attracted the interest of the medical engineering community, regarding the development of computationally efficient methodologies. Significant contributions based on Computational Intelligence tools, such as Neural Networks (NNs), demonstrated a good performance but not without drawbacks already discussed by the authors. On the other hand preliminary application of Genetic Algorithms (GA) has already been reported in the literature by the authors regarding the peak detection problem encountered in MRS quantification using the Voigt line shape model. This paper investigates a novel constrained genetic algorithm involving a generic and adaptively defined fitness function which extends the simple genetic algorithm methodology in case of noisy signals. The applicability of this new algorithm is scrutinized through experimentation in artificial MRS signals interleaved with noise, regarding its signal fitting capabilities. Although extensive experiments with real world MRS signals are necessary, the herein shown performance illustrates the method's potential to be established as a generic MRS metabolites quantification procedure.

  10. A New Model for Redundancy Allocation Problem in Series Systems with Repairable Components by Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Sharifi, Mani; Rezaei Moayed, Reza; Haratizadeh, Sara

    2011-09-01

    This paper presents two models for redundancy allocation problem (RAP) with cold standby redundancy policy subject to weight and cost constraints. Also, each element of the system can be damaged exponentially. And, damaged elements can be repaired exponentially by hiring some repairmen. The problem is to determine: (1) element type used in the system, (2) number of elements, and (3) number of repairmen. As the models are not solvable by exact solution methods in reasonable CPU time, an efficient genetic algorithm is developed for it. The genetic algorithm (GA) is hybridized with a local search procedure. Also, the algorithm accepts infeasible solutions after penalizing them based on their amounts of infeasibilities. Thereby, by using these two features, an efficient genetic algorithm is obtained.

  11. Phase Reconstruction from FROG Using Genetic Algorithms[Frequency-Resolved Optical Gating

    SciTech Connect

    Omenetto, F.G.; Nicholson, J.W.; Funk, D.J.; Taylor, A.J.

    1999-04-12

    The authors describe a new technique for obtaining the phase and electric field from FROG measurements using genetic algorithms. Frequency-Resolved Optical Gating (FROG) has gained prominence as a technique for characterizing ultrashort pulses. FROG consists of a spectrally resolved autocorrelation of the pulse to be measured. Typically a combination of iterative algorithms is used, applying constraints from experimental data, and alternating between the time and frequency domain, in order to retrieve an optical pulse. The authors have developed a new approach to retrieving the intensity and phase from FROG data using a genetic algorithm (GA). A GA is a general parallel search technique that operates on a population of potential solutions simultaneously. Operators in a genetic algorithm, such as crossover, selection, and mutation are based on ideas taken from evolution.

  12. I997 IEEE lntcrnationalConfcrcncc on Intclligent Processing Systcms Octobcr 28 -3 I, L3cijing. China Using Counter-Proposal to Optimize Genetic Algorithm Based

    E-print Network

    Yan, Yuhong

    . China Using Counter-Proposal to Optimize Genetic Algorithm Based Cooperative Negotiation Liu Ping, Hu. In the negotiation process, each 11. GENETIC ALGORITHM IN MULTIAGENT SYSTEM Genetic Algorithms have many important features that make them very suitable to work in niultiagent systems: Genetic algorithm is based upon

  13. MULTI-OBJECTIVE OPTIMAL DESIGN OF GROUNDWATER REMEDIATION SYSTEMS: APPLICATION OF THE NICHED PARETO GENETIC ALGORITHM (NPGA). (R826614)

    EPA Science Inventory

    A multiobjective optimization algorithm is applied to a groundwater quality management problem involving remediation by pump-and-treat (PAT). The multiobjective optimization framework uses the niched Pareto genetic algorithm (NPGA) and is applied to simultaneously minimize the...

  14. Nonlinear inversion of potential-field data using a hybrid-encoding genetic algorithm

    NASA Astrophysics Data System (ADS)

    Chen, Chao; Xia, Jianghai; Liu, Jiangping; Feng, Guangding

    2006-03-01

    Using a genetic algorithm to solve an inverse problem of complex nonlinear geophysical equations is advantageous because it does not require computer gradients of models or "good" initial models. The multi-point search of a genetic algorithm makes it easier to find the globally optimal solution while avoiding falling into a local extremum. As is the case in other optimization approaches, the search efficiency for a genetic algorithm is vital in finding desired solutions successfully in a multi-dimensional model space. A binary-encoding genetic algorithm is hardly ever used to resolve an optimization problem such as a simple geophysical inversion with only three unknowns. The encoding mechanism, genetic operators, and population size of the genetic algorithm greatly affect search processes in the evolution. It is clear that improved operators and proper population size promote the convergence. Nevertheless, not all genetic operations perform perfectly while searching under either a uniform binary or a decimal encoding system. With the binary encoding mechanism, the crossover scheme may produce more new individuals than with the decimal encoding. On the other hand, the mutation scheme in a decimal encoding system will create new genes larger in scope than those in the binary encoding. This paper discusses approaches of exploiting the search potential of genetic operations in the two encoding systems and presents an approach with a hybrid-encoding mechanism, multi-point crossover, and dynamic population size for geophysical inversion. We present a method that is based on the routine in which the mutation operation is conducted in the decimal code and multi-point crossover operation in the binary code. The mix-encoding algorithm is called the hybrid-encoding genetic algorithm (HEGA). HEGA provides better genes with a higher probability by a mutation operator and improves genetic algorithms in resolving complicated geophysical inverse problems. Another significant result is that final solution is determined by the average model derived from multiple trials instead of one computation due to the randomness in a genetic algorithm procedure. These advantages were demonstrated by synthetic and real-world examples of inversion of potential-field data.

  15. Nonlinear inversion of potential-field data using a hybrid-encoding genetic algorithm

    USGS Publications Warehouse

    Chen, C.; Xia, J.; Liu, J.; Feng, G.

    2006-01-01

    Using a genetic algorithm to solve an inverse problem of complex nonlinear geophysical equations is advantageous because it does not require computer gradients of models or "good" initial models. The multi-point search of a genetic algorithm makes it easier to find the globally optimal solution while avoiding falling into a local extremum. As is the case in other optimization approaches, the search efficiency for a genetic algorithm is vital in finding desired solutions successfully in a multi-dimensional model space. A binary-encoding genetic algorithm is hardly ever used to resolve an optimization problem such as a simple geophysical inversion with only three unknowns. The encoding mechanism, genetic operators, and population size of the genetic algorithm greatly affect search processes in the evolution. It is clear that improved operators and proper population size promote the convergence. Nevertheless, not all genetic operations perform perfectly while searching under either a uniform binary or a decimal encoding system. With the binary encoding mechanism, the crossover scheme may produce more new individuals than with the decimal encoding. On the other hand, the mutation scheme in a decimal encoding system will create new genes larger in scope than those in the binary encoding. This paper discusses approaches of exploiting the search potential of genetic operations in the two encoding systems and presents an approach with a hybrid-encoding mechanism, multi-point crossover, and dynamic population size for geophysical inversion. We present a method that is based on the routine in which the mutation operation is conducted in the decimal code and multi-point crossover operation in the binary code. The mix-encoding algorithm is called the hybrid-encoding genetic algorithm (HEGA). HEGA provides better genes with a higher probability by a mutation operator and improves genetic algorithms in resolving complicated geophysical inverse problems. Another significant result is that final solution is determined by the average model derived from multiple trials instead of one computation due to the randomness in a genetic algorithm procedure. These advantages were demonstrated by synthetic and real-world examples of inversion of potential-field data. ?? 2005 Elsevier Ltd. All rights reserved.

  16. Optimization of the genetic operators and algorithm parameters for the design of a multilayer anti-reflection coating using the genetic algorithm

    NASA Astrophysics Data System (ADS)

    Patel, Sanjaykumar J.; Kheraj, Vipul

    2015-07-01

    This paper describes a systematic investigation on the use of the genetic algorithm (GA) to accomplish ultra-low reflective multilayer coating designs for optoelectronic device applications. The algorithm is implemented using LabVIEW as a programming tool. The effects of the genetic operators, such as the type of crossover and mutation, as well as algorithm parameters, such as population size and range of search space, on the convergence of design-solution were studied. Finally, the optimal design is obtained in terms of the thickness of each layer for the multilayer AR coating using optimized genetic operators and algorithm parameters. The program is successfully tested to design AR coating in NIR wavelength range to achieve average reflectivity (R) below 10-3 over the spectral bandwidth of 200 nm with different combinations of coating materials in the stack. The random-point crossover operator is found to exhibit a better convergence rate of the solution than single-point and double-point crossover. Periodically re-initializing the thickness value of a randomly selected layer from the stack effectively prevents the solution from becoming trapped in local minima and improves the convergence probability.

  17. Experimental Performance of a Genetic Algorithm for Airborne Strategic Conflict Resolution

    NASA Technical Reports Server (NTRS)

    Karr, David A.; Vivona, Robert A.; Roscoe, David A.; DePascale, Stephen M.; Consiglio, Maria

    2009-01-01

    The Autonomous Operations Planner, a research prototype flight-deck decision support tool to enable airborne self-separation, uses a pattern-based genetic algorithm to resolve predicted conflicts between the ownship and traffic aircraft. Conflicts are resolved by modifying the active route within the ownship s flight management system according to a predefined set of maneuver pattern templates. The performance of this pattern-based genetic algorithm was evaluated in the context of batch-mode Monte Carlo simulations running over 3600 flight hours of autonomous aircraft in en-route airspace under conditions ranging from typical current traffic densities to several times that level. Encountering over 8900 conflicts during two simulation experiments, the genetic algorithm was able to resolve all but three conflicts, while maintaining a required time of arrival constraint for most aircraft. Actual elapsed running time for the algorithm was consistent with conflict resolution in real time. The paper presents details of the genetic algorithm s design, along with mathematical models of the algorithm s performance and observations regarding the effectiveness of using complimentary maneuver patterns when multiple resolutions by the same aircraft were required.

  18. Experimental Performance of a Genetic Algorithm for Airborne Strategic Conflict Resolution

    NASA Technical Reports Server (NTRS)

    Karr, David A.; Vivona, Robert A.; Roscoe, David A.; DePascale, Stephen M.; Consiglio, Maria

    2009-01-01

    The Autonomous Operations Planner, a research prototype flight-deck decision support tool to enable airborne self-separation, uses a pattern-based genetic algorithm to resolve predicted conflicts between the ownship and traffic aircraft. Conflicts are resolved by modifying the active route within the ownship's flight management system according to a predefined set of maneuver pattern templates. The performance of this pattern-based genetic algorithm was evaluated in the context of batch-mode Monte Carlo simulations running over 3600 flight hours of autonomous aircraft in en-route airspace under conditions ranging from typical current traffic densities to several times that level. Encountering over 8900 conflicts during two simulation experiments, the genetic algorithm was able to resolve all but three conflicts, while maintaining a required time of arrival constraint for most aircraft. Actual elapsed running time for the algorithm was consistent with conflict resolution in real time. The paper presents details of the genetic algorithm's design, along with mathematical models of the algorithm's performance and observations regarding the effectiveness of using complimentary maneuver patterns when multiple resolutions by the same aircraft were required.

  19. A Fuzzy Genetic Algorithm Approach to an Adaptive Information Retrieval Agent.

    ERIC Educational Resources Information Center

    Martin-Bautista, Maria J.; Vila, Maria-Amparo; Larsen, Henrik Legind

    1999-01-01

    Presents an approach to a Genetic Information Retrieval Agent Filter (GIRAF) that filters and ranks documents retrieved from the Internet according to users' preferences by using a Genetic Algorithm and fuzzy set theory to handle the imprecision of users' preferences and users' evaluation of the retrieved documents. (Author/LRW)

  20. Improving the searching abilities of a real-valued genetic algorithm

    E-print Network

    Houser, Robert Charles

    2000-01-01

    This investigation shows that a genetic algorithm seems to be able to search a solution space more effectively with the addition of a gradient-based local improvement scheme. The objective of this research was to determine if a new hybrid genetic...

  1. Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems

    E-print Network

    Yang, Shengxiang

    Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems Shengxiang Yang.g., via random immigrants. This paper proposes an elitism-based immigrants scheme for genetic al- gorithms immigrants via mutation to replace the worst individuals in the current population. This way, the introduced

  2. Using Cyclic Genetic Algorithms to Evolve Multi-Loop Control Programs

    E-print Network

    Parker, Gary B.

    Using Cyclic Genetic Algorithms to Evolve Multi-Loop Control Programs Gary B. Parker Ramona A. Georgescu Computer Science Electrical and Computer Engineering Connecticut College Boston University New London, CT 06320, USA Boston, MA 02215, USA parker@conncoll.edu rageo@bu.edu Abstract - Cyclic genetic

  3. A Serial and Parallel Genetic Based Learning Algorithm for Bayesian Classifier to Predict Metabolic Syndrome

    E-print Network

    Cho, Sung-Bae

    A Serial and Parallel Genetic Based Learning Algorithm for Bayesian Classifier to Predict Metabolic Engineering KIIT University Bhubaneswar-751024, Orissa, India mishra.bsp@gmail.com, link2rahulroy@gmail.com S and parallel genetic based learnable bayesian classifier for designing a prognostic model for metabolic

  4. Sexual and Asexual Paradigms in Evolution: The Implications for Genetic Algorithms

    E-print Network

    Andrews, Mark W.

    asexual reproduction. We generalize the class of models beyond those considered in [1] while still, rather than asexual, reproduction methods. MacKay compared systems that evolve by genetic recombinationSexual and Asexual Paradigms in Evolution: The Implications for Genetic Algorithms No Author Given

  5. Dynamic Frequencies Correction in Piezoelectric Transducers using Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Arnold, F. J.; Battilana, R. B.; Aranda, M. C.

    The performance of piezoelectric transducers is affected by variation of the acoustic loads. Correction of the excitation frequency are needed to maintain the performance. This paper presents an algorithm for dynamic correction of the operating frequency based on adaptive systems able to correct the frequency applying artificial intelligence techniques to a survey of impedance profiles. When the impedance is changed, a searching of similar values is performed in previously stored files and an iterative process finds the final frequency closer to the original impedance for the required performance. Simulations has been carried out using electric models. The results show the system is robust and the average response time is 6 ms.

  6. Modelling and genetic algorithm based optimisation of inverse supply chain

    NASA Astrophysics Data System (ADS)

    B醤yai, T.

    2009-04-01

    The design and control of recycling systems of products with environmental risk have been discussed in the world already for a long time. The main reasons to address this subject are the followings: reduction of waste volume, intensification of recycling of materials, closing the loop, use of less resource, reducing environmental risk [1, 2]. The development of recycling systems is based on the integrated solution of technological and logistic resources and know-how [3]. However the financial conditions of recycling systems is partly based on the recovery, disassembly and remanufacturing options of the used products [4, 5, 6], but the investment and operation costs of recycling systems can be characterised with high logistic costs caused by the geographically wide collection system with more collection level and a high number of operation points of the inverse supply chain. The reduction of these costs is a popular area of the logistics researches. These researches include the design and implementation of comprehensive environmental waste and recycling program to suit business strategies (global system), design and supply all equipment for production line collection (external system), design logistics process to suit the economical and ecological requirements (external system) [7]. To the knowledge of the author, there has been no research work on supply chain design problems that purpose is the logistics oriented optimisation of inverse supply chain in the case of non-linear total cost function consisting not only operation costs but also environmental risk cost. The antecedent of this research is, that the author has taken part in some research projects in the field of closed loop economy ("Closing the loop of electr(on)ic products and domestic appliances from product planning to end-of-life technologies), environmental friendly disassembly (Concept for logistical and environmental disassembly technologies) and design of recycling systems of household appliances (Recycling of household appliances with emphasis on reuse options). The purpose of this paper is the presentation of a possible method for avoiding the unnecessary environmental risk and landscape use through unprovoked large supply chain of collection systems of recycling processes. In the first part of the paper the author presents the mathematical model of recycling related collection systems (applied especially for wastes of electric and electronic products) and in the second part of the work a genetic algorithm based optimisation method will be demonstrated, by the aid of which it is possible to determine the optimal structure of the inverse supply chain from the point of view economical, ecological and logistic objective functions. The model of the inverse supply chain is based on a multi-level, hierarchical collection system. In case of this static model it is assumed that technical conditions are permanent. The total costs consist of three parts: total infrastructure costs, total material handling costs and environmental risk costs. The infrastructure-related costs are dependent only on the specific fixed costs and the specific unit costs of the operation points (collection, pre-treatment, treatment, recycling and reuse plants). The costs of warehousing and transportation are represented by the material handling related costs. The most important factors determining the level of environmental risk cost are the number of out of time recycled (treated or reused) products, the number of supply chain objects and the length of transportation routes. The objective function is the minimization of the total cost taking into consideration the constraints. However a lot of research work discussed the design of supply chain [8], but most of them concentrate on linear cost functions. In the case of this model non-linear cost functions were used. The non-linear cost functions and the possible high number of objects of the inverse supply chain leaded to the problem of choosing a possible solution method. By the aid of analytical methods, the problem can not be so

  7. A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows

    PubMed Central

    Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

    2015-01-01

    A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following. PMID:26343655

  8. A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows.

    PubMed

    Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

    2015-01-01

    A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following. PMID:26343655

  9. High Quality Typhoon Cloud Image Restoration by Combining Genetic Algorithm with Contourlet Transform

    SciTech Connect

    Zhang Changjiang; Wang Xiaodong

    2008-11-06

    An efficient typhoon cloud image restoration algorithm is proposed. Having implemented contourlet transform to a typhoon cloud image, noise is reduced in the high sub-bands. Weight median value filter is used to reduce the noise in the contourlet domain. Inverse contourlet transform is done to obtain the de-noising image. In order to enhance the global contrast of the typhoon cloud image, in-complete Beta transform (IBT) is used to determine non-linear gray transform curve so as to enhance global contrast for the de-noising typhoon cloud image. Genetic algorithm is used to obtain the optimal gray transform curve. Information entropy is used as the fitness function of the genetic algorithm. Experimental results show that the new algorithm is able to well enhance the global for the typhoon cloud image while well reducing the noises in the typhoon cloud image.

  10. Research on Formation of Microsatellite Communication with Genetic Algorithm

    PubMed Central

    Wu, Guoqiang; Bai, Yuguang; Sun, Zhaowei

    2013-01-01

    For the formation of three microsatellites which fly in the same orbit and perform three-dimensional solid mapping for terra, this paper proposes an optimizing design method of space circular formation order based on improved generic algorithm and provides an intersatellite direct spread spectrum communication system. The calculating equation of LEO formation flying satellite intersatellite links is guided by the special requirements of formation-flying microsatellite intersatellite links, and the transmitter power is also confirmed throughout the simulation. The method of space circular formation order optimizing design based on improved generic algorithm is given, and it can keep formation order steady for a long time under various absorb impetus. The intersatellite direct spread spectrum communication system is also provided. It can be found that, when the distance is 1?km and the data rate is 1?Mbps, the input wave matches preferably with the output wave. And LDPC code can improve the communication performance. The correct capability of (512, 256) LDPC code is better than (2, 1, 7) convolution code, distinctively. The design system can satisfy the communication requirements of microsatellites. So, the presented method provides a significant theory foundation for formation-flying and intersatellite communication. PMID:24078796

  11. 1128 IEEE TRANSACTIONS ON MAGNETICS, VOL. 36, NO. 4, JULY 2000 A Genetic Algorithm Combined with Finite Element

    E-print Network

    Ge, Shuzhi Sam

    1128 IEEE TRANSACTIONS ON MAGNETICS, VOL. 36, NO. 4, JULY 2000 A Genetic Algorithm Combined. Bi Abstract--This paper describes a design optimization proce- dure based on a genetic algorithm. Index Terms--Actuators, finite element analysis, genetic algo- rithms, robust design. I. INTRODUCTION

  12. Abstract--Multiobjective Genetic Algorithms (MOGA) and Case-based Reasoning (CBR) have proven successful in the

    E-print Network

    Agogino, Alice M.

    Abstract--Multiobjective Genetic Algorithms (MOGA) and Case-based Reasoning (CBR) have proven structures of primitive and complex genetic algorithm (GA) elements have been developed to restrict genetic consumer electronics, biotechnology, automotive systems and aerospace. As these devices grow in complexity

  13. Multi-objective optimization of laser-welded steel sandwich panels for static loads using a genetic algorithm

    E-print Network

    Vel, Senthil

    Finite element analysis Genetic algorithms Evolutionary optimization a b s t r a c t We present for multiple, conflicting objectives using an integer-coded non-dominated sorting genetic algorithmMulti-objective optimization of laser-welded steel sandwich panels for static loads using a genetic

  14. Multiple Vehicle Routing With Time Windows Using Genetic Algorithms Sushil J. Louis Xiangying Yin Zhen Ya Yuan

    E-print Network

    Louis, Sushil J.

    Multiple Vehicle Routing With Time Windows Using Genetic Algorithms Sushil J. Louis Xiangying Yin Zhen Ya Yuan Genetic Adaptive Systems Lab Department of Computer Science Department of Computer Science Reno, NV 89557 sushil@cs.unr.edu Abstract- We use genetic algorithm to attack the vehicle routing

  15. Stochastic optimization of a cold atom experiment using a genetic algorithm

    SciTech Connect

    Rohringer, W.; Buecker, R.; Manz, S.; Betz, T.; Koller, Ch.; Goebel, M.; Perrin, A.; Schmiedmayer, J.; Schumm, T.

    2008-12-29

    We employ an evolutionary algorithm to automatically optimize different stages of a cold atom experiment without human intervention. This approach closes the loop between computer based experimental control systems and automatic real time analysis and can be applied to a wide range of experimental situations. The genetic algorithm quickly and reliably converges to the most performing parameter set independent of the starting population. Especially in many-dimensional or connected parameter spaces, the automatic optimization outperforms a manual search.

  16. Optimal Parameter for the Training of Multilayer Perceptron Neural Networks by Using Hierarchical Genetic Algorithm

    SciTech Connect

    Orozco-Monteagudo, Maykel; Taboada-Crispi, Alberto; Gutierrez-Hernandez, Liliana

    2008-11-06

    This paper deals with the controversial topic of the selection of the parameters of a genetic algorithm, in this case hierarchical, used for training of multilayer perceptron neural networks for the binary classification. The parameters to select are the crossover and mutation probabilities of the control and parametric genes and the permanency percent. The results can be considered as a guide for using this kind of algorithm.

  17. A Validated Phenotyping Algorithm for Genetic Association Studies in Age-related Macular Degeneration

    PubMed Central

    Simonett, Joseph M.; Sohrab, Mahsa A.; Pacheco, Jennifer; Armstrong, Loren L.; Rzhetskaya, Margarita; Smith, Maureen; Geoffrey Hayes, M.; Fawzi, Amani A.

    2015-01-01

    Age-related macular degeneration (AMD), a multifactorial, neurodegenerative disease, is a leading cause of vision loss. With the rapid advancement of DNA sequencing technologies, many AMD-associated genetic polymorphisms have been identified. Currently, the most time consuming steps of these studies are patient recruitment and phenotyping. In this study, we describe the development of an automated algorithm to identify neovascular (wet) AMD, non-neovascular (dry) AMD and control subjects using electronic medical record (EMR)-based criteria. Positive predictive value (91.7%) and negative predictive value (97.5%) were calculated using expert chart review as the gold standard to assess algorithm performance. We applied the algorithm to an EMR-linked DNA bio-repository to study previously identified AMD-associated single nucleotide polymorphisms (SNPs), using case/control status determined by the algorithm. Risk alleles of three SNPs, rs1061170 (CFH), rs1410996 (CFH), and rs10490924 (ARMS2) were found to be significantly associated with the AMD case/control status as defined by the algorithm. With the rapid growth of EMR-linked DNA biorepositories, patient selection algorithms can greatly increase the efficiency of genetic association study. We have found that stepwise validation of such an algorithm can result in reliable cohort selection and, when coupled within an EMR-linked DNA biorepository, replicates previously published AMD-associated SNPs. PMID:26255974

  18. Analysis of charge-exchange spectroscopy data by combining genetic and Gauss-Newton algorithms

    NASA Astrophysics Data System (ADS)

    Qian, Ma; Haoyi, Zuo; Yanling, Wei; Liang, Liu; Wenjin, Chen; Xiaoxue, He; Shirong, Luo

    2015-11-01

    The temperature and rotation velocity profile of ions in a tokamak are two characteristic parameters that reflect the plasma's behavior. Measurement of the two parameters relies on analyzing an active charge exchange spectroscopy diagnostic. However, a very challenging problem in such a diagnostic is the existence of interfering spectral lines, which can mislead the spectrum analysis process. This work proposes combining a genetic algorithm with the Gauss-Newton method (GAGN) to address this problem. Using this GAGN algorithm, we can effectively distinguish between the useful spectrum line and the interfering spectral lines within the spectroscopic output. The accuracy and stability of this algorithm are verified using both numerical simulation and actual measurements.

  19. Learning Cue Phrase Patterns from Radiology Reports Using a Genetic Algorithm

    SciTech Connect

    Patton, Robert M; Beckerman, Barbara G; Potok, Thomas E

    2009-01-01

    Various computer-assisted technologies have been developed to assist radiologists in detecting cancer; however, the algorithms still lack high degrees of sensitivity and specificity, and must undergo machine learning against a training set with known pathologies in order to further refine the algorithms with higher validity of truth. This work describes an approach to learning cue phrase patterns in radiology reports that utilizes a genetic algorithm (GA) as the learning method. The approach described here successfully learned cue phrase patterns for two distinct classes of radiology reports. These patterns can then be used as a basis for automatically categorizing, clustering, or retrieving relevant data for the user.

  20. Effectiv e Genetic Algorithm for Multi o ntegr te roce l nning n che uling ith riou

    E-print Network

    An Effectiv e Genetic Algorithm for Multi o ectiv e ntegr te roce l nning n che uling ith riou le i/9/14, appeared: 1/12/14 J.UCS #12; . 1927 Li X., Wen X., Gao L.: An Effective Genetic Algorithm ... #12; 1928 Li X., Wen X., Gao L.: An Effective Genetic Algorithm ... #12; Multi o ectiv e e cri tion e