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.
From Genetics to Genetic Algorithms
Indian Academy of Sciences (India)
Genetic algorithms (GAs) are computational optimisation schemes with an ... The algorithms solve optimisation problems ..... Genetic Algorithms in Search, Optimisation and Machine. Learning, Addison-Wesley Publishing Company, Inc. 1989.
Cai, Yao; Hu, Huasi; Pan, Ziheng; Hu, Guang; Zhang, Tao
2018-05-17
To optimize the shield for neutrons and gamma rays compact and lightweight, a method combining the structure and components together was established employing genetic algorithms and MCNP code. As a typical case, the fission energy spectrum of 235 U which mixed neutrons and gamma rays was adopted in this study. Six types of materials were presented and optimized by the method. Spherical geometry was adopted in the optimization after checking the geometry effect. Simulations have made to verify the reliability of the optimization method and the efficiency of the optimized materials. To compare the materials visually and conveniently, the volume and weight needed to build a shield are employed. The results showed that, the composite multilayer material has the best performance. Copyright © 2018 Elsevier Ltd. All rights reserved.
Where genetic algorithms excel.
Baum, E B; Boneh, D; Garrett, C
2001-01-01
We analyze the performance of a genetic algorithm (GA) we call Culling, and a variety of other algorithms, on a problem we refer to as the Additive Search Problem (ASP). We show that the problem of learning the Ising perceptron is reducible to a noisy version of ASP. Noisy ASP is the first problem we are aware of where a genetic-type algorithm bests all known competitors. We generalize ASP to k-ASP to study whether GAs will achieve "implicit parallelism" in a problem with many more schemata. GAs fail to achieve this implicit parallelism, but we describe an algorithm we call Explicitly Parallel Search that succeeds. We also compute the optimal culling point for selective breeding, which turns out to be independent of the fitness function or the population distribution. We also analyze a mean field theoretic algorithm performing similarly to Culling on many problems. These results provide insight into when and how GAs can beat competing methods.
Foundations of genetic algorithms 1991
1991-01-01
Foundations of Genetic Algorithms 1991 (FOGA 1) discusses the theoretical foundations of genetic algorithms (GA) and classifier systems.This book compiles research papers on selection and convergence, coding and representation, problem hardness, deception, classifier system design, variation and recombination, parallelization, and population divergence. Other topics include the non-uniform Walsh-schema transform; spurious correlations and premature convergence in genetic algorithms; and variable default hierarchy separation in a classifier system. The grammar-based genetic algorithm; condition
Kramer, Oliver
2017-01-01
This book introduces readers to genetic algorithms (GAs) with an emphasis on making the concepts, algorithms, and applications discussed as easy to understand as possible. Further, it avoids a great deal of formalisms and thus opens the subject to a broader audience in comparison to manuscripts overloaded by notations and equations. The book is divided into three parts, the first of which provides an introduction to GAs, starting with basic concepts like evolutionary operators and continuing with an overview of strategies for tuning and controlling parameters. In turn, the second part focuses on solution space variants like multimodal, constrained, and multi-objective solution spaces. Lastly, the third part briefly introduces theoretical tools for GAs, the intersections and hybridizations with machine learning, and highlights selected promising applications.
From Genetics to Genetic Algorithms
Indian Academy of Sciences (India)
artificial genetic system) string feature or ... called the genotype whereas it is called a structure in artificial genetic ... assigned a fitness value based on the cost function. Better ..... way it has produced complex, intelligent living organisms capable of ...
Fast compact algorithms and software for spline smoothing
Weinert, Howard L
2012-01-01
Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, QR factorization, or the fast Fourier transform. All algorithms are implemented in MATLAB and are compared based on speed, memory use, and accuracy. An overall best algorithm is identified, which allows very large data sets to be processed quickly on a personal computer.
An investigation of genetic algorithms
International Nuclear Information System (INIS)
Douglas, S.R.
1995-04-01
Genetic algorithms mimic biological evolution by natural selection in their search for better individuals within a changing population. they can be used as efficient optimizers. This report discusses the developing field of genetic algorithms. It gives a simple example of the search process and introduces the concept of schema. It also discusses modifications to the basic genetic algorithm that result in species and niche formation, in machine learning and artificial evolution of computer programs, and in the streamlining of human-computer interaction. (author). 3 refs., 1 tab., 2 figs
Rendezvous maneuvers using Genetic Algorithm
International Nuclear Information System (INIS)
Dos Santos, Denílson Paulo Souza; De Almeida Prado, Antônio F Bertachini; Teodoro, Anderson Rodrigo Barretto
2013-01-01
The present paper has the goal of studying orbital maneuvers of Rendezvous, that is an orbital transfer where a spacecraft has to change its orbit to meet with another spacecraft that is travelling in another orbit. This transfer will be accomplished by using a multi-impulsive control. A genetic algorithm is used to find the transfers that have minimum fuel consumption
Genetic algorithms for protein threading.
Yadgari, J; Amir, A; Unger, R
1998-01-01
Despite many years of efforts, a direct prediction of protein structure from sequence is still not possible. As a result, in the last few years researchers have started to address the "inverse folding problem": Identifying and aligning a sequence to the fold with which it is most compatible, a process known as "threading". In two meetings in which protein folding predictions were objectively evaluated, it became clear that threading as a concept promises a real breakthrough, but that much improvement is still needed in the technique itself. Threading is a NP-hard problem, and thus no general polynomial solution can be expected. Still a practical approach with demonstrated ability to find optimal solutions in many cases, and acceptable solutions in other cases, is needed. We applied the technique of Genetic Algorithms in order to significantly improve the ability of threading algorithms to find the optimal alignment of a sequence to a structure, i.e. the alignment with the minimum free energy. A major progress reported here is the design of a representation of the threading alignment as a string of fixed length. With this representation validation of alignments and genetic operators are effectively implemented. Appropriate data structure and parameters have been selected. It is shown that Genetic Algorithm threading is effective and is able to find the optimal alignment in a few test cases. Furthermore, the described algorithm is shown to perform well even without pre-definition of core elements. Existing threading methods are dependent on such constraints to make their calculations feasible. But the concept of core elements is inherently arbitrary and should be avoided if possible. While a rigorous proof is hard to submit yet an, we present indications that indeed Genetic Algorithm threading is capable of finding consistently good solutions of full alignments in search spaces of size up to 10(70).
Problem solving with genetic algorithms and Splicer
Bayer, Steven E.; Wang, Lui
1991-01-01
Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.
Effective data compaction algorithm for vector scan EB writing system
Ueki, Shinichi; Ashida, Isao; Kawahira, Hiroichi
2001-01-01
We have developed a new mask data compaction algorithm dedicated to vector scan electron beam (EB) writing systems for 0.13 μm device generation. Large mask data size has become a significant problem at mask data processing for which data compaction is an important technique. In our new mask data compaction, 'array' representation and 'cell' representation are used. The mask data format for the EB writing system with vector scan supports these representations. The array representation has a pitch and a number of repetitions in both X and Y direction. The cell representation has a definition of figure group and its reference. The new data compaction method has the following three steps. (1) Search arrays of figures by selecting pitches of array so that a number of figures are included. (2) Find out same arrays that have same repetitive pitch and number of figures. (3) Search cells of figures, where the figures in each cell take identical positional relationship. By this new method for the mask data of a 4M-DRAM block gate layer with peripheral circuits, 202 Mbytes without compaction was highly compacted to 6.7 Mbytes in 20 minutes on a 500 MHz PC.
Genetic Algorithms for Case Adaptation
Energy Technology Data Exchange (ETDEWEB)
Salem, A M [Computer Science Dept, Faculty of Computer and Information Sciences, Ain Shams University, Cairo (Egypt); Mohamed, A H [Solid State Dept., (NCRRT), Cairo (Egypt)
2008-07-01
Case based reasoning (CBR) paradigm has been widely used to provide computer support for recalling and adapting known cases to novel situations. Case adaptation algorithms generally rely on knowledge based and heuristics in order to change the past solutions to solve new problems. However, case adaptation has always been a difficult process to engineers within (CBR) cycle. Its difficulties can be referred to its domain dependency; and computational cost. In an effort to solve this problem, this research explores a general-purpose method that applying a genetic algorithm (GA) to CBR adaptation. Therefore, it can decrease the computational complexity of the search space in the problems having a great dependency on their domain knowledge. The proposed model can be used to perform a variety of design tasks on a broad set of application domains. However, it has been implemented for the tablet formulation as a domain of application. The proposed system has improved the performance of the CBR design systems.
Genetic Algorithms for Case Adaptation
International Nuclear Information System (INIS)
Salem, A.M.; Mohamed, A.H.
2008-01-01
Case based reasoning (CBR) paradigm has been widely used to provide computer support for recalling and adapting known cases to novel situations. Case adaptation algorithms generally rely on knowledge based and heuristics in order to change the past solutions to solve new problems. However, case adaptation has always been a difficult process to engineers within (CBR) cycle. Its difficulties can be referred to its domain dependency; and computational cost. In an effort to solve this problem, this research explores a general-purpose method that applying a genetic algorithm (GA) to CBR adaptation. Therefore, it can decrease the computational complexity of the search space in the problems having a great dependency on their domain knowledge. The proposed model can be used to perform a variety of design tasks on a broad set of application domains. However, it has been implemented for the tablet formulation as a domain of application. The proposed system has improved the performance of the CBR design systems
Learning Intelligent Genetic Algorithms Using Japanese Nonograms
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…
Compact Hilbert Curve Index Algorithm Based on Gray Code
Directory of Open Access Journals (Sweden)
CAO Xuefeng
2016-12-01
Full Text Available Hilbert curve has best clustering in various kinds of space filling curves, and has been used as an important tools in discrete global grid spatial index design field. But there are lots of redundancies in the standard Hilbert curve index when the data set has large differences between dimensions. In this paper, the construction features of Hilbert curve is analyzed based on Gray code, and then the compact Hilbert curve index algorithm is put forward, in which the redundancy problem has been avoided while Hilbert curve clustering preserved. Finally, experiment results shows that the compact Hilbert curve index outperforms the standard Hilbert index, their 1 computational complexity is nearly equivalent, but the real data set test shows the coding time and storage space decrease 40%, the speedup ratio of sorting speed is nearly 4.3.
Genetic algorithms and fuzzy multiobjective optimization
Sakawa, Masatoshi
2002-01-01
Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a w...
Boolean Queries Optimization by Genetic Algorithms
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav
2005-01-01
Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research
Genetic Algorithms for Case Adaptation
International Nuclear Information System (INIS)
Salem, A.M.; Mohamed, A.H.
2008-01-01
Case adaptation is the core of case based reasoning (CBR) approach that can modify the past solutions to solve new problems. It generally relies on the knowledge base and heuristics in order to achieve the required changes. It has always been a difficult process to designers within (CBR) cycle. Its difficulties can be referred to the large effort, and computational analysis needed for acquiring the knowledge's domain. To solve these problems, this research explores a new method that applying a genetic algorithm (GA) to CBR adaptation. However, it can decrease the computational complexity of determining the required changes of the problems especially those having a great amount of domain knowledge. besides, it can decrease the required time by dividing the design task into sub tasks those can be solved at the same time. Therefore, the proposed system can he practically applied for solving the complex problems. It can be used to perform a variety of design tasks on a broad set of application domains. However, it has been implemented for the tablet formulation as a domain of application. Proposed system has improved the accuracy performance of the CBR design systems
Portfolio selection using genetic algorithms | Yahaya | International ...
African Journals Online (AJOL)
In this paper, one of the nature-inspired evolutionary algorithms – a Genetic Algorithms (GA) was used in solving the portfolio selection problem (PSP). Based on a real dataset from a popular stock market, the performance of the algorithm in relation to those obtained from one of the popular quadratic programming (QP) ...
Dynamic traffic assignment : genetic algorithms approach
1997-01-01
Real-time route guidance is a promising approach to alleviating congestion on the nations highways. A dynamic traffic assignment model is central to the development of guidance strategies. The artificial intelligence technique of genetic algorithm...
Genetic algorithms at UC Davis/LLNL
Energy Technology Data Exchange (ETDEWEB)
Vemuri, V.R. [comp.
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.
Genetic algorithm for nuclear data evaluation
Energy Technology Data Exchange (ETDEWEB)
Arthur, Jennifer Ann [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2018-02-02
These are slides on genetic algorithm for nuclear data evaluation. The following is covered: initial population, fitness (outer loop), calculate fitness, selection (first part of inner loop), reproduction (second part of inner loop), solution, and examples.
Genetic algorithms and supernovae type Ia analysis
International Nuclear Information System (INIS)
Bogdanos, Charalampos; Nesseris, Savvas
2009-01-01
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 w(z) ≡ P DE /ρ DE . 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
Particle swarm genetic algorithm and its application
International Nuclear Information System (INIS)
Liu Chengxiang; Yan Changxiang; Wang Jianjun; Liu Zhenhai
2012-01-01
To solve the problems of slow convergence speed and tendency to fall into the local optimum of the standard particle swarm optimization while dealing with nonlinear constraint optimization problem, a particle swarm genetic algorithm is designed. The proposed algorithm adopts feasibility principle handles constraint conditions and avoids the difficulty of penalty function method in selecting punishment factor, generates initial feasible group randomly, which accelerates particle swarm convergence speed, and introduces genetic algorithm crossover and mutation strategy to avoid particle swarm falls into the local optimum Through the optimization calculation of the typical test functions, the results show that particle swarm genetic algorithm has better optimized performance. The algorithm is applied in nuclear power plant optimization, and the optimization results are significantly. (authors)
Evolving temporal association rules with genetic algorithms
Matthews, Stephen G.; Gongora, Mario A.; Hopgood, Adrian A.
2010-01-01
A novel framework for mining temporal association rules by discovering itemsets with a genetic algorithm is introduced. Metaheuristics have been applied to association rule mining, we show the efficacy of extending this to another variant - temporal association rule mining. Our framework is an enhancement to existing temporal association rule mining methods as it employs a genetic algorithm to simultaneously search the rule space and temporal space. A methodology for validating the ability of...
Development of a Framework for Genetic Algorithms
Wååg, Håkan
2009-01-01
Genetic algorithms is a method of optimization that can be used tosolve many different kinds of problems. This thesis focuses ondeveloping a framework for genetic algorithms that is capable ofsolving at least the two problems explored in the work. Otherproblems are supported by allowing user-made extensions.The purpose of this thesis is to explore the possibilities of geneticalgorithms for optimization problems and artificial intelligenceapplications.To test the framework two applications are...
Quantum Genetic Algorithms for Computer Scientists
Lahoz Beltrá, Rafael
2016-01-01
Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data) has led to a new class of GAs known as “Quantum Geneti...
Genetic algorithms in loading pattern optimization
International Nuclear Information System (INIS)
Yilmazbayhan, A.; Tombakoglu, M.; Bekar, K. B.; Erdemli, A. Oe
2001-01-01
Genetic Algorithm (GA) based systems are used for the loading pattern optimization. The use of Genetic Algorithm operators such as regional crossover, crossover and mutation, and selection of initial population size for PWRs are discussed. Antithetic variates are used to generate the initial population. The performance of GA with antithetic variates is compared to traditional GA. The results of multi-cycle optimization are discussed for objective function taking into account cycle burn-up and discharge burn-up
Adaptive sensor fusion using genetic algorithms
International Nuclear Information System (INIS)
Fitzgerald, D.S.; Adams, D.G.
1994-01-01
Past attempts at sensor fusion have used some form of Boolean logic to combine the sensor information. As an alteniative, an adaptive ''fuzzy'' sensor fusion technique is described in this paper. This technique exploits the robust capabilities of fuzzy logic in the decision process as well as the optimization features of the genetic algorithm. This paper presents a brief background on fuzzy logic and genetic algorithms and how they are used in an online implementation of adaptive sensor fusion
Results of Evolution Supervised by Genetic Algorithms
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2010-09-01
Full Text Available The efficiency of a genetic algorithm is frequently assessed using a series of operators of evolution like crossover operators, mutation operators or other dynamic parameters. The present paper aimed to review the main results of evolution supervised by genetic algorithms used to identify solutions to agricultural and horticultural hard problems and to discuss the results of using a genetic algorithms on structure-activity relationships in terms of behavior of evolution supervised by genetic algorithms. A genetic algorithm had been developed and implemented in order to identify the optimal solution in term of estimation power of a multiple linear regression approach for structure-activity relationships. Three survival and three selection strategies (proportional, deterministic and tournament were investigated in order to identify the best survival-selection strategy able to lead to the model with higher estimation power. The Molecular Descriptors Family for structure characterization of a sample of 206 polychlorinated biphenyls with measured octanol-water partition coefficients was used as case study. Evolution using different selection and survival strategies proved to create populations of genotypes living in the evolution space with different diversity and variability. Under a series of criteria of comparisons these populations proved to be grouped and the groups were showed to be statistically different one to each other. The conclusions about genetic algorithm evolution according to a number of criteria were also highlighted.
Tag SNP selection via a genetic algorithm.
Mahdevar, Ghasem; Zahiri, Javad; Sadeghi, Mehdi; Nowzari-Dalini, Abbas; Ahrabian, Hayedeh
2010-10-01
Single Nucleotide Polymorphisms (SNPs) provide valuable information on human evolutionary history and may lead us to identify genetic variants responsible for human complex diseases. Unfortunately, molecular haplotyping methods are costly, laborious, and time consuming; therefore, algorithms for constructing full haplotype patterns from small available data through computational methods, Tag SNP selection problem, are convenient and attractive. This problem is proved to be an NP-hard problem, so heuristic methods may be useful. In this paper we present a heuristic method based on genetic algorithm to find reasonable solution within acceptable time. The algorithm was tested on a variety of simulated and experimental data. In comparison with the exact algorithm, based on brute force approach, results show that our method can obtain optimal solutions in almost all cases and runs much faster than exact algorithm when the number of SNP sites is large. Our software is available upon request to the corresponding author.
Solving the SAT problem using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Arunava Bhattacharjee
2017-08-01
Full Text Available In this paper we propose our genetic algorithm for solving the SAT problem. We introduce various crossover and mutation techniques and then make a comparative analysis between them in order to find out which techniques are the best suited for solving a SAT instance. Before the genetic algorithm is applied to an instance it is better to seek for unit and pure literals in the given formula and then try to eradicate them. This can considerably reduce the search space, and to demonstrate this we tested our algorithm on some random SAT instances. However, to analyse the various crossover and mutation techniques and also to evaluate the optimality of our algorithm we performed extensive experiments on benchmark instances of the SAT problem. We also estimated the ideal crossover length that would maximise the chances to solve a given SAT instance.
Genetic algorithm for neural networks optimization
Setyawati, Bina R.; Creese, Robert C.; Sahirman, Sidharta
2004-11-01
This paper examines the forecasting performance of multi-layer feed forward neural networks in modeling a particular foreign exchange rates, i.e. Japanese Yen/US Dollar. The effects of two learning methods, Back Propagation and Genetic Algorithm, in which the neural network topology and other parameters fixed, were investigated. The early results indicate that the application of this hybrid system seems to be well suited for the forecasting of foreign exchange rates. The Neural Networks and Genetic Algorithm were programmed using MATLAB«.
The Applications of Genetic Algorithms in Medicine
Directory of Open Access Journals (Sweden)
Ali Ghaheri
2015-11-01
Full Text Available 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.
The Applications of Genetic Algorithms in Medicine.
Ghaheri, Ali; Shoar, Saeed; Naderan, Mohammad; Hoseini, Sayed Shahabuddin
2015-11-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.].
Cognitive radio resource allocation based on coupled chaotic genetic algorithm
International Nuclear Information System (INIS)
Zu Yun-Xiao; Zhou Jie; Zeng Chang-Chang
2010-01-01
A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed
Directory of Open Access Journals (Sweden)
Dazhi Jiang
2015-01-01
Full Text Available At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. A fundamental question is “are there any algorithms that can design evolutionary algorithms automatically?” A more complete definition of the question is “can computer construct an algorithm which will generate algorithms according to the requirement of a problem?” In this paper, a novel evolutionary algorithm based on automatic designing of genetic operators is presented to address these questions. The resulting algorithm not only explores solutions in the problem space like most traditional evolutionary algorithms do, but also automatically generates genetic operators in the operator space. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted. The results show that the proposed algorithm can outperform standard differential evolution algorithm in terms of convergence speed and solution accuracy which shows that the algorithm designed automatically by computers can compete with the algorithms designed by human beings.
A Dynamic Construction Algorithm for the Compact Patricia Trie Using the Hierarchical Structure.
Jung, Minsoo; Shishibori, Masami; Tanaka, Yasuhiro; Aoe, Jun-ichi
2002-01-01
Discussion of information retrieval focuses on the use of binary trees and how to compact it to use less memory and take less time. Explains retrieval algorithms and describes data structure and hierarchical structure. (LRW)
Quantum Genetic Algorithms for Computer Scientists
Directory of Open Access Journals (Sweden)
Rafael Lahoz-Beltra
2016-10-01
Full Text Available Genetic algorithms (GAs are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data has led to a new class of GAs known as “Quantum Genetic Algorithms” (QGAs. In this review, we present a discussion, future potential, pros and cons of this new class of GAs. The review will be oriented towards computer scientists interested in QGAs “avoiding” the possible difficulties of quantum-mechanical phenomena.
Genetic Algorithms for Multiple-Choice Problems
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.
Genetic algorithm solution for partial digest problem.
Ahrabian, Hayedeh; Ganjtabesh, Mohammad; Nowzari-Dalini, Abbas; Razaghi-Moghadam-Kashani, Zahra
2013-01-01
One of the fundamental problems in computational biology is the construction of physical maps of chromosomes from the hybridisation experiments between unique probes and clones of chromosome fragments. Before introducing the shotgun sequencing method, Partial Digest Problem (PDP) was an intractable problem used to construct the physical maps of DNA sequence in molecular biology. In this paper, we develop a novel Genetic Algorithm (GA) for solving the PDP. This algorithm is implemented and compared with well-known existing algorithms on different types of random and real instances data, and the obtained results show the efficiency of our algorithm. Also, our GA is adapted to handle the erroneous data and their efficiency is presented for the large instances of this problem.
Genetic engineering versus natural evolution: Genetic algorithms with deterministic operators
Jozwiak, L.; Postula, A.
2002-01-01
Genetic algorithms (GA) have several important features that predestine them to solve design problems. Their main disadvantage however is the excessively long run-time that is needed to deliver satisfactory results for large instances of complex design problems. The main aims of this paper are (1)
Genetic Optimization Algorithm for Metabolic Engineering Revisited
Directory of Open Access Journals (Sweden)
Tobias B. Alter
2018-05-01
Full Text Available To date, several independent methods and algorithms exist for exploiting constraint-based stoichiometric models to find metabolic engineering strategies that optimize microbial production performance. Optimization procedures based on metaheuristics facilitate a straightforward adaption and expansion of engineering objectives, as well as fitness functions, while being particularly suited for solving problems of high complexity. With the increasing interest in multi-scale models and a need for solving advanced engineering problems, we strive to advance genetic algorithms, which stand out due to their intuitive optimization principles and the proven usefulness in this field of research. A drawback of genetic algorithms is that premature convergence to sub-optimal solutions easily occurs if the optimization parameters are not adapted to the specific problem. Here, we conducted comprehensive parameter sensitivity analyses to study their impact on finding optimal strain designs. We further demonstrate the capability of genetic algorithms to simultaneously handle (i multiple, non-linear engineering objectives; (ii the identification of gene target-sets according to logical gene-protein-reaction associations; (iii minimization of the number of network perturbations; and (iv the insertion of non-native reactions, while employing genome-scale metabolic models. This framework adds a level of sophistication in terms of strain design robustness, which is exemplarily tested on succinate overproduction in Escherichia coli.
Genetic Algorithms in Wind Turbine Airfoil Design
Energy Technology Data Exchange (ETDEWEB)
Grasso, F. [ECN Wind Energy, Petten (Netherlands); Bizzarrini, N.; Coiro, D.P. [Department of Aerospace Engineering, University of Napoli ' Federico II' , Napoli (Italy)
2011-03-15
One key element in the aerodynamic design of wind turbines is the use of specially tailored airfoils to increase the ratio of energy capture to the loading and thereby to reduce cost of energy. This work is focused on the design of a wind turbine airfoil by using numerical optimization. Firstly, the optimization approach is presented; a genetic algorithm is used, coupled with RFOIL solver and a composite Bezier geometrical parameterization. A particularly sensitive point is the choice and implementation of constraints; in order to formalize in the most complete and effective way the design requirements, the effects of activating specific constraints are discussed. A numerical example regarding the design of a high efficiency airfoil for the outer part of a blade by using genetic algorithms is illustrated and the results are compared with existing wind turbine airfoils. Finally a new hybrid design strategy is illustrated and discussed, in which the genetic algorithms are used at the beginning of the design process to explore a wide domain. Then, the gradient based algorithms are used in order to improve the first stage optimum.
Application of Genetic Algorithms in Seismic Tomography
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
Fashion sketch design by interactive genetic algorithms
Mok, P. Y.; Wang, X. X.; Xu, J.; Kwok, Y. L.
2012-11-01
Computer aided design is vitally important for the modern industry, particularly for the creative industry. Fashion industry faced intensive challenges to shorten the product development process. In this paper, a methodology is proposed for sketch design based on interactive genetic algorithms. The sketch design system consists of a sketch design model, a database and a multi-stage sketch design engine. First, a sketch design model is developed based on the knowledge of fashion design to describe fashion product characteristics by using parameters. Second, a database is built based on the proposed sketch design model to define general style elements. Third, a multi-stage sketch design engine is used to construct the design. Moreover, an interactive genetic algorithm (IGA) is used to accelerate the sketch design process. The experimental results have demonstrated that the proposed method is effective in helping laypersons achieve satisfied fashion design sketches.
Medical image segmentation using genetic algorithms.
Maulik, Ujjwal
2009-03-01
Genetic algorithms (GAs) have been found to be effective in the domain of medical image segmentation, since the problem can often be mapped to one of search in a complex and multimodal landscape. The challenges in medical image segmentation arise due to poor image contrast and artifacts that result in missing or diffuse organ/tissue boundaries. The resulting search space is therefore often noisy with a multitude of local optima. Not only does the genetic algorithmic framework prove to be effective in coming out of local optima, it also brings considerable flexibility into the segmentation procedure. In this paper, an attempt has been made to review the major applications of GAs to the domain of medical image segmentation.
Predicting mining activity with parallel genetic algorithms
Talaie, S.; Leigh, R.; Louis, S.J.; Raines, G.L.; Beyer, H.G.; O'Reilly, U.M.; Banzhaf, Arnold D.; Blum, W.; Bonabeau, C.; Cantu-Paz, E.W.; ,; ,
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.
Pavement maintenance scheduling using genetic algorithms
Yang, Chao; Remenyte-Prescott, Rasa; Andrews, John D.
2015-01-01
This paper presents a new pavement management system (PMS) to achieve the optimal pavement maintenance and rehabilitation (M&R) strategy for a highway network using genetic algorithms (GAs). Optimal M&R strategy is a set of pavement activities that both minimise the maintenance cost of a highway network and maximise the pavement condition of the road sections on the network during a certain planning period. NSGA-II, a multi-objective GA, is employed to perform pavement maintenance optimisatio...
An improved genetic algorithm with dynamic topology
International Nuclear Information System (INIS)
Cai Kai-Quan; Tang Yan-Wu; Zhang Xue-Jun; Guan Xiang-Min
2016-01-01
The genetic algorithm (GA) is a nature-inspired evolutionary algorithm to find optima in search space via the interaction of individuals. Recently, researchers demonstrated that the interaction topology plays an important role in information exchange among individuals of evolutionary algorithm. In this paper, we investigate the effect of different network topologies adopted to represent the interaction structures. It is found that GA with a high-density topology ends up more likely with an unsatisfactory solution, contrarily, a low-density topology can impede convergence. Consequently, we propose an improved GA with dynamic topology, named DT-GA, in which the topology structure varies dynamically along with the fitness evolution. Several experiments executed with 15 well-known test functions have illustrated that DT-GA outperforms other test GAs for making a balance of convergence speed and optimum quality. Our work may have implications in the combination of complex networks and computational intelligence. (paper)
Genetic algorithm optimization of atomic clusters
International Nuclear Information System (INIS)
Morris, J.R.; Deaven, D.M.; Ho, K.M.; Wang, C.Z.; Pan, B.C.; Wacker, J.G.; Turner, D.E.; Iowa State Univ., Ames, IA
1996-01-01
The authors have been using genetic algorithms to study the structures of atomic clusters and related problems. This is a problem where local minima are easy to locate, but barriers between the many minima are large, and the number of minima prohibit a systematic search. They use a novel mating algorithm that preserves some of the geometrical relationship between atoms, in order to ensure that the resultant structures are likely to inherit the best features of the parent clusters. Using this approach, they have been able to find lower energy structures than had been previously obtained. Most recently, they have been able to turn around the building block idea, using optimized structures from the GA to learn about systematic structural trends. They believe that an effective GA can help provide such heuristic information, and (conversely) that such information can be introduced back into the algorithm to assist in the search process
Optimal hydrogenerator governor tuning with a genetic algorithm
International Nuclear Information System (INIS)
Lansberry, J.E.; Wozniak, L.; Goldberg, D.E.
1992-01-01
Many techniques exist for developing optimal controllers. This paper investigates genetic algorithms as a means of finding optimal solutions over a parameter space. In particular, the genetic algorithm is applied to optimal tuning of a governor for a hydrogenerator plant. Analog and digital simulation methods are compared for use in conjunction with the genetic algorithm optimization process. It is shown that analog plant simulation provides advantages in speed over digital plant simulation. This speed advantage makes application of the genetic algorithm in an actual plant environment feasible. Furthermore, the genetic algorithm is shown to possess the ability to reject plant noise and other system anomalies in its search for optimizing solutions
Optical flow optimization using parallel genetic algorithm
Zavala-Romero, Olmo; Botella, Guillermo; Meyer-Bäse, Anke; Meyer Base, Uwe
2011-06-01
A new approach to optimize the parameters of a gradient-based optical flow model using a parallel genetic algorithm (GA) is proposed. The main characteristics of the optical flow algorithm are its bio-inspiration and robustness against contrast, static patterns and noise, besides working consistently with several optical illusions where other algorithms fail. This model depends on many parameters which conform the number of channels, the orientations required, the length and shape of the kernel functions used in the convolution stage, among many more. The GA is used to find a set of parameters which improve the accuracy of the optical flow on inputs where the ground-truth data is available. This set of parameters helps to understand which of them are better suited for each type of inputs and can be used to estimate the parameters of the optical flow algorithm when used with videos that share similar characteristics. The proposed implementation takes into account the embarrassingly parallel nature of the GA and uses the OpenMP Application Programming Interface (API) to speedup the process of estimating an optimal set of parameters. The information obtained in this work can be used to dynamically reconfigure systems, with potential applications in robotics, medical imaging and tracking.
Grouping genetic algorithms advances and applications
Mutingi, Michael
2017-01-01
This book presents advances and innovations in grouping genetic algorithms, enriched with new and unique heuristic optimization techniques. These algorithms are specially designed for solving industrial grouping problems where system entities are to be partitioned or clustered into efficient groups according to a set of guiding decision criteria. Examples of such problems are: vehicle routing problems, team formation problems, timetabling problems, assembly line balancing, group maintenance planning, modular design, and task assignment. A wide range of industrial grouping problems, drawn from diverse fields such as logistics, supply chain management, project management, manufacturing systems, engineering design and healthcare, are presented. Typical complex industrial grouping problems, with multiple decision criteria and constraints, are clearly described using illustrative diagrams and formulations. The problems are mapped into a common group structure that can conveniently be used as an input scheme to spe...
Using a genetic algorithm to solve fluid-flow problems
International Nuclear Information System (INIS)
Pryor, R.J.
1990-01-01
Genetic algorithms are based on the mechanics of the natural selection and natural genetics processes. These algorithms are finding increasing application to a wide variety of engineering optimization and machine learning problems. In this paper, the authors demonstrate the use of a genetic algorithm to solve fluid flow problems. Specifically, the authors use the algorithm to solve the one-dimensional flow equations for a pipe
The genetic algorithm for a signal enhancement
International Nuclear Information System (INIS)
Karimova, L.; Kuadykov, E.; Makarenko, N.
2004-01-01
The paper is devoted to the problem of time series enhancement, which is based on the analysis of local regularity. The model construction using this analysis does not require any a priori assumption on the structure of the noise and the functional relationship between original signal and noise. The signal itself may be nowhere differentiable with rapidly varying local regularity, what is overcome with the help of the new technique of increasing the local Hoelder regularity of the signal under research. A new signal with prescribed regularity is constructed using the genetic algorithm. This approach is applied to enhancement of time series in the paleoclimatology, solar physics, dendrochronology, meteorology and hydrology
The genetic algorithm for a signal enhancement
Energy Technology Data Exchange (ETDEWEB)
Karimova, L. [Laboratory of Computer Modelling, Institute of Mathematics, Pushkin Street 125, 480100 Almaty (Kazakhstan)]. E-mail: karimova@math.kz; Kuadykov, E. [Laboratory of Computer Modelling, Institute of Mathematics, Pushkin Street 125, 480100 Almaty (Kazakhstan); Makarenko, N. [Laboratory of Computer Modelling, Institute of Mathematics, Pushkin Street 125, 480100 Almaty (Kazakhstan)
2004-11-21
The paper is devoted to the problem of time series enhancement, which is based on the analysis of local regularity. The model construction using this analysis does not require any a priori assumption on the structure of the noise and the functional relationship between original signal and noise. The signal itself may be nowhere differentiable with rapidly varying local regularity, what is overcome with the help of the new technique of increasing the local Hoelder regularity of the signal under research. A new signal with prescribed regularity is constructed using the genetic algorithm. This approach is applied to enhancement of time series in the paleoclimatology, solar physics, dendrochronology, meteorology and hydrology.
A Tomographic method based on genetic algorithms
International Nuclear Information System (INIS)
Turcanu, C.; Alecu, L.; Craciunescu, T.; Niculae, C.
1997-01-01
Computerized tomography being a non-destructive and non-evasive technique is frequently used in medical application to generate three dimensional images of objects. Genetic algorithms are efficient, domain independent for a large variety of problems. The proposed method produces good quality reconstructions even in case of very small number of projection angles. It requests no a priori knowledge about the solution and takes into account the statistical uncertainties. The main drawback of the method is the amount of computer memory and time needed. (author)
Genetic Algorithms Principles Towards Hidden Markov Model
Directory of Open Access Journals (Sweden)
Nabil M. Hewahi
2011-10-01
Full Text Available In this paper we propose a general approach based on Genetic Algorithms (GAs to evolve Hidden Markov Models (HMM. The problem appears when experts assign probability values for HMM, they use only some limited inputs. The assigned probability values might not be accurate to serve in other cases related to the same domain. We introduce an approach based on GAs to find
out the suitable probability values for the HMM to be mostly correct in more cases than what have been used to assign the probability values.
Convergence analysis of canonical genetic algorithms.
Rudolph, G
1994-01-01
This paper analyzes the convergence properties of the canonical genetic algorithm (CGA) with mutation, crossover and proportional reproduction applied to static optimization problems. It is proved by means of homogeneous finite Markov chain analysis that a CGA will never converge to the global optimum regardless of the initialization, crossover, operator and objective function. But variants of CGA's that always maintain the best solution in the population, either before or after selection, are shown to converge to the global optimum due to the irreducibility property of the underlying original nonconvergent CGA. These results are discussed with respect to the schema theorem.
Comparison of genetic algorithms with conjugate gradient methods
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.
Instrument design and optimization using genetic algorithms
International Nuclear Information System (INIS)
Hoelzel, Robert; Bentley, Phillip M.; Fouquet, Peter
2006-01-01
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
Instrument design and optimization using genetic algorithms
Hölzel, Robert; Bentley, Phillip M.; Fouquet, Peter
2006-10-01
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.
A novel progressively swarmed mixed integer genetic algorithm for ...
African Journals Online (AJOL)
MIGA) which inherits the advantages of binary and real coded Genetic Algorithm approach. The proposed algorithm is applied for the conventional generation cost minimization Optimal Power Flow (OPF) problem and for the Security ...
Optimal support arrangement of piping systems using genetic algorithm
International Nuclear Information System (INIS)
Chiba, T.; Okado, S.; Fujii, I.; Itami, K.
1996-01-01
The support arrangement is one of the important factors in the design of piping systems. Much time is required to decide the arrangement of the supports. The authors applied a genetic algorithm to find the optimum support arrangement for piping systems. Examples are provided to illustrate the effectiveness of the genetic algorithm. Good results are obtained when applying the genetic algorithm to the actual designing of the piping system
New Algorithm of Automatic Complex Password Generator Employing Genetic Algorithm
Directory of Open Access Journals (Sweden)
Sura Jasim Mohammed
2018-01-01
Full Text Available Due to the occurred increasing in information sharing, internet popularization, E-commerce transactions, and data transferring, security and authenticity become an important and necessary subject. In this paper an automated schema was proposed to generate a strong and complex password which is based on entering initial data such as text (meaningful and simple information or not, with the concept of encoding it, then employing the Genetic Algorithm by using its operations crossover and mutation to generated different data from the entered one. The generated password is non-guessable and can be used in many and different applications and internet services like social networks, secured system, distributed systems, and online services. The proposed password generator achieved diffusion, randomness, and confusions, which are very necessary, required and targeted in the resulted password, in addition to the notice that the length of the generated password differs from the length of initial data, and any simple changing and modification in the initial data produces more and clear modification in the generated password. The proposed work was done using visual basic programing language.
Application of genetic algorithm to control design
International Nuclear Information System (INIS)
Lee, Yoon Joon; Cho, Kyung Ho
1995-01-01
A classical PID controller is designed by applying the GA (Genetic Algorithm) which searches the optimal parameters through three major operators of reproduction, crossover and mutation under the given constraints. The GA could minimize the designer's interference and the whole design process could easily be automated. In contrast with other traditional PID design methods which allows for the system output responses only, the design with the GA can take account of the magnitude or the rate of change of control input together with the output responses, which reflects the more realistic situations. Compared with other PIDs designed by the traditional methods such as Ziegler and analytic, the PID by the GA shows the superior response characteristics to those of others with the least control input energy
Genetic Algorithm Based Microscale Vehicle Emissions Modelling
Directory of Open Access Journals (Sweden)
Sicong Zhu
2015-01-01
Full Text Available There is a need to match emission estimations accuracy with the outputs of transport models. The overall error rate in long-term traffic forecasts resulting from strategic transport models is likely to be significant. Microsimulation models, whilst high-resolution in nature, may have similar measurement errors if they use the outputs of strategic models to obtain traffic demand predictions. At the microlevel, this paper discusses the limitations of existing emissions estimation approaches. Emission models for predicting emission pollutants other than CO2 are proposed. A genetic algorithm approach is adopted to select the predicting variables for the black box model. The approach is capable of solving combinatorial optimization problems. Overall, the emission prediction results reveal that the proposed new models outperform conventional equations in terms of accuracy and robustness.
Genetic algorithm for building envelope calibration
International Nuclear Information System (INIS)
Ramos Ruiz, Germán; Fernández Bandera, Carlos; Gómez-Acebo Temes, Tomás; Sánchez-Ostiz Gutierrez, Ana
2016-01-01
Highlights: • Calibration methodology using Multi-Objective Genetic Algorithm (NSGA-II). • Uncertainty analysis formulas implemented directly in EnergyPlus. • The methodology captures the heat dynamic of the building with a high level of accuracy. • Reduction in the number of parameters involved due to sensitivity analysis. • Cost-effective methodology using temperature sensors only. - Abstract: Buildings today represent 40% of world primary energy consumption and 24% of greenhouse gas emissions. In our society there is growing interest in knowing precisely when and how energy consumption occurs. This means that consumption measurement and verification plans are well-advanced. International agencies such as Efficiency Valuation Organization (EVO) and International Performance Measurement and Verification Protocol (IPMVP) have developed methodologies to quantify savings. This paper presents a methodology to accurately perform automated envelope calibration under option D (calibrated simulation) of IPMVP – vol. 1. This is frequently ignored because of its complexity, despite being more flexible and accurate in assessing the energy performance of a building. A detailed baseline energy model is used, and by means of a metaheuristic technique achieves a highly reliable and accurate Building Energy Simulation (BES) model suitable for detailed analysis of saving strategies. In order to find this BES model a Genetic Algorithm (NSGA-II) is used, together with a highly efficient engine to stimulate the objective, thus permitting rapid achievement of the goal. The result is a BES model that broadly captures the heat dynamic behaviour of the building. The model amply fulfils the parameters demanded by ASHRAE and EVO under option D.
A NEW HYBRID GENETIC ALGORITHM FOR VERTEX COVER PROBLEM
UĞURLU, Onur
2015-01-01
The minimum vertex cover problem belongs to the class of NP-compl ete graph theoretical problems. This paper presents a hybrid genetic algorithm to solve minimum ver tex cover problem. In this paper, it has been shown that when local optimization technique is added t o genetic algorithm to form hybrid genetic algorithm, it gives more quality solution than simple genet ic algorithm. Also, anew mutation operator has been developed especially for minimum verte...
Using Genetic Algorithms for Building Metrics of Collaborative Systems
Directory of Open Access Journals (Sweden)
Cristian CIUREA
2011-01-01
Full Text Available he paper objective is to reveal the importance of genetic algorithms in building robust metrics of collaborative systems. The main types of collaborative systems in economy are presented and some characteristics of genetic algorithms are described. A genetic algorithm was implemented in order to determine the local maximum and minimum points of the relative complexity function associated to a collaborative banking system. The intelligent collaborative systems based on genetic algorithms, representing the new generation of collaborative systems, are analyzed and the implementation of auto-adaptive interfaces in a banking application is described.
Improvement of ECM Techniques through Implementation of a Genetic Algorithm
National Research Council Canada - National Science Library
Townsend, James D
2008-01-01
This research effort develops the necessary interfaces between the radar signal processing components and an optimization routine, such as genetic algorithms, to develop Electronic Countermeasure (ECM...
Dynamic airspace configuration by genetic algorithm
Directory of Open Access Journals (Sweden)
Marina Sergeeva
2017-06-01
Full Text Available With the continuous air traffic growth and limits of resources, there is a need for reducing the congestion of the airspace systems. Nowadays, several projects are launched, aimed at modernizing the global air transportation system and air traffic management. In recent years, special interest has been paid to the solution of the dynamic airspace configuration problem. Airspace sector configurations need to be dynamically adjusted to provide maximum efficiency and flexibility in response to changing weather and traffic conditions. The main objective of this work is to automatically adapt the airspace configurations according to the evolution of traffic. In order to reach this objective, the airspace is considered to be divided into predefined 3D airspace blocks which have to be grouped or ungrouped depending on the traffic situation. The airspace structure is represented as a graph and each airspace configuration is created using a graph partitioning technique. We optimize airspace configurations using a genetic algorithm. The developed algorithm generates a sequence of sector configurations for one day of operation with the minimized controller workload. The overall methodology is implemented and successfully tested with air traffic data taken for one day and for several different airspace control areas of Europe.
Optimizing doped libraries by using genetic algorithms
Tomandl, Dirk; Schober, Andreas; Schwienhorst, Andreas
1997-01-01
The insertion of random sequences into protein-encoding genes in combination with biologicalselection techniques has become a valuable tool in the design of molecules that have usefuland possibly novel properties. By employing highly effective screening protocols, a functionaland unique structure that had not been anticipated can be distinguished among a hugecollection of inactive molecules that together represent all possible amino acid combinations.This technique is severely limited by its restriction to a library of manageable size. Oneapproach for limiting the size of a mutant library relies on `doping schemes', where subsetsof amino acids are generated that reveal only certain combinations of amino acids in a proteinsequence. Three mononucleotide mixtures for each codon concerned must be designed, suchthat the resulting codons that are assembled during chemical gene synthesis represent thedesired amino acid mixture on the level of the translated protein. In this paper we present adoping algorithm that `reverse translates' a desired mixture of certain amino acids into threemixtures of mononucleotides. The algorithm is designed to optimally bias these mixturestowards the codons of choice. This approach combines a genetic algorithm with localoptimization strategies based on the downhill simplex method. Disparate relativerepresentations of all amino acids (and stop codons) within a target set can be generated.Optional weighing factors are employed to emphasize the frequencies of certain amino acidsand their codon usage, and to compensate for reaction rates of different mononucleotidebuilding blocks (synthons) during chemical DNA synthesis. The effect of statistical errors thataccompany an experimental realization of calculated nucleotide mixtures on the generatedmixtures of amino acids is simulated. These simulations show that the robustness of differentoptima with respect to small deviations from calculated values depends on their concomitantfitness. Furthermore
Warehouse stocking optimization based on dynamic ant colony genetic algorithm
Xiao, Xiaoxu
2018-04-01
In view of the various orders of FAW (First Automotive Works) International Logistics Co., Ltd., the SLP method is used to optimize the layout of the warehousing units in the enterprise, thus the warehouse logistics is optimized and the external processing speed of the order is improved. In addition, the relevant intelligent algorithms for optimizing the stocking route problem are analyzed. The ant colony algorithm and genetic algorithm which have good applicability are emphatically studied. The parameters of ant colony algorithm are optimized by genetic algorithm, which improves the performance of ant colony algorithm. A typical path optimization problem model is taken as an example to prove the effectiveness of parameter optimization.
Selfish Gene Algorithm Vs Genetic Algorithm: A Review
Ariff, Norharyati Md; Khalid, Noor Elaiza Abdul; Hashim, Rathiah; Noor, Noorhayati Mohamed
2016-11-01
Evolutionary algorithm is one of the algorithms inspired by the nature. Within little more than a decade hundreds of papers have reported successful applications of EAs. In this paper, the Selfish Gene Algorithms (SFGA), as one of the latest evolutionary algorithms (EAs) inspired from the Selfish Gene Theory which is an interpretation of Darwinian Theory ideas from the biologist Richards Dawkins on 1989. In this paper, following a brief introduction to the Selfish Gene Algorithm (SFGA), the chronology of its evolution is presented. It is the purpose of this paper is to present an overview of the concepts of Selfish Gene Algorithm (SFGA) as well as its opportunities and challenges. Accordingly, the history, step involves in the algorithm are discussed and its different applications together with an analysis of these applications are evaluated.
Solving Hub Network Problem Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Mursyid Hasan Basri
2012-01-01
non-linearity, so there is no guarantee to find the optimal solution. Moreover, it has generated a great number of variables. Therefore, a heuristic method is required to find near optimal solution with reasonable computation time. For this reason, a genetic algorithm (GA-based procedure is proposed. The proposed procedure then is applied to the same problem as discussed in the basic model. The results indicated that there is significant improvement on hub locations. Flows are successfully consolidated to several big ports as expected. With regards to spoke allocations, however, spokes are not fairly allocated.Keywords: Hub and Spoke Model; Marine Transportation; Genetic Algorithm
Global Optimization of a Periodic System using a Genetic Algorithm
Stucke, David; Crespi, Vincent
2001-03-01
We use a novel application of a genetic algorithm global optimizatin technique to find the lowest energy structures for periodic systems. We apply this technique to colloidal crystals for several different stoichiometries of binary and trinary colloidal crystals. This application of a genetic algorithm is decribed and results of likely candidate structures are presented.
Modeling of genetic algorithms with a finite population
C.H.M. van Kemenade
1997-01-01
textabstractCross-competition between non-overlapping building blocks can strongly influence the performance of evolutionary algorithms. The choice of the selection scheme can have a strong influence on the performance of a genetic algorithm. This paper describes a number of different genetic
Genetic algorithms applied to nuclear reactor design optimization
International Nuclear Information System (INIS)
Pereira, C.M.N.A.; Schirru, R.; Martinez, A.S.
2000-01-01
A genetic algorithm is a powerful search technique that simulates natural evolution in order to fit a population of computational structures to the solution of an optimization problem. This technique presents several advantages over classical ones such as linear programming based techniques, often used in nuclear engineering optimization problems. However, genetic algorithms demand some extra computational cost. Nowadays, due to the fast computers available, the use of genetic algorithms has increased and its practical application has become a reality. In nuclear engineering there are many difficult optimization problems related to nuclear reactor design. Genetic algorithm is a suitable technique to face such kind of problems. This chapter presents applications of genetic algorithms for nuclear reactor core design optimization. A genetic algorithm has been designed to optimize the nuclear reactor cell parameters, such as array pitch, isotopic enrichment, dimensions and cells materials. Some advantages of this genetic algorithm implementation over a classical method based on linear programming are revealed through the application of both techniques to a simple optimization problem. In order to emphasize the suitability of genetic algorithms for design optimization, the technique was successfully applied to a more complex problem, where the classical method is not suitable. Results and comments about the applications are also presented. (orig.)
A "Hands on" Strategy for Teaching Genetic Algorithms to Undergraduates
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…
Using Genetic Algorithms in Secured Business Intelligence Mobile Applications
Directory of Open Access Journals (Sweden)
Silvia TRIF
2011-01-01
Full Text Available The paper aims to assess the use of genetic algorithms for training neural networks used in secured Business Intelligence Mobile Applications. A comparison is made between classic back-propagation method and a genetic algorithm based training. The design of these algorithms is presented. A comparative study is realized for determining the better way of training neural networks, from the point of view of time and memory usage. The results show that genetic algorithms based training offer better performance and memory usage than back-propagation and they are fit to be implemented on mobile devices.
Approximation algorithms for a genetic diagnostics problem.
Kosaraju, S R; Schäffer, A A; Biesecker, L G
1998-01-01
We define and study a combinatorial problem called WEIGHTED DIAGNOSTIC COVER (WDC) that models the use of a laboratory technique called genotyping in the diagnosis of an important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making use of the well-known problem SET COVER for which the greedy heuristic has been extensively studied. We prove worst-case performance bounds on the greedy heuristic for WDC and for another heuristic we call directional greedy. We implemented both heuristics. We also implemented a local search heuristic that takes the solutions obtained by greedy and dir-greedy and applies swaps until they are locally optimal. We report their performance on a real data set that is representative of the options that a clinical geneticist faces for the real diagnostic problem. Many open problems related to WDC remain, both of theoretical interest and practical importance.
Multiobjective Genetic Algorithm applied to dengue control.
Florentino, Helenice O; Cantane, Daniela R; Santos, Fernando L P; Bannwart, Bettina F
2014-12-01
Dengue fever is an infectious disease caused by a virus of the Flaviridae family and transmitted to the person by a mosquito of the genus Aedes aegypti. This disease has been a global public health problem because a single mosquito can infect up to 300 people and between 50 and 100 million people are infected annually on all continents. Thus, dengue fever is currently a subject of research, whether in the search for vaccines and treatments for the disease or efficient and economical forms of mosquito control. The current study aims to study techniques of multiobjective optimization to assist in solving problems involving the control of the mosquito that transmits dengue fever. The population dynamics of the mosquito is studied in order to understand the epidemic phenomenon and suggest strategies of multiobjective programming for mosquito control. A Multiobjective Genetic Algorithm (MGA_DENGUE) is proposed to solve the optimization model treated here and we discuss the computational results obtained from the application of this technique. Copyright © 2014 Elsevier Inc. All rights reserved.
Genetic algorithm based separation cascade optimization
International Nuclear Information System (INIS)
Mahendra, A.K.; Sanyal, A.; Gouthaman, G.; Bera, T.K.
2008-01-01
The conventional separation cascade design procedure does not give an optimum design because of squaring-off, variation of flow rates and separation factor of the element with respect to stage location. Multi-component isotope separation further complicates the design procedure. Cascade design can be stated as a constrained multi-objective optimization. Cascade's expectation from the separating element is multi-objective i.e. overall separation factor, cut, optimum feed and separative power. Decision maker may aspire for more comprehensive multi-objective goals where optimization of cascade is coupled with the exploration of separating element optimization vector space. In real life there are many issues which make it important to understand the decision maker's perception of cost-quality-speed trade-off and consistency of preferences. Genetic algorithm (GA) is one such evolutionary technique that can be used for cascade design optimization. This paper addresses various issues involved in the GA based multi-objective optimization of the separation cascade. Reference point based optimization methodology with GA based Pareto optimality concept for separation cascade was found pragmatic and promising. This method should be explored, tested, examined and further developed for binary as well as multi-component separations. (author)
Hydro Power Reservoir Aggregation via Genetic Algorithms
Directory of Open Access Journals (Sweden)
Markus Löschenbrand
2017-12-01
Full Text Available Electrical power systems with a high share of hydro power in their generation portfolio tend to display distinct behavior. Low generation cost and the possibility of peak shaving create a high amount of flexibility. However, stochastic influences such as precipitation and external market effects create uncertainty and thus establish a wide range of potential outcomes. Therefore, optimal generation scheduling is a key factor to successful operation of hydro power dominated systems. This paper aims to bridge the gap between scheduling on large-scale (e.g., national and small scale (e.g., a single river basin levels, by applying a multi-objective master/sub-problem framework supported by genetic algorithms. A real-life case study from southern Norway is used to assess the validity of the method and give a proof of concept. The introduced method can be applied to efficiently integrate complex stochastic sub-models into Virtual Power Plants and thus reduce the computational complexity of large-scale models whilst minimizing the loss of information.
Advanced optimization of permanent magnet wigglers using a genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Hajima, Ryoichi [Univ. of Tokyo (Japan)
1995-12-31
In permanent magnet wigglers, magnetic imperfection of each magnet piece causes field error. This field error can be reduced or compensated by sorting magnet pieces in proper order. We showed a genetic algorithm has good property for this sorting scheme. In this paper, this optimization scheme is applied to the case of permanent magnets which have errors in the direction of field. The result shows the genetic algorithm is superior to other algorithms.
Advanced optimization of permanent magnet wigglers using a genetic algorithm
International Nuclear Information System (INIS)
Hajima, Ryoichi
1995-01-01
In permanent magnet wigglers, magnetic imperfection of each magnet piece causes field error. This field error can be reduced or compensated by sorting magnet pieces in proper order. We showed a genetic algorithm has good property for this sorting scheme. In this paper, this optimization scheme is applied to the case of permanent magnets which have errors in the direction of field. The result shows the genetic algorithm is superior to other algorithms
Applicability of genetic algorithms to parameter estimation of economic models
Directory of Open Access Journals (Sweden)
Marcel Ševela
2004-01-01
Full Text Available The paper concentrates on capability of genetic algorithms for parameter estimation of non-linear economic models. In the paper we test the ability of genetic algorithms to estimate of parameters of demand function for durable goods and simultaneously search for parameters of genetic algorithm that lead to maximum effectiveness of the computation algorithm. The genetic algorithms connect deterministic iterative computation methods with stochastic methods. In the genteic aůgorithm approach each possible solution is represented by one individual, those life and lifes of all generations of individuals run under a few parameter of genetic algorithm. Our simulations resulted in optimal mutation rate of 15% of all bits in chromosomes, optimal elitism rate 20%. We can not set the optimal extend of generation, because it proves positive correlation with effectiveness of genetic algorithm in all range under research, but its impact is degreasing. The used genetic algorithm was sensitive to mutation rate at most, than to extend of generation. The sensitivity to elitism rate is not so strong.
Experimental Results of Novel DoA Estimation Algorithms for Compact Reconfigurable Antennas
Directory of Open Access Journals (Sweden)
Henna Paaso
2017-01-01
Full Text Available Reconfigurable antenna systems have gained much attention for potential use in the next generation wireless systems. However, conventional direction-of-arrival (DoA estimation algorithms for antenna arrays cannot be used directly in reconfigurable antennas due to different design of the antennas. In this paper, we present an adjacent pattern power ratio (APPR algorithm for two-port composite right/left-handed (CRLH reconfigurable leaky-wave antennas (LWAs. Additionally, we compare the performances of the APPR algorithm and LWA-based MUSIC algorithms. We study how the computational complexity and the performance of the algorithms depend on number of selected radiation patterns. In addition, we evaluate the performance of the APPR and MUSIC algorithms with numerical simulations as well as with real world indoor measurements having both line-of-sight and non-line-of-sight components. Our performance evaluations show that the DoA estimates are in a considerably good agreement with the real DoAs, especially with the APPR algorithm. In summary, the APPR and MUSIC algorithms for DoA estimation along with the planar and compact LWA layout can be a valuable solution to enhance the performance of the wireless communication in the next generation systems.
A genetic algorithm for solving supply chain network design model
Firoozi, Z.; Ismail, N.; Ariafar, S. H.; Tang, S. H.; Ariffin, M. K. M. A.
2013-09-01
Network design is by nature costly and optimization models play significant role in reducing the unnecessary cost components of a distribution network. This study proposes a genetic algorithm to solve a distribution network design model. The structure of the chromosome in the proposed algorithm is defined in a novel way that in addition to producing feasible solutions, it also reduces the computational complexity of the algorithm. Computational results are presented to show the algorithm performance.
Absolute GPS Positioning Using Genetic Algorithms
Ramillien, G.
A new inverse approach for restoring the absolute coordinates of a ground -based station from three or four observed GPS pseudo-ranges is proposed. This stochastic method is based on simulations of natural evolution named genetic algorithms (GA). These iterative procedures provide fairly good and robust estimates of the absolute positions in the Earth's geocentric reference system. For comparison/validation, GA results are compared to the ones obtained using the classical linearized least-square scheme for the determination of the XYZ location proposed by Bancroft (1985) which is strongly limited by the number of available observations (i.e. here, the number of input pseudo-ranges must be four). The r.m.s. accuracy of the non -linear cost function reached by this latter method is typically ~10-4 m2 corresponding to ~300-500-m accuracies for each geocentric coordinate. However, GA can provide more acceptable solutions (r.m.s. errors < 10-5 m2), even when only three instantaneous pseudo-ranges are used, such as a lost of lock during a GPS survey. Tuned GA parameters used in different simulations are N=1000 starting individuals, as well as Pc=60-70% and Pm=30-40% for the crossover probability and mutation rate, respectively. Statistical tests on the ability of GA to recover acceptable coordinates in presence of important levels of noise are made simulating nearly 3000 random samples of erroneous pseudo-ranges. Here, two main sources of measurement errors are considered in the inversion: (1) typical satellite-clock errors and/or 300-metre variance atmospheric delays, and (2) Geometrical Dilution of Precision (GDOP) due to the particular GPS satellite configuration at the time of acquisition. Extracting valuable information and even from low-quality starting range observations, GA offer an interesting alternative for high -precision GPS positioning.
Optimization of Pressurizer Based on Genetic-Simplex Algorithm
International Nuclear Information System (INIS)
Wang, Cheng; Yan, Chang Qi; Wang, Jian Jun
2014-01-01
Pressurizer is one of key components in nuclear power system. It's important to control the dimension in the design of pressurizer through optimization techniques. In this work, a mathematic model of a vertical electric heating pressurizer was established. A new Genetic-Simplex Algorithm (GSA) that combines genetic algorithm and simplex algorithm was developed to enhance the searching ability, and the comparison among modified and original algorithms is conducted by calculating the benchmark function. Furthermore, the optimization design of pressurizer, taking minimization of volume and net weight as objectives, was carried out considering thermal-hydraulic and geometric constraints through GSA. The results indicate that the mathematical model is agreeable for the pressurizer and the new algorithm is more effective than the traditional genetic algorithm. The optimization design shows obvious validity and can provide guidance for real engineering design
A Parallel Compact Multi-Dimensional Numerical Algorithm with Aeroacoustics Applications
Povitsky, Alex; Morris, Philip J.
1999-01-01
In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs (Partial Differential Equations) in a space-time domain. For this numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm. In a straightforward pipelined implementation of the Thomas algorithm processors are idle due to the forward and backward recurrences of the Thomas algorithm. To utilize processors during this time, we propose to use them for either non-local data independent computations, solving lines in the next spatial direction, or local data-dependent computations by the Runge-Kutta method. To achieve this goal, control of processor communication and computations by a static schedule is adopted. Thus, our parallel code is driven by a communication and computation schedule instead of the usual "creative, programming" approach. The obtained parallelization speed-up of the novel algorithm is about twice as much as that for the standard pipelined algorithm and close to that for the explicit DRP algorithm.
Genetic Algorithm Based Economic Dispatch with Valve Point Effect
Energy Technology Data Exchange (ETDEWEB)
Park, Jong Nam; Park, Kyung Won; Kim, Ji Hong; Kim, Jin O [Hanyang University (Korea, Republic of)
1999-03-01
This paper presents a new approach on genetic algorithm to economic dispatch problem for valve point discontinuities. Proposed approach in this paper on genetic algorithms improves the performance to solve economic dispatch problem for valve point discontinuities through improved death penalty method, generation-apart elitism, atavism and sexual selection with sexual distinction. Numerical results on a test system consisting of 13 thermal units show that the proposed approach is faster, more robust and powerful than conventional genetic algorithms. (author). 8 refs., 10 figs.
Application of genetic algorithms for parameter estimation in liquid chromatography
International Nuclear Information System (INIS)
Hernandez Torres, Reynier; Irizar Mesa, Mirtha; Tavares Camara, Leoncio Diogenes
2012-01-01
In chromatography, complex inverse problems related to the parameters estimation and process optimization are presented. Metaheuristics methods are known as general purpose approximated algorithms which seek and hopefully find good solutions at a reasonable computational cost. These methods are iterative process to perform a robust search of a solution space. Genetic algorithms are optimization techniques based on the principles of genetics and natural selection. They have demonstrated very good performance as global optimizers in many types of applications, including inverse problems. In this work, the effectiveness of genetic algorithms is investigated to estimate parameters in liquid chromatography
Research and Applications of Shop Scheduling Based on Genetic Algorithms
Directory of Open Access Journals (Sweden)
Hang ZHAO
Full Text Available ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence.
International Nuclear Information System (INIS)
Kudryashova, N.Yu.; Groshev, V.V.; Shestakov, S.V.
1984-01-01
X-irradiation of Micrococcus radiodurans cells with sublethal doses caused disturbances in the structure of a membrane-bound compact chromosome. Recovery of the compact chromosome occurred during the postirradiation incubation of the wild type cells and cells of the UVS-17 mutant deficient in DNA-polymerase. This process was blocked in cells of rec-30 mutant with the impaired system of genetic recombination: this is indicative of an important role played by rec-30 gene product in the postirradiation recovery of the compact chromosome in M. radiodurans cells
Robust reactor power control system design by genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Lee, Yoon Joon; Cho, Kyung Ho; Kim, Sin [Cheju National University, Cheju (Korea, Republic of)
1997-12-31
The H{sub {infinity}} robust controller for the reactor power control system is designed by use of the mixed weight sensitivity. The system is configured into the typical two-port model with which the weight functions are augmented. Since the solution depends on the weighting functions and the problem is of nonconvex, the genetic algorithm is used to determine the weighting functions. The cost function applied in the genetic algorithm permits the direct control of the power tracking performances. In addition, the actual operating constraints such as rod velocity and acceleration can be treated as design parameters. Compared with the conventional approach, the controller designed by the genetic algorithm results in the better performances with the realistic constraints. Also, it is found that the genetic algorithm could be used as an effective tool in the robust design. 4 refs., 6 figs. (Author)
Robust reactor power control system design by genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Lee, Yoon Joon; Cho, Kyung Ho; Kim, Sin [Cheju National University, Cheju (Korea, Republic of)
1998-12-31
The H{sub {infinity}} robust controller for the reactor power control system is designed by use of the mixed weight sensitivity. The system is configured into the typical two-port model with which the weight functions are augmented. Since the solution depends on the weighting functions and the problem is of nonconvex, the genetic algorithm is used to determine the weighting functions. The cost function applied in the genetic algorithm permits the direct control of the power tracking performances. In addition, the actual operating constraints such as rod velocity and acceleration can be treated as design parameters. Compared with the conventional approach, the controller designed by the genetic algorithm results in the better performances with the realistic constraints. Also, it is found that the genetic algorithm could be used as an effective tool in the robust design. 4 refs., 6 figs. (Author)
Genetic Algorithms Evolve Optimized Transforms for Signal Processing Applications
National Research Council Canada - National Science Library
Moore, Frank; Babb, Brendan; Becke, Steven; Koyuk, Heather; Lamson, Earl, III; Wedge, Christopher
2005-01-01
.... The primary goal of the research described in this final report was to establish a methodology for using genetic algorithms to evolve coefficient sets describing inverse transforms and matched...
Use of genetic algorithms for high hydrostatic pressure inactivation ...
African Journals Online (AJOL)
) for high hydrostatic pressure (HHP) inactivation of Bacillus cereus spores, Bacillus subtilis spores and cells, Staphylococcus aureus and Listeria monocytogenes, all in milk buffer, were used to demonstrate the utility of genetic algorithms ...
Mission Planning for Unmanned Aircraft with Genetic Algorithms
DEFF Research Database (Denmark)
Hansen, Karl Damkjær
unmanned aircraft are used for aerial surveying of the crops. The farmer takes the role of the analyst above, who does not necessarily have any specific interest in remote controlled aircraft but needs the outcome of the survey. The recurring method in the study is the genetic algorithm; a flexible...... contributions are made in the area of the genetic algorithms. One is a method to decide on the right time to stop the computation of the plan, when the right balance is stricken between using the time planning and using the time flying. The other contribution is a characterization of the evolutionary operators...... used in the genetic algorithm. The result is a measure based on entropy to evaluate and control the diversity of the population of the genetic algorithm, which is an important factor its effectiveness....
PM Synchronous Motor Dynamic Modeling with Genetic Algorithm ...
African Journals Online (AJOL)
Adel
This paper proposes dynamic modeling simulation for ac Surface Permanent Magnet Synchronous ... Simulations are implemented using MATLAB with its genetic algorithm toolbox. .... selection, the process that drives biological evolution.
Design Optimization of Space Launch Vehicles Using a Genetic Algorithm
National Research Council Canada - National Science Library
Bayley, Douglas J
2007-01-01
.... A genetic algorithm (GA) was employed to optimize the design of the space launch vehicle. A cost model was incorporated into the optimization process with the goal of minimizing the overall vehicle cost...
Cloud Computing Task Scheduling Based on Cultural Genetic Algorithm
Directory of Open Access Journals (Sweden)
Li Jian-Wen
2016-01-01
Full Text Available The task scheduling strategy based on cultural genetic algorithm(CGA is proposed in order to improve the efficiency of task scheduling in the cloud computing platform, which targets at minimizing the total time and cost of task scheduling. The improved genetic algorithm is used to construct the main population space and knowledge space under cultural framework which get independent parallel evolution, forming a mechanism of mutual promotion to dispatch the cloud task. Simultaneously, in order to prevent the defects of the genetic algorithm which is easy to fall into local optimum, the non-uniform mutation operator is introduced to improve the search performance of the algorithm. The experimental results show that CGA reduces the total time and lowers the cost of the scheduling, which is an effective algorithm for the cloud task scheduling.
Machine Learning in Production Systems Design Using Genetic Algorithms
Abu Qudeiri Jaber; Yamamoto Hidehiko Rizauddin Ramli
2008-01-01
To create a solution for a specific problem in machine learning, the solution is constructed from the data or by use a search method. Genetic algorithms are a model of machine learning that can be used to find nearest optimal solution. While the great advantage of genetic algorithms is the fact that they find a solution through evolution, this is also the biggest disadvantage. Evolution is inductive, in nature life does not evolve towards a good solution but it evolves aw...
Genetic Algorithm Optimized Neural Networks Ensemble as ...
African Journals Online (AJOL)
Marquardt algorithm by varying conditions such as inputs, hidden neurons, initialization, training sets and random Gaussian noise injection to ... Several such ensembles formed the population which was evolved to generate the fittest ensemble.
Fuzzy Information Retrieval Using Genetic Algorithms and Relevance Feedback.
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…
Evolving aerodynamic airfoils for wind turbines through a genetic algorithm
Hernández, J. J.; Gómez, E.; Grageda, J. I.; Couder, C.; Solís, A.; Hanotel, C. L.; Ledesma, JI
2017-01-01
Nowadays, genetic algorithms stand out for airfoil optimisation, due to the virtues of mutation and crossing-over techniques. In this work we propose a genetic algorithm with arithmetic crossover rules. The optimisation criteria are taken to be the maximisation of both aerodynamic efficiency and lift coefficient, while minimising drag coefficient. Such algorithm shows greatly improvements in computational costs, as well as a high performance by obtaining optimised airfoils for Mexico City's specific wind conditions from generic wind turbines designed for higher Reynolds numbers, in few iterations.
Reactor controller design using genetic algorithms with simulated annealing
International Nuclear Information System (INIS)
Erkan, K.; Buetuen, E.
2000-01-01
This chapter presents a digital control system for ITU TRIGA Mark-II reactor using genetic algorithms with simulated annealing. The basic principles of genetic algorithms for problem solving are inspired by the mechanism of natural selection. Natural selection is a biological process in which stronger individuals are likely to be winners in a competing environment. Genetic algorithms use a direct analogy of natural evolution. Genetic algorithms are global search techniques for optimisation but they are poor at hill-climbing. Simulated annealing has the ability of probabilistic hill-climbing. Thus, the two techniques are combined here to get a fine-tuned algorithm that yields a faster convergence and a more accurate search by introducing a new mutation operator like simulated annealing or an adaptive cooling schedule. In control system design, there are currently no systematic approaches to choose the controller parameters to obtain the desired performance. The controller parameters are usually determined by test and error with simulation and experimental analysis. Genetic algorithm is used automatically and efficiently searching for a set of controller parameters for better performance. (orig.)
A Hybrid Genetic Algorithm Approach for Optimal Power Flow
Directory of Open Access Journals (Sweden)
Sydulu Maheswarapu
2011-08-01
Full Text Available This paper puts forward a reformed hybrid genetic algorithm (GA based approach to the optimal power flow. In the approach followed here, continuous variables are designed using real-coded GA and discrete variables are processed as binary strings. The outcomes are compared with many other methods like simple genetic algorithm (GA, adaptive genetic algorithm (AGA, differential evolution (DE, particle swarm optimization (PSO and music based harmony search (MBHS on a IEEE30 bus test bed, with a total load of 283.4 MW. Its found that the proposed algorithm is found to offer lowest fuel cost. The proposed method is found to be computationally faster, robust, superior and promising form its convergence characteristics.
Machine Learning Algorithms For Predicting the Instability Timescales of Compact Planetary Systems
Tamayo, Daniel; Ali-Dib, Mohamad; Cloutier, Ryan; Huang, Chelsea; Van Laerhoven, Christa L.; Leblanc, Rejean; Menou, Kristen; Murray, Norman; Obertas, Alysa; Paradise, Adiv; Petrovich, Cristobal; Rachkov, Aleksandar; Rein, Hanno; Silburt, Ari; Tacik, Nick; Valencia, Diana
2016-10-01
The Kepler mission has uncovered hundreds of compact multi-planet systems. The dynamical pathways to instability in these compact systems and their associated timescales are not well understood theoretically. However, long-term stability is often used as a constraint to narrow down the space of orbital solutions from the transit data. This requires a large suite of N-body integrations that can each take several weeks to complete. This computational bottleneck is therefore an important limitation in our ability to characterize compact multi-planet systems.From suites of numerical simulations, previous studies have fit simple scaling relations between the instability timescale and various system parameters. However, the numerically simulated systems can deviate strongly from these empirical fits.We present a new approach to the problem using machine learning algorithms that have enjoyed success across a broad range of high-dimensional industry applications. In particular, we have generated large training sets of direct N-body integrations of synthetic compact planetary systems to train several regression models (support vector machine, gradient boost) that predict the instability timescale. We find that ensembling these models predicts the instability timescale of planetary systems better than previous approaches using the simple scaling relations mentioned above.Finally, we will discuss how these models provide a powerful tool for not only understanding the current Kepler multi-planet sample, but also for characterizing and shaping the radial-velocity follow-up strategies of multi-planet systems from the upcoming Transiting Exoplanet Survey Satellite (TESS) mission, given its shorter observation baselines.
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
DEFF Research Database (Denmark)
Pedersen, Gerulf; Goldberg, David E.
2004-01-01
Before Multiobjective Evolutionary Algorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further investigation. One of these issues is how a uniform distribution of solutions along the Pareto non-dominated front c...
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
DEFF Research Database (Denmark)
Pedersen, Gerulf; Goldberg, D.E.
2004-01-01
Before Multiobjective Evolutionary Algorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further investigation. One of these issues is how a uniform distribution of solutions along the Pareto non-dominated front can...
Energy Technology Data Exchange (ETDEWEB)
Yoo, Hyun Jun [Div. of Radiation Regulation, Korea Institute of Nuclear Safety, Daejeon (Korea, Republic of); Kim, Ye Won; Kim, Hyun Duk; Cho, Gyu Seong [Dept. of Nuclear and Quantum Engineering, Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of); Yi, Yun [Dept. of of Electronics and Information Engineering, Korea University, Seoul (Korea, Republic of)
2017-06-15
A gamma energy identifying algorithm using spectral decomposition combined with smoothing method was suggested to confirm the existence of the artificial radio isotopes. The algorithm is composed by original pattern recognition method and smoothing method to enhance the performance to identify gamma energy of radiation sensors that have low energy resolution. The gamma energy identifying algorithm for the compact radiation sensor is a three-step of refinement process. Firstly, the magnitude set is calculated by the original spectral decomposition. Secondly, the magnitude of modeling error in the magnitude set is reduced by the smoothing method. Thirdly, the expected gamma energy is finally decided based on the enhanced magnitude set as a result of the spectral decomposition with the smoothing method. The algorithm was optimized for the designed radiation sensor composed of a CsI (Tl) scintillator and a silicon pin diode. The two performance parameters used to estimate the algorithm are the accuracy of expected gamma energy and the number of repeated calculations. The original gamma energy was accurately identified with the single energy of gamma radiation by adapting this modeling error reduction method. Also the average error decreased by half with the multi energies of gamma radiation in comparison to the original spectral decomposition. In addition, the number of repeated calculations also decreased by half even in low fluence conditions under 104 (/0.09 cm{sup 2} of the scintillator surface). Through the development of this algorithm, we have confirmed the possibility of developing a product that can identify artificial radionuclides nearby using inexpensive radiation sensors that are easy to use by the public. Therefore, it can contribute to reduce the anxiety of the public exposure by determining the presence of artificial radionuclides in the vicinity.
Quantum algorithms and the genetic code
Indian Academy of Sciences (India)
the process of replication. One generation of organisms produces the next generation, which is essentially a copy of itself. The self-similarity is maintained by the hereditary information—the genetic code—that is passed on from one generation to the next. The long chains of DNA molecules residing in the nuclei of the cells ...
An Enhanced Genetic Algorithm for the Generalized Traveling Salesman Problem
Directory of Open Access Journals (Sweden)
H. Jafarzadeh
2017-12-01
Full Text Available The generalized traveling salesman problem (GTSP deals with finding the minimum-cost tour in a clustered set of cities. In this problem, the traveler is interested in finding the best path that goes through all clusters. As this problem is NP-hard, implementing a metaheuristic algorithm to solve the large scale problems is inevitable. The performance of these algorithms can be intensively promoted by other heuristic algorithms. In this study, a search method is developed that improves the quality of the solutions and competition time considerably in comparison with Genetic Algorithm. In the proposed algorithm, the genetic algorithms with the Nearest Neighbor Search (NNS are combined and a heuristic mutation operator is applied. According to the experimental results on a set of standard test problems with symmetric distances, the proposed algorithm finds the best solutions in most cases with the least computational time. The proposed algorithm is highly competitive with the published until now algorithms in both solution quality and running time.
Evacuation route planning during nuclear emergency using genetic algorithm
International Nuclear Information System (INIS)
Suman, Vitisha; Sarkar, P.K.
2012-01-01
In nuclear industry the routing in case of any emergency is a cause of concern and of great importance. Even the smallest of time saved in the affected region saves a huge amount of otherwise received dose. Genetic algorithm an optimization technique has great ability to search for the optimal path from the affected region to a destination station in a spatially addressed problem. Usually heuristic algorithms are used to carry out these types of search strategy, but due to the lack of global sampling in the feasible solution space, these algorithms have considerable possibility of being trapped into local optima. Routing problems mainly are search problems for finding the shortest distance within a time limit to cover the required number of stations taking care of the traffics, road quality, population size etc. Lack of any formal mechanisms to help decision-makers explore the solution space of their problem and thereby challenges their assumptions about the number and range of options available. The Genetic Algorithm provides a way to optimize a multi-parameter constrained problem with an ease. Here use of Genetic Algorithm to generate a range of options available and to search a solution space and selectively focus on promising combinations of criteria makes them ideally suited to such complex spatial decision problems. The emergency response and routing can be made efficient, in accessing the closest facilities and determining the shortest route using genetic algorithm. The accuracy and care in creating database can be used to improve the result of the final output. The Genetic algorithm can be used to improve the accuracy of result on the basis of distance where other algorithm cannot be obtained. The search space can be utilized to its great extend
Pose estimation for augmented reality applications using genetic algorithm.
Yu, Ying Kin; Wong, Kin Hong; Chang, Michael Ming Yuen
2005-12-01
This paper describes a genetic algorithm that tackles the pose-estimation problem in computer vision. Our genetic algorithm can find the rotation and translation of an object accurately when the three-dimensional structure of the object is given. In our implementation, each chromosome encodes both the pose and the indexes to the selected point features of the object. Instead of only searching for the pose as in the existing work, our algorithm, at the same time, searches for a set containing the most reliable feature points in the process. This mismatch filtering strategy successfully makes the algorithm more robust under the presence of point mismatches and outliers in the images. Our algorithm has been tested with both synthetic and real data with good results. The accuracy of the recovered pose is compared to the existing algorithms. Our approach outperformed the Lowe's method and the other two genetic algorithms under the presence of point mismatches and outliers. In addition, it has been used to estimate the pose of a real object. It is shown that the proposed method is applicable to augmented reality applications.
Vorozheikin, A.; Gonchar, T.; Panfilov, I.; Sopov, E.; Sopov, S.
2009-01-01
A new algorithm for the solution of complex constrained optimization problems based on the probabilistic genetic algorithm with optimal solution prediction is proposed. The efficiency investigation results in comparison with standard genetic algorithm are presented.
Genetic algorithm approach to thin film optical parameters determination
International Nuclear Information System (INIS)
Jurecka, S.; Jureckova, M.; Muellerova, J.
2003-01-01
Optical parameters of thin film are important for several optical and optoelectronic applications. In this work the genetic algorithm proposed to solve optical parameters of thin film values. The experimental reflectance is modelled by the Forouhi - Bloomer dispersion relations. The refractive index, the extinction coefficient and the film thickness are the unknown parameters in this model. Genetic algorithm use probabilistic examination of promissing areas of the parameter space. It creates a population of solutions based on the reflectance model and then operates on the population to evolve the best solution by using selection, crossover and mutation operators on the population individuals. The implementation of genetic algorithm method and the experimental results are described too (Authors)
Public Transport Route Finding using a Hybrid Genetic Algorithm
Liviu Adrian COTFAS; Andreea DIOSTEANU
2011-01-01
In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.
Public Transport Route Finding using a Hybrid Genetic Algorithm
Directory of Open Access Journals (Sweden)
Liviu Adrian COTFAS
2011-01-01
Full Text Available In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.
Algorithmic Trading with Developmental and Linear Genetic Programming
Wilson, Garnett; Banzhaf, Wolfgang
A developmental co-evolutionary genetic programming approach (PAM DGP) and a standard linear genetic programming (LGP) stock trading systemare applied to a number of stocks across market sectors. Both GP techniques were found to be robust to market fluctuations and reactive to opportunities associated with stock price rise and fall, with PAMDGP generating notably greater profit in some stock trend scenarios. Both algorithms were very accurate at buying to achieve profit and selling to protect assets, while exhibiting bothmoderate trading activity and the ability to maximize or minimize investment as appropriate. The content of the trading rules produced by both algorithms are also examined in relation to stock price trend scenarios.
Application of genetic algorithm in radio ecological models parameter determination
Energy Technology Data Exchange (ETDEWEB)
Pantelic, G. [Institute of Occupatioanl Health and Radiological Protection ' Dr Dragomir Karajovic' , Belgrade (Serbia)
2006-07-01
The method of genetic algorithms was used to determine the biological half-life of 137 Cs in cow milk after the accident in Chernobyl. Methodologically genetic algorithms are based on the fact that natural processes tend to optimize themselves and therefore this method should be more efficient in providing optimal solutions in the modeling of radio ecological and environmental events. The calculated biological half-life of 137 Cs in milk is (32 {+-} 3) days and transfer coefficient from grass to milk is (0.019 {+-} 0.005). (authors)
Time-Delay System Identification Using Genetic Algorithm
DEFF Research Database (Denmark)
Yang, Zhenyu; Seested, Glen Thane
2013-01-01
Due to the unknown dead-time coefficient, the time-delay system identification turns to be a non-convex optimization problem. This paper investigates the identification of a simple time-delay system, named First-Order-Plus-Dead-Time (FOPDT), by using the Genetic Algorithm (GA) technique. The qual......Due to the unknown dead-time coefficient, the time-delay system identification turns to be a non-convex optimization problem. This paper investigates the identification of a simple time-delay system, named First-Order-Plus-Dead-Time (FOPDT), by using the Genetic Algorithm (GA) technique...
Applying genetic algorithms for programming manufactoring cell tasks
Directory of Open Access Journals (Sweden)
Efredy Delgado
2005-05-01
Full Text Available This work was aimed for developing computational intelligence for scheduling a manufacturing cell's tasks, based manily on genetic algorithms. The manufacturing cell was modelled as beign a production-line; the makespan was calculated by using heuristics adapted from several libraries for genetic algorithms computed in C++ builder. Several problems dealing with small, medium and large list of jobs and machinery were resolved. The results were compared with other heuristics. The approach developed here would seem to be promising for future research concerning scheduling manufacturing cell tasks involving mixed batches.
Optimization of multicast optical networks with genetic algorithm
Lv, Bo; Mao, Xiangqiao; Zhang, Feng; Qin, Xi; Lu, Dan; Chen, Ming; Chen, Yong; Cao, Jihong; Jian, Shuisheng
2007-11-01
In this letter, aiming to obtain the best multicast performance of optical network in which the video conference information is carried by specified wavelength, we extend the solutions of matrix games with the network coding theory and devise a new method to solve the complex problems of multicast network switching. In addition, an experimental optical network has been testified with best switching strategies by employing the novel numerical solution designed with an effective way of genetic algorithm. The result shows that optimal solutions with genetic algorithm are accordance with the ones with the traditional fictitious play method.
Real coded genetic algorithm for fuzzy time series prediction
Jain, Shilpa; Bisht, Dinesh C. S.; Singh, Phool; Mathpal, Prakash C.
2017-10-01
Genetic Algorithm (GA) forms a subset of evolutionary computing, rapidly growing area of Artificial Intelligence (A.I.). Some variants of GA are binary GA, real GA, messy GA, micro GA, saw tooth GA, differential evolution GA. This research article presents a real coded GA for predicting enrollments of University of Alabama. Data of Alabama University is a fuzzy time series. Here, fuzzy logic is used to predict enrollments of Alabama University and genetic algorithm optimizes fuzzy intervals. Results are compared to other eminent author works and found satisfactory, and states that real coded GA are fast and accurate.
Application of genetic algorithm in radio ecological models parameter determination
International Nuclear Information System (INIS)
Pantelic, G.
2006-01-01
The method of genetic algorithms was used to determine the biological half-life of 137 Cs in cow milk after the accident in Chernobyl. Methodologically genetic algorithms are based on the fact that natural processes tend to optimize themselves and therefore this method should be more efficient in providing optimal solutions in the modeling of radio ecological and environmental events. The calculated biological half-life of 137 Cs in milk is (32 ± 3) days and transfer coefficient from grass to milk is (0.019 ± 0.005). (authors)
Naturally selecting solutions: the use of genetic algorithms in bioinformatics.
Manning, Timmy; Sleator, Roy D; Walsh, Paul
2013-01-01
For decades, computer scientists have looked to nature for biologically inspired solutions to computational problems; ranging from robotic control to scheduling optimization. Paradoxically, as we move deeper into the post-genomics era, the reverse is occurring, as biologists and bioinformaticians look to computational techniques, to solve a variety of biological problems. One of the most common biologically inspired techniques are genetic algorithms (GAs), which take the Darwinian concept of natural selection as the driving force behind systems for solving real world problems, including those in the bioinformatics domain. Herein, we provide an overview of genetic algorithms and survey some of the most recent applications of this approach to bioinformatics based problems.
Particle swarm optimization - Genetic algorithm (PSOGA) on linear transportation problem
Rahmalia, Dinita
2017-08-01
Linear Transportation Problem (LTP) is the case of constrained optimization where we want to minimize cost subject to the balance of the number of supply and the number of demand. The exact method such as northwest corner, vogel, russel, minimal cost have been applied at approaching optimal solution. In this paper, we use heurisitic like Particle Swarm Optimization (PSO) for solving linear transportation problem at any size of decision variable. In addition, we combine mutation operator of Genetic Algorithm (GA) at PSO to improve optimal solution. This method is called Particle Swarm Optimization - Genetic Algorithm (PSOGA). The simulations show that PSOGA can improve optimal solution resulted by PSO.
Air data system optimization using a genetic algorithm
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.
Parameter determination for quantitative PIXE analysis using genetic algorithms
International Nuclear Information System (INIS)
Aspiazu, J.; Belmont-Moreno, E.
1996-01-01
For biological and environmental samples, PIXE technique is in particular advantage for elemental analysis, but the quantitative analysis implies accomplishing complex calculations that require the knowledge of more than a dozen parameters. Using a genetic algorithm, the authors give here an account of the procedure to obtain the best values for the parameters necessary to fit the efficiency for a X-ray detector. The values for some variables involved in quantitative PIXE analysis, were manipulated in a similar way as the genetic information is treated in a biological process. The authors carried out the algorithm until they reproduce, within the confidence interval, the elemental concentrations corresponding to a reference material
GenClust: A genetic algorithm for clustering gene expression data
Directory of Open Access Journals (Sweden)
Raimondi Alessandra
2005-12-01
Full Text Available Abstract Background Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designed and validated for the task. Despite the widespread use of artificial intelligence techniques in bioinformatics and, more generally, data analysis, there are very few clustering algorithms based on the genetic paradigm, yet that paradigm has great potential in finding good heuristic solutions to a difficult optimization problem such as clustering. Results GenClust is a new genetic algorithm for clustering gene expression data. It has two key features: (a a novel coding of the search space that is simple, compact and easy to update; (b it can be used naturally in conjunction with data driven internal validation methods. We have experimented with the FOM methodology, specifically conceived for validating clusters of gene expression data. The validity of GenClust has been assessed experimentally on real data sets, both with the use of validation measures and in comparison with other algorithms, i.e., Average Link, Cast, Click and K-means. Conclusion Experiments show that none of the algorithms we have used is markedly superior to the others across data sets and validation measures; i.e., in many cases the observed differences between the worst and best performing algorithm may be statistically insignificant and they could be considered equivalent. However, there are cases in which an algorithm may be better than others and therefore worthwhile. In particular, experiments for GenClust show that, although simple in its data representation, it converges very rapidly to a local optimum and that its ability to identify meaningful clusters is comparable, and sometimes superior, to that of more sophisticated algorithms. In addition, it is well suited for use in conjunction with data driven internal validation measures and, in particular, the FOM methodology.
Stochastic search in structural optimization - Genetic algorithms and simulated annealing
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.
Genetic algorithm for chromaticity correction in diffraction limited storage rings
Directory of Open Access Journals (Sweden)
M. P. Ehrlichman
2016-04-01
Full Text Available A multiobjective genetic algorithm is developed for optimizing nonlinearities in diffraction limited storage rings. This algorithm determines sextupole and octupole strengths for chromaticity correction that deliver optimized dynamic aperture and beam lifetime. The algorithm makes use of dominance constraints to breed desirable properties into the early generations. The momentum aperture is optimized indirectly by constraining the chromatic tune footprint and optimizing the off-energy dynamic aperture. The result is an effective and computationally efficient technique for correcting chromaticity in a storage ring while maintaining optimal dynamic aperture and beam lifetime.
A Genetic Algorithm on Inventory Routing Problem
Directory of Open Access Journals (Sweden)
Nevin Aydın
2014-03-01
Full Text Available Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.
An Adaptive Filtering Algorithm Based on Genetic Algorithm-Backpropagation Network
Directory of Open Access Journals (Sweden)
Kai Hu
2013-01-01
Full Text Available A new image filtering algorithm is proposed. GA-BPN algorithm uses genetic algorithm (GA to decide weights in a back propagation neural network (BPN. It has better global optimal characteristics than traditional optimal algorithm. In this paper, we used GA-BPN to do image noise filter researching work. Firstly, this paper uses training samples to train GA-BPN as the noise detector. Then, we utilize the well-trained GA-BPN to recognize noise pixels in target image. And at last, an adaptive weighted average algorithm is used to recover noise pixels recognized by GA-BPN. Experiment data shows that this algorithm has better performance than other filters.
The multi-niche crowding genetic algorithm: Analysis and applications
Energy Technology Data Exchange (ETDEWEB)
Cedeno, Walter [Univ. of California, Davis, CA (United States)
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.
Optimization of phononic filters via genetic algorithms
Energy Technology Data Exchange (ETDEWEB)
Hussein, M I [University of Colorado, Department of Aerospace Engineering Sciences, Boulder, Colorado 80309-0429 (United States); El-Beltagy, M A [Cairo University, Faculty of Computers and Information, 5 Dr. Ahmed Zewail Street, 12613 Giza (Egypt)
2007-12-15
A phononic crystal is commonly characterized by its dispersive frequency spectrum. With appropriate spatial distribution of the constituent material phases, spectral stop bands could be generated. Moreover, it is possible to control the number, the width, and the location of these bands within a frequency range of interest. This study aims at exploring the relationship between unit cell configuration and frequency spectrum characteristics. Focusing on 1D layered phononic crystals, and longitudinal wave propagation in the direction normal to the layering, the unit cell features of interest are the number of layers and the material phase and relative thickness of each layer. An evolutionary search for binary- and ternary-phase cell designs exhibiting a series of stop bands at predetermined frequencies is conducted. A specially formulated representation and set of genetic operators that break the symmetries in the problem are developed for this purpose. An array of optimal designs for a range of ratios in Young's modulus and density are obtained and the corresponding objective values (the degrees to which the resulting bands match the predetermined targets) are examined as a function of these ratios. It is shown that a rather complex filtering objective could be met with a high degree of success. Structures composed of the designed phononic crystals are excellent candidates for use in a wide range of applications including sound and vibration filtering.
Optimization of phononic filters via genetic algorithms
International Nuclear Information System (INIS)
Hussein, M I; El-Beltagy, M A
2007-01-01
A phononic crystal is commonly characterized by its dispersive frequency spectrum. With appropriate spatial distribution of the constituent material phases, spectral stop bands could be generated. Moreover, it is possible to control the number, the width, and the location of these bands within a frequency range of interest. This study aims at exploring the relationship between unit cell configuration and frequency spectrum characteristics. Focusing on 1D layered phononic crystals, and longitudinal wave propagation in the direction normal to the layering, the unit cell features of interest are the number of layers and the material phase and relative thickness of each layer. An evolutionary search for binary- and ternary-phase cell designs exhibiting a series of stop bands at predetermined frequencies is conducted. A specially formulated representation and set of genetic operators that break the symmetries in the problem are developed for this purpose. An array of optimal designs for a range of ratios in Young's modulus and density are obtained and the corresponding objective values (the degrees to which the resulting bands match the predetermined targets) are examined as a function of these ratios. It is shown that a rather complex filtering objective could be met with a high degree of success. Structures composed of the designed phononic crystals are excellent candidates for use in a wide range of applications including sound and vibration filtering
Crossover Improvement for the Genetic Algorithm in Information Retrieval.
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.…
Optimization of composite panels using neural networks and genetic algorithms
Ruijter, W.; Spallino, R.; Warnet, Laurent; de Boer, Andries
2003-01-01
The objective of this paper is to present first results of a running study on optimization of aircraft components (composite panels of a typical vertical tail plane) by using Genetic Algorithms (GA) and Neural Networks (NN). The panels considered are standardized to some extent but still there is a
Genetic algorithms and Monte Carlo simulation for optimal plant design
International Nuclear Information System (INIS)
Cantoni, M.; Marseguerra, M.; Zio, E.
2000-01-01
We present an approach to the optimal plant design (choice of system layout and components) under conflicting safety and economic constraints, based upon the coupling of a Monte Carlo evaluation of plant operation with a Genetic Algorithms-maximization procedure. The Monte Carlo simulation model provides a flexible tool, which enables one to describe relevant aspects of plant design and operation, such as standby modes and deteriorating repairs, not easily captured by analytical models. The effects of deteriorating repairs are described by means of a modified Brown-Proschan model of imperfect repair which accounts for the possibility of an increased proneness to failure of a component after a repair. The transitions of a component from standby to active, and vice versa, are simulated using a multiplicative correlation model. The genetic algorithms procedure is demanded to optimize a profit function which accounts for the plant safety and economic performance and which is evaluated, for each possible design, by the above Monte Carlo simulation. In order to avoid an overwhelming use of computer time, for each potential solution proposed by the genetic algorithm, we perform only few hundreds Monte Carlo histories and, then, exploit the fact that during the genetic algorithm population evolution, the fit chromosomes appear repeatedly many times, so that the results for the solutions of interest (i.e. the best ones) attain statistical significance
AC-600 reactor reloading pattern optimization by using genetic algorithms
International Nuclear Information System (INIS)
Wu Hongchun; Xie Zhongsheng; Yao Dong; Li Dongsheng; Zhang Zongyao
2000-01-01
The use of genetic algorithms to optimize reloading pattern of the nuclear power plant reactor is proposed. And a new encoding and translating method is given. Optimization results of minimizing core power peak and maximizing cycle length for both low-leakage and out-in loading pattern of AC-600 reactor are obtained
Genetic algorithms applied to the nuclear power plant operation
International Nuclear Information System (INIS)
Schirru, R.; Martinez, A.S.; Pereira, C.M.N.A.
2000-01-01
Nuclear power plant operation often involves very important human decisions, such as actions to be taken after a nuclear accident/transient, or finding the best core reload pattern, a complex combinatorial optimization problem which requires expert knowledge. Due to the complexity involved in the decisions to be taken, computerized systems have been intensely explored in order to aid the operator. Following hardware advances, soft computing has been improved and, nowadays, intelligent technologies, such as genetic algorithms, neural networks and fuzzy systems, are being used to support operator decisions. In this chapter two main problems are explored: transient diagnosis and nuclear core refueling. Here, solutions to such kind of problems, based on genetic algorithms, are described. A genetic algorithm was designed to optimize the nuclear fuel reload of Angra-1 nuclear power plant. Results compared to those obtained by an expert reveal a gain in the burn-up cycle. Two other genetic algorithm approaches were used to optimize real time diagnosis systems. The first one learns partitions in the time series that represents the transients, generating a set of classification centroids. The other one involves the optimization of an adaptive vector quantization neural network. Results are shown and commented. (orig.)
Time-Delay System Identification Using Genetic Algorithm
DEFF Research Database (Denmark)
Yang, Zhenyu; Seested, Glen Thane
2013-01-01
problem through an identification approach using the real coded Genetic Algorithm (GA). The desired FOPDT/SOPDT model is directly identified based on the measured system's input and output data. In order to evaluate the quality and performance of this GA-based approach, the proposed method is compared...
A Parallel Genetic Algorithm for Automated Electronic Circuit Design
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.
Performance of genetic algorithms in search for water splitting perovskites
DEFF Research Database (Denmark)
Jain, A.; Castelli, Ivano Eligio; Hautier, G.
2013-01-01
We examine the performance of genetic algorithms (GAs) in uncovering solar water light splitters over a space of almost 19,000 perovskite materials. The entire search space was previously calculated using density functional theory to determine solutions that fulfill constraints on stability, band...
Identification of partial blockages in pipelines using genetic algorithms
Indian Academy of Sciences (India)
A methodology to identify the partial blockages in a simple pipeline using genetic algorithms for non-harmonic flows is presented in this paper. A sinusoidal flow generated by the periodic on-and-off operation of a valve at the outlet is investigated in the time domain and it is observed that pressure variation at the valve is ...
A Genetic algorithm for evaluating the zeros (roots) of polynomial ...
African Journals Online (AJOL)
This paper presents a Genetic Algorithm software (which is a computational, search technique) for finding the zeros (roots) of any given polynomial function, and optimizing and solving N-dimensional systems of equations. The software is particularly useful since most of the classic schemes are not all embracing.
Concrete Plant Operations Optimization Using Combined Simulation and Genetic Algorithms
Cao, Ming; Lu, Ming; Zhang, Jian-Ping
2004-01-01
This work presents a new approach for concrete plant operations optimization by combining a ready mixed concrete (RMC) production simulation tool (called HKCONSIM) with a genetic algorithm (GA) based optimization procedure. A revamped HKCONSIM computer system can be used to automate the simulation
Introduction to genetic algorithms as a modeling tool
International Nuclear Information System (INIS)
Wildberger, A.M.; Hickok, K.A.
1990-01-01
Genetic algorithms are search and classification techniques modeled on natural adaptive systems. This is an introduction to their use as a modeling tool with emphasis on prospects for their application in the power industry. It is intended to provide enough background information for its audience to begin to follow technical developments in genetic algorithms and to recognize those which might impact on electric power engineering. Beginning with a discussion of genetic algorithms and their origin as a model of biological adaptation, their advantages and disadvantages are described in comparison with other modeling tools such as simulation and neural networks in order to provide guidance in selecting appropriate applications. In particular, their use is described for improving expert systems from actual data and they are suggested as an aid in building mathematical models. Using the Thermal Performance Advisor as an example, it is suggested how genetic algorithms might be used to make a conventional expert system and mathematical model of a power plant adapt automatically to changes in the plant's characteristics
Application of genetic algorithm in reactor fuel management
International Nuclear Information System (INIS)
Peng Gang
2002-01-01
The genetic algorithm (GA) has been used in reactor fuel management of core arrangement optimal calculation. The chromosome coding method has been selected, and the parameters in GA operators have been improved, so the quality and efficiency of calculation in GA program have been greatly improved. According to the result, better core fuel position arrangement can be obtained from the GA calculation
Proposed genetic algorithms for construction site lay out
Mawdesley, Michael J.; Al-Jibouri, Saad H.S.
2003-01-01
The positioning of temporary facilities on a construction site is an area of research which has been recognised as important but which has received relatively little attention. In this paper, a genetic algorithm is proposed to solve the problem in which m facilities are to be positioned to n
Application of a genetic algorithm to core reload pattern optimization
International Nuclear Information System (INIS)
Tanker, E.; Tanker, A.Z.
1994-01-01
A genetic algorithm is applied to reload pattern optimization of a PWR core. Evaluating all different distributions of a given batch load separately is found slow and ineffective. Allowing patterns from different distributions to combine reproduce, an optimized pattern better than that obtained from from linear programming is found, albeit in a longer time. (authors). 5 refs., 2 tabs
Genetic Algorithm and its Application in Optimal Sensor Layout
Directory of Open Access Journals (Sweden)
Xiang-Yang Chen
2015-05-01
Full Text Available This paper aims at the problem of multi sensor station distribution, based on multi- sensor systems of different types as the research object, in the analysis of various types of sensors with different application background, different indicators of demand, based on the different constraints, for all kinds of multi sensor station is studied, the application of genetic algorithms as a tool for the objective function of the models optimization, then the optimal various types of multi sensor station distribution plan, improve the performance of the system, and achieved good military effect. In the field of application of sensor radar, track measuring instrument, the satellite, passive positioning equipment of various types, specific problem, use care indicators and station arrangement between the mathematical model of geometry, using genetic algorithm to get the optimization results station distribution, to solve a variety of practical problems provides useful help, but also reflects the improved genetic algorithm in electronic weapon system based on multi sensor station distribution on the applicability and effectiveness of the optimization; finally the genetic algorithm for integrated optimization of multi sensor station distribution using the good to the training exercise tasks based on actual in, and have achieved good military effect.
System control fuzzy neural sewage pumping stations using genetic algorithms
Directory of Open Access Journals (Sweden)
Владлен Николаевич Кузнецов
2015-06-01
Full Text Available It is considered the system of management of sewage pumping station with regulators based on a neuron network with fuzzy logic. Linguistic rules for the controller based on fuzzy logic, maintaining the level of effluent in the receiving tank within the prescribed limits are developed. The use of genetic algorithms for neuron network training is shown.
Maintenance optimization in nuclear power plants through genetic algorithms
International Nuclear Information System (INIS)
Munoz, A.; Martorell, S.; Serradell, V.
1999-01-01
Establishing suitable scheduled maintenance tasks leads to optimizing the reliability of nuclear power plant safety systems. The articles addresses this subject, whilst endeavoring to tackle an overall optimization process for component availability and safety systems through the use of genetic algorithms. (Author) 20 refs
Influence of crossover methods used by genetic algorithm-based ...
Indian Academy of Sciences (India)
numerical methods like Newton–Raphson, sequential homotopy calculation, Walsh ... But the paper does not touch upon the elements of crossover operators. ... if SHE problems are solved with optimization tools like GA (Schutten ..... Goldberg D E 1989 Genetic algorithms in search, optimization and machine learning.
Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm
Directory of Open Access Journals (Sweden)
Jianyong Liu
2015-01-01
Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.
Virus evolutionary genetic algorithm for task collaboration of logistics distribution
Ning, Fanghua; Chen, Zichen; Xiong, Li
2005-12-01
In order to achieve JIT (Just-In-Time) level and clients' maximum satisfaction in logistics collaboration, a Virus Evolutionary Genetic Algorithm (VEGA) was put forward under double constraints of logistics resource and operation sequence. Based on mathematic description of a multiple objective function, the algorithm was designed to schedule logistics tasks with different due dates and allocate them to network members. By introducing a penalty item, make span and customers' satisfaction were expressed in fitness function. And a dynamic adaptive probability of infection was used to improve performance of local search. Compared to standard Genetic Algorithm (GA), experimental result illustrates the performance superiority of VEGA. So the VEGA can provide a powerful decision-making technique for optimizing resource configuration in logistics network.
Fractional Dynamics of Genetic Algorithms Using Hexagonal Space Tessellation
Directory of Open Access Journals (Sweden)
J. A. Tenreiro Machado
2013-01-01
Full Text Available The paper formulates a genetic algorithm that evolves two types of objects in a plane. The fitness function promotes a relationship between the objects that is optimal when some kind of interface between them occurs. Furthermore, the algorithm adopts an hexagonal tessellation of the two-dimensional space for promoting an efficient method of the neighbour modelling. The genetic algorithm produces special patterns with resemblances to those revealed in percolation phenomena or in the symbiosis found in lichens. Besides the analysis of the spacial layout, a modelling of the time evolution is performed by adopting a distance measure and the modelling in the Fourier domain in the perspective of fractional calculus. The results reveal a consistent, and easy to interpret, set of model parameters for distinct operating conditions.
Detecting structural breaks in time series via genetic algorithms
DEFF Research Database (Denmark)
Doerr, Benjamin; Fischer, Paul; Hilbert, Astrid
2016-01-01
of the time series under consideration is available. Therefore, a black-box optimization approach is our method of choice for detecting structural breaks. We describe a genetic algorithm framework which easily adapts to a large number of statistical settings. To evaluate the usefulness of different crossover...... and mutation operations for this problem, we conduct extensive experiments to determine good choices for the parameters and operators of the genetic algorithm. One surprising observation is that use of uniform and one-point crossover together gave significantly better results than using either crossover...... operator alone. Moreover, we present a specific fitness function which exploits the sparse structure of the break points and which can be evaluated particularly efficiently. The experiments on artificial and real-world time series show that the resulting algorithm detects break points with high precision...
Genetic algorithms: Theory and applications in the safety domain
International Nuclear Information System (INIS)
Marseguerra, M.; Zio, E.
2001-01-01
This work illustrates the fundamentals underlying optimization by genetic algorithms. All the steps of the procedure are sketched in details for both the traditional breeding algorithm as well as for more sophisticated breeding procedures. The necessity of affine transforming the fitness function, object of the optimization, is discussed in detail, together with the transformation itself. Procedures for the inducement of species and niches are also presented. The theoretical aspects of the work are corroborated by a demonstration of the potential of genetic algorithm optimization procedures on three different case studies. The first case study deals with the design of the pressure stages of a natural gas pipeline system; the second one treats a reliability allocation problem in system configuration design; the last case regards the selection of maintenance and repair strategies for the logistic management of a risky plant. (author)
Genetic algorithm based reactive power dispatch for voltage stability improvement
Energy Technology Data Exchange (ETDEWEB)
Devaraj, D. [Department of Electrical and Electronics, Kalasalingam University, Krishnankoil 626 190 (India); Roselyn, J. Preetha [Department of Electrical and Electronics, SRM University, Kattankulathur 603 203, Chennai (India)
2010-12-15
Voltage stability assessment and control form the core function in a modern energy control centre. This paper presents an improved Genetic algorithm (GA) approach for voltage stability enhancement. The proposed technique is based on the minimization of the maximum of L-indices of load buses. Generator voltages, switchable VAR sources and transformer tap changers are used as optimization variables of this problem. The proposed approach permits the optimization variables to be represented in their natural form in the genetic population. For effective genetic processing, the crossover and mutation operators which can directly deal with the floating point numbers and integers are used. The proposed algorithm has been tested on IEEE 30-bus and IEEE 57-bus test systems and successful results have been obtained. (author)
Global structural optimizations of surface systems with a genetic algorithm
International Nuclear Information System (INIS)
Chuang, Feng-Chuan
2005-01-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 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 √3 x √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
Genetic algorithm based on qubits and quantum gates
International Nuclear Information System (INIS)
Silva, Joao Batista Rosa; Ramos, Rubens Viana
2003-01-01
Full text: Genetic algorithm, a computational technique based on the evolution of the species, in which a possible solution of the problem is coded in a binary string, called chromosome, has been used successfully in several kinds of problems, where the search of a minimal or a maximal value is necessary, even when local minima are present. A natural generalization of a binary string is a qubit string. Hence, it is possible to use the structure of a genetic algorithm having a sequence of qubits as a chromosome and using quantum operations in the reproduction in order to find the best solution in some problems of quantum information. For example, given a unitary matrix U what is the pair of qubits that, when applied at the input, provides the output state with maximal entanglement? In order to solve this problem, a population of chromosomes of two qubits was created. The crossover was performed applying the quantum gates CNOT and SWAP at the pair of qubits, while the mutation was performed applying the quantum gates Hadamard, Z and Not in a single qubit. The result was compared with a classical genetic algorithm used to solve the same problem. A hundred simulations using the same U matrix was performed. Both algorithms, hereafter named by CGA (classical) and QGA (using qu bits), reached good results close to 1 however, the number of generations needed to find the best result was lower for the QGA. Another problem where the QGA can be useful is in the calculation of the relative entropy of entanglement. We have tested our algorithm using 100 pure states chosen randomly. The stop criterion used was the error lower than 0.01. The main advantages of QGA are its good precision, robustness and very easy implementation. The main disadvantage is its low velocity, as happen for all kind of genetic algorithms. (author)
Evaluation of algorithms used to order markers on genetic maps.
Mollinari, M; Margarido, G R A; Vencovsky, R; Garcia, A A F
2009-12-01
When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with 100 and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results.
First results of genetic algorithm application in ML image reconstruction in emission tomography
International Nuclear Information System (INIS)
Smolik, W.
1999-01-01
This paper concerns application of genetic algorithm in maximum likelihood image reconstruction in emission tomography. The example of genetic algorithm for image reconstruction is presented. The genetic algorithm was based on the typical genetic scheme modified due to the nature of solved problem. The convergence of algorithm was examined. The different adaption functions, selection and crossover methods were verified. The algorithm was tested on simulated SPECT data. The obtained results of image reconstruction are discussed. (author)
International Nuclear Information System (INIS)
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. (geophysics, astronomy, and astrophysics)
Genetic Algorithm Applied to the Eigenvalue Equalization Filtered-x LMS Algorithm (EE-FXLMS
Directory of Open Access Journals (Sweden)
Stephan P. Lovstedt
2008-01-01
Full Text Available The FXLMS algorithm, used extensively in active noise control (ANC, exhibits frequency-dependent convergence behavior. This leads to degraded performance for time-varying tonal noise and noise with multiple stationary tones. Previous work by the authors proposed the eigenvalue equalization filtered-x least mean squares (EE-FXLMS algorithm. For that algorithm, magnitude coefficients of the secondary path transfer function are modified to decrease variation in the eigenvalues of the filtered-x autocorrelation matrix, while preserving the phase, giving faster convergence and increasing overall attenuation. This paper revisits the EE-FXLMS algorithm, using a genetic algorithm to find magnitude coefficients that give the least variation in eigenvalues. This method overcomes some of the problems with implementing the EE-FXLMS algorithm arising from finite resolution of sampled systems. Experimental control results using the original secondary path model, and a modified secondary path model for both the previous implementation of EE-FXLMS and the genetic algorithm implementation are compared.
Acoustic Impedance Inversion of Seismic Data Using Genetic Algorithm
Eladj, Said; Djarfour, Noureddine; Ferahtia, Djalal; Ouadfeul, Sid-Ali
2013-04-01
The inversion of seismic data can be used to constrain estimates of the Earth's acoustic impedance structure. This kind of problem is usually known to be non-linear, high-dimensional, with a complex search space which may be riddled with many local minima, and results in irregular objective functions. We investigate here the performance and the application of a genetic algorithm, in the inversion of seismic data. The proposed algorithm has the advantage of being easily implemented without getting stuck in local minima. The effects of population size, Elitism strategy, uniform cross-over and lower mutation are examined. The optimum solution parameters and performance were decided as a function of the testing error convergence with respect to the generation number. To calculate the fitness function, we used L2 norm of the sample-to-sample difference between the reference and the inverted trace. The cross-over probability is of 0.9-0.95 and mutation has been tested at 0.01 probability. The application of such a genetic algorithm to synthetic data shows that the inverted acoustic impedance section was efficient. Keywords: Seismic, Inversion, acoustic impedance, genetic algorithm, fitness functions, cross-over, mutation.
Genetic algorithm enhanced by machine learning in dynamic aperture optimization
Li, Yongjun; Cheng, Weixing; Yu, Li Hua; Rainer, Robert
2018-05-01
With the aid of machine learning techniques, the genetic algorithm has been enhanced and applied to the multi-objective optimization problem presented by the dynamic aperture of the National Synchrotron Light Source II (NSLS-II) Storage Ring. During the evolution processes employed by the genetic algorithm, the population is classified into different clusters in the search space. The clusters with top average fitness are given "elite" status. Intervention on the population is implemented by repopulating some potentially competitive candidates based on the experience learned from the accumulated data. These candidates replace randomly selected candidates among the original data pool. The average fitness of the population is therefore improved while diversity is not lost. Maintaining diversity ensures that the optimization is global rather than local. The quality of the population increases and produces more competitive descendants accelerating the evolution process significantly. When identifying the distribution of optimal candidates, they appear to be located in isolated islands within the search space. Some of these optimal candidates have been experimentally confirmed at the NSLS-II storage ring. The machine learning techniques that exploit the genetic algorithm can also be used in other population-based optimization problems such as particle swarm algorithm.
Improved multilayer OLED architecture using evolutionary genetic algorithm
International Nuclear Information System (INIS)
Quirino, W.G.; Teixeira, K.C.; Legnani, C.; Calil, V.L.; Messer, B.; Neto, O.P. Vilela; Pacheco, M.A.C.; Cremona, M.
2009-01-01
Organic light-emitting diodes (OLEDs) constitute a new class of emissive devices, which present high efficiency and low voltage operation, among other advantages over current technology. Multilayer architecture (M-OLED) is generally used to optimize these devices, specially overcoming the suppression of light emission due to the exciton recombination near the metal layers. However, improvement in recombination, transport and charge injection can also be achieved by blending electron and hole transporting layers into the same one. Graded emissive region devices can provide promising results regarding quantum and power efficiency and brightness, as well. The massive number of possible model configurations, however, suggests that a search algorithm would be more suitable for this matter. In this work, multilayer OLEDs were simulated and fabricated using Genetic Algorithms (GAs) as evolutionary strategy to improve their efficiency. Genetic Algorithms are stochastic algorithms based on genetic inheritance and Darwinian strife to survival. In our simulations, it was assumed a 50 nm width graded region, divided into five equally sized layers. The relative concentrations of the materials within each layer were optimized to obtain the lower V/J 0.5 ratio, where V is the applied voltage and J the current density. The best M-OLED architecture obtained by genetic algorithm presented a V/J 0.5 ratio nearly 7% lower than the value reported in the literature. In order to check the experimental validity of the improved results obtained in the simulations, two M-OLEDs with different architectures were fabricated by thermal deposition in high vacuum environment. The results of the comparison between simulation and some experiments are presented and discussed.
Optimization of Antennas using a Hybrid Genetic-Algorithm Space-Mapping Algorithm
DEFF Research Database (Denmark)
Pantoja, M.F.; Bretones, A.R.; Meincke, Peter
2006-01-01
A hybrid global-local optimization technique for the design of antennas is presented. It consists of the subsequent application of a Genetic Algorithm (GA) that employs coarse models in the simulations and a space mapping (SM) that refines the solution found in the previous stage. The technique...
Genetic algorithms and their use in Geophysical Problems
Energy Technology Data Exchange (ETDEWEB)
Parker, Paul B. [Univ. of California, Berkeley, CA (United States)
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
A Dedicated Genetic Algorithm for Localization of Moving Magnetic Objects
Directory of Open Access Journals (Sweden)
Roger Alimi
2015-09-01
Full Text Available 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.
Control of the lighting system using a genetic algorithm
Directory of Open Access Journals (Sweden)
Čongradac Velimir D.
2012-01-01
Full Text Available The manufacturing, distribution and use of electricity are of fundamental importance for the social life and they have the biggest influence on the environment associated with any human activity. The energy needed for building lighting makes up 20-40% of the total consumption. This paper displays the development of the mathematical model and genetic algorithm for the control of dimmable lighting on problems of regulating the level of internal lighting and increase of energetic efficiency using daylight. A series of experiments using the optimization algorithm on the realized model confirmed very high savings in electricity consumption.
A pipelined FPGA implementation of an encryption algorithm based on genetic algorithm
Thirer, Nonel
2013-05-01
With the evolution of digital data storage and exchange, it is essential to protect the confidential information from every unauthorized access. High performance encryption algorithms were developed and implemented by software and hardware. Also many methods to attack the cipher text were developed. In the last years, the genetic algorithm has gained much interest in cryptanalysis of cipher texts and also in encryption ciphers. This paper analyses the possibility to use the genetic algorithm as a multiple key sequence generator for an AES (Advanced Encryption Standard) cryptographic system, and also to use a three stages pipeline (with four main blocks: Input data, AES Core, Key generator, Output data) to provide a fast encryption and storage/transmission of a large amount of data.
Efficient Feedforward Linearization Technique Using Genetic Algorithms for OFDM Systems
Directory of Open Access Journals (Sweden)
García Paloma
2010-01-01
Full Text Available Feedforward is a linearization method that simultaneously offers wide bandwidth and good intermodulation distortion suppression; so it is a good choice for Orthogonal Frequency Division Multiplexing (OFDM systems. Feedforward structure consists of two loops, being necessary an accurate adjustment between them along the time, and when temperature, environmental, or operating changes are produced. Amplitude and phase imbalances of the circuit elements in both loops produce mismatched effects that lead to degrade its performance. A method is proposed to compensate these mismatches, introducing two complex coefficients calculated by means of a genetic algorithm. A full study is carried out to choose the optimal parameters of the genetic algorithm applied to wideband systems based on OFDM technologies, which are very sensitive to nonlinear distortions. The method functionality has been verified by means of simulation.
Genetic algorithms and the analysis of SnIa data
International Nuclear Information System (INIS)
Nesseris, Savvas
2011-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 Λ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 ΛCDM model, to derive our constraints. We find that while ΛCDM is consistent with the data at the 2σ level, some deviations from ΛCDM model at low redshifts can be accommodated.
Stabilization of Electromagnetic Suspension System Behavior by Genetic Algorithm
Directory of Open Access Journals (Sweden)
Abbas Najar Khoda Bakhsh
2012-07-01
Full Text Available Electromagnetic suspension system with a nonlinear and unstable behavior, is used in maglev trains. In this paper a linear mathematical model of system is achieved and the state feedback method is used to improve the system stability. The control coefficients are tuned by two different methods, Riccati and a new method based on Genetic algorithm. In this new proposed method, we use Genetic algorithm to achieve the optimum values of control coefficients. The results of the system simulation by Matlab indicate the effectiveness of new proposed system. When a new reference of air gap is needed or a new external force is added, the proposed system could omit the vibration and shake of the train coupe and so, passengers feel more comfortable.
Genetic Algorithm Design of a 3D Printed Heat Sink
Energy Technology Data Exchange (ETDEWEB)
Wu, Tong [ORNL; Ozpineci, Burak [ORNL; Ayers, Curtis William [ORNL
2016-01-01
In this paper, a genetic algorithm- (GA-) based approach is discussed for designing heat sinks based on total heat generation and dissipation for a pre-specified size andshape. This approach combines random iteration processesand genetic algorithms with finite element analysis (FEA) to design the optimized heat sink. With an approach that prefers survival of the fittest , a more powerful heat sink can bedesigned which can cool power electronics more efficiently. Some of the resulting designs can only be 3D printed due totheir complexity. In addition to describing the methodology, this paper also includes comparisons of different cases to evaluate the performance of the newly designed heat sinkcompared to commercially available heat sinks.
Use of genetic algorithms for optimization of subchannel simulations
International Nuclear Information System (INIS)
Nava Dominguez, A.
2004-01-01
To facilitate the modeling of a rod fuel bundle, the most common used method consist in dividing the complex cross-sectional area in small subsections called subchannels. To close the system equations, a mixture model is used to represent the intersubchannel interactions. These interactions are as follows: diversion cross-flow, turbulent void diffusion, void drift and buoyancy drift. Amongst these mechanisms, the turbulent void diffusion and void drift are frequently modelled using diffusion coefficients. In this work, a novel approach has been employed where an existing subchannel code coupled to a genetic algorithm code which were used to optimize these coefficients. After several numerical simulations, a new objective function based in the principle of minimum dissipated energy was developed. The use of this function in the genetic algorithm coupled to the subchannel code, gave results in good agreement with the experimental data
Exergetic optimization of turbofan engine with genetic algorithm method
Energy Technology Data Exchange (ETDEWEB)
Turan, Onder [Anadolu University, School of Civil Aviation (Turkey)], e-mail: onderturan@anadolu.edu.tr
2011-07-01
With the growth of passenger numbers, emissions from the aeronautics sector are increasing and the industry is now working on improving engine efficiency to reduce fuel consumption. The aim of this study is to present the use of genetic algorithms, an optimization method based on biological principles, to optimize the exergetic performance of turbofan engines. The optimization was carried out using exergy efficiency, overall efficiency and specific thrust of the engine as evaluation criteria and playing on pressure and bypass ratio, turbine inlet temperature and flight altitude. Results showed exergy efficiency can be maximized with higher altitudes, fan pressure ratio and turbine inlet temperature; the turbine inlet temperature is the most important parameter for increased exergy efficiency. This study demonstrated that genetic algorithms are effective in optimizing complex systems in a short time.
Quantum control using genetic algorithms in quantum communication: superdense coding
International Nuclear Information System (INIS)
Domínguez-Serna, Francisco; Rojas, Fernando
2015-01-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. (paper)
Optimum Actuator Selection with a Genetic Algorithm for Aircraft Control
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.
Directory of Open Access Journals (Sweden)
Hyo Seon Park
2014-01-01
Full Text Available Since genetic algorithm-based optimization methods are computationally expensive for practical use in the field of structural optimization, a resizing technique-based hybrid genetic algorithm for the drift design of multistory steel frame buildings is proposed to increase the convergence speed of genetic algorithms. To reduce the number of structural analyses required for the convergence, a genetic algorithm is combined with a resizing technique that is an efficient optimal technique to control the drift of buildings without the repetitive structural analysis. The resizing technique-based hybrid genetic algorithm proposed in this paper is applied to the minimum weight design of three steel frame buildings. To evaluate the performance of the algorithm, optimum weights, computational times, and generation numbers from the proposed algorithm are compared with those from a genetic algorithm. Based on the comparisons, it is concluded that the hybrid genetic algorithm shows clear improvements in convergence properties.
A Case Study of a Multiobjective Elitist Recombinative Genetic Algorithm with Coevolutionary Sharing
Neef, R.M.; Thierens, D.; Arciszewski, H.F.R.
1999-01-01
We present a multiobjective genetic algorithm that incorporates various genetic algorithm techniques that have been proven to be efficient and robust in their problem domain. More specifically, we integrate rank based selection, adaptive niching through coevolutionary sharing, elitist recombination,
A case study of a multiobjective recombinative genetic algorithm with coevolutionary sharing
Neef, R.M.; Thierens, D.; Arciszewski, H.F.R.
1999-01-01
We present a multiobjective genetic algorithm that incorporates various genetic algorithm techniques that have been proven to be efficient and robust in their problem domain. More specifically, we integrate rank based selection, adaptive niching through coevolutionary sharing, elitist recombination,
Digital Image Encryption Algorithm Design Based on Genetic Hyperchaos
Directory of Open Access Journals (Sweden)
Jian Wang
2016-01-01
Full Text Available In view of the present chaotic image encryption algorithm based on scrambling (diffusion is vulnerable to choosing plaintext (ciphertext attack in the process of pixel position scrambling, we put forward a image encryption algorithm based on genetic super chaotic system. The algorithm, by introducing clear feedback to the process of scrambling, makes the scrambling effect related to the initial chaos sequence and the clear text itself; it has realized the image features and the organic fusion of encryption algorithm. By introduction in the process of diffusion to encrypt plaintext feedback mechanism, it improves sensitivity of plaintext, algorithm selection plaintext, and ciphertext attack resistance. At the same time, it also makes full use of the characteristics of image information. Finally, experimental simulation and theoretical analysis show that our proposed algorithm can not only effectively resist plaintext (ciphertext attack, statistical attack, and information entropy attack but also effectively improve the efficiency of image encryption, which is a relatively secure and effective way of image communication.
Hybrid Genetic Algorithm Optimization for Case Based Reasoning Systems
International Nuclear Information System (INIS)
Mohamed, A.H.
2008-01-01
The success of a CBR system largely depen ds on an effective retrieval of useful prior case for the problem. Nearest neighbor and induction are the main CBR retrieval algorithms. Each of them can be more suitable in different situations. Integrated the two retrieval algorithms can catch the advantages of both of them. But, they still have some limitations facing the induction retrieval algorithm when dealing with a noisy data, a large number of irrelevant features, and different types of data. This research utilizes a hybrid approach using genetic algorithms (GAs) to case-based induction retrieval of the integrated nearest neighbor - induction algorithm in an attempt to overcome these limitations and increase the overall classification accuracy. GAs can be used to optimize the search space of all the possible subsets of the features set. It can deal with the irrelevant and noisy features while still achieving a significant improvement of the retrieval accuracy. Therefore, the proposed CBR-GA introduces an effective general purpose retrieval algorithm that can improve the performance of CBR systems. It can be applied in many application areas. CBR-GA has proven its success when applied for different problems in real-life
Genomic multiple sequence alignments: refinement using a genetic algorithm
Directory of Open Access Journals (Sweden)
Lefkowitz Elliot J
2005-08-01
Full Text Available Abstract Background Genomic sequence data cannot be fully appreciated in isolation. Comparative genomics – the practice of comparing genomic sequences from different species – plays an increasingly important role in understanding the genotypic differences between species that result in phenotypic differences as well as in revealing patterns of evolutionary relationships. One of the major challenges in comparative genomics is producing a high-quality alignment between two or more related genomic sequences. In recent years, a number of tools have been developed for aligning large genomic sequences. Most utilize heuristic strategies to identify a series of strong sequence similarities, which are then used as anchors to align the regions between the anchor points. The resulting alignment is globally correct, but in many cases is suboptimal locally. We describe a new program, GenAlignRefine, which improves the overall quality of global multiple alignments by using a genetic algorithm to improve local regions of alignment. Regions of low quality are identified, realigned using the program T-Coffee, and then refined using a genetic algorithm. Because a better COFFEE (Consistency based Objective Function For alignmEnt Evaluation score generally reflects greater alignment quality, the algorithm searches for an alignment that yields a better COFFEE score. To improve the intrinsic slowness of the genetic algorithm, GenAlignRefine was implemented as a parallel, cluster-based program. Results We tested the GenAlignRefine algorithm by running it on a Linux cluster to refine sequences from a simulation, as well as refine a multiple alignment of 15 Orthopoxvirus genomic sequences approximately 260,000 nucleotides in length that initially had been aligned by Multi-LAGAN. It took approximately 150 minutes for a 40-processor Linux cluster to optimize some 200 fuzzy (poorly aligned regions of the orthopoxvirus alignment. Overall sequence identity increased only
OPTIMIZATION OF LONG RURAL FEEDERS USING A GENETIC ALGORITHM
International Nuclear Information System (INIS)
Wishart, Michael; Ledwich, Gerard; Ghosh, Arindam; Ivanovich, Grujica
2010-01-01
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.
Multiobjective genetic algorithm approaches to project scheduling under risk
Kılıç, Murat; Kilic, Murat
2003-01-01
In this thesis, project scheduling under risk is chosen as the topic of research. Project scheduling under risk is defined as a biobjective decision problem and is formulated as a 0-1 integer mathematical programming model. In this biobjective formulation, one of the objectives is taken as the expected makespan minimization and the other is taken as the expected cost minimization. As the solution approach to this biobjective formulation genetic algorithm (GA) is chosen. After carefully invest...
Evolution of Strategies for "Prisoner's Dilemma" using Genetic Algorithm
Heinz, Jan
2010-01-01
The subject of this thesis is the software application "Prisoner's Dilemma". The program creates a population of players of "Prisoner's Dilemma", has them play against each other, and - based on their results - performs an evolution of their strategies by means of a genetic algorithm (selection, mutation, and crossover). The program was written in Microsoft Visual Studio, in the C++ programming language, and its interface makes use of the .NET Framework. The thesis includes examples of strate...
Optimization of heat pump using fuzzy logic and genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Sahin, Arzu Sencan [Sueleyman Demirel University, Technology Faculty, Isparta (Turkey); Kilic, Bayram; Kilic, Ulas [Bucak Emin Guelmez Vocational School, Mehmet Akif Ersoy University, Bucak (Turkey)
2011-12-15
Heat pumps offer economical alternatives of recovering heat from different sources for use in various industrial, commercial and residential applications. In this study, single-stage air-source vapor compression heat pump system has been optimized using genetic algorithm (GA) and fuzzy logic (FL). The necessary thermodynamic properties for optimization were calculated by FL. Thermodynamic properties obtained with FL were compared with actual results. Then, the optimum working conditions of heat pump system were determined by the GA. (orig.)
Eddy current testing probe optimization using a parallel genetic algorithm
Directory of Open Access Journals (Sweden)
Dolapchiev Ivaylo
2008-01-01
Full Text Available This paper uses the developed parallel version of Michalewicz's Genocop III Genetic Algorithm (GA searching technique to optimize the coil geometry of an eddy current non-destructive testing probe (ECTP. The electromagnetic field is computed using FEMM 2D finite element code. The aim of this optimization was to determine coil dimensions and positions that improve ECTP sensitivity to physical properties of the tested devices.
MICRONEEDLE STRUCTURE DESIGN AND OPTIMIZATION USING GENETIC ALGORITHM
N. A. ISMAIL; S. C. NEOH; N. SABANI; B. N. TAIB
2015-01-01
This paper presents a Genetic Algorithm (GA) based microneedle design and analysis. GA is an evolutionary optimization technique that mimics the natural biological evolution. The design of microneedle structure considers the shape of microneedle, material used, size of the array, the base of microneedle, the lumen base, the height of microneedle, the height of the lumen, and the height of the drug container or reservoir. The GA is executed in conjunction with ANSYS simulation system to assess...
Use of genetic algorithms in operations management. Part II - Results.
Stockton, David; Quinn, L. (Liam); Khalil, R. A. (Riham A.)
2004-01-01
The insight gained into the relationship between genetic algorithm (GA) structure and optimisation performance, through the research reported in this paper, provided the knowledge to integrate GAs with discrete event simulation which formed the output from IMI EPSRC Project GR/N05871 ‘Responsive Design and Operation of Flexible Machining Lines’ rated by EPSRC as “Tending to Internationally Leading” where industrial partners included , Unipart Group Ltd and Nigel.Shir...
Optimising training data for ANNs with Genetic Algorithms
Kamp , R. G.; Savenije , H. H. G.
2006-01-01
International audience; Artificial Neural Networks (ANNs) have proved to be good modelling tools in hydrology for rainfall-runoff modelling and hydraulic flow modelling. Representative datasets are necessary for the training phase in which the ANN learns the model's input-output relations. Good and representative training data is not always available. In this publication Genetic Algorithms (GA) are used to optimise training datasets. The approach is tested with an existing hydraulic model in ...
Optimising training data for ANNs with Genetic Algorithms
R. G. Kamp; R. G. Kamp; H. H. G. Savenije
2006-01-01
Artificial Neural Networks (ANNs) have proved to be good modelling tools in hydrology for rainfall-runoff modelling and hydraulic flow modelling. Representative datasets are necessary for the training phase in which the ANN learns the model's input-output relations. Good and representative training data is not always available. In this publication Genetic Algorithms (GA) are used to optimise training datasets. The approach is tested with an existing hydraulic model in The Netherlands. An...
Optimization of broadband semiconductor chirped mirrors with genetic algorithm
Dems, M.; Wnuk, P.; Wasylczyk, P.; Zinkiewicz, L.; Wojcik-Jedlinska, A.; Reginski, K.; Hejduk, K.; Jasik, A.
2016-01-01
Genetic algorithm was applied for optimization of dispersion properties in semiconductor Bragg reflectors for applications in femtosecond lasers. Broadband, large negative group-delay dispersion was achieved in the optimized design: The group-delay dispersion (GDD) as large as −3500 fs2 was theoretically obtained over a 10-nm bandwidth. The designed structure was manufactured and tested, providing GDD −3320 fs2 over a 7-nm bandwidth. The mirror performance was ...
MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm
Elizarraras, Omar; Panduro, Marco; Méndez, 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
MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm
Directory of Open Access Journals (Sweden)
Omar Elizarraras
2014-01-01
Full Text Available 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.
Genetic Algorithm Optimizes Q-LAW Control Parameters
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.
Design of PID Controller Simulator based on Genetic Algorithm
Directory of Open Access Journals (Sweden)
Fahri VATANSEVER
2013-08-01
Full Text Available PID (Proportional Integral and Derivative controllers take an important place in the field of system controlling. Various methods such as Ziegler-Nichols, Cohen-Coon, Chien Hrones Reswick (CHR and Wang-Juang-Chan are available for the design of such controllers benefiting from the system time and frequency domain data. These controllers are in compliance with system properties under certain criteria suitable to the system. Genetic algorithms have become widely used in control system applications in parallel to the advances in the field of computer and artificial intelligence. In this study, PID controller designs have been carried out by means of classical methods and genetic algorithms and comparative results have been analyzed. For this purpose, a graphical user interface program which can be used for educational purpose has been developed. For the definite (entered transfer functions, the suitable P, PI and PID controller coefficients have calculated by both classical methods and genetic algorithms and many parameters and responses of the systems have been compared and presented numerically and graphically
Genetic algorithm based optimization of advanced solar cell designs modeled in Silvaco AtlasTM
Utsler, James
2006-01-01
A genetic algorithm was used to optimize the power output of multi-junction solar cells. Solar cell operation was modeled using the Silvaco ATLASTM software. The output of the ATLASTM simulation runs served as the input to the genetic algorithm. The genetic algorithm was run as a diffusing computation on a network of eighteen dual processor nodes. Results showed that the genetic algorithm produced better power output optimizations when compared with the results obtained using the hill cli...
RCQ-GA: RDF Chain Query Optimization Using Genetic Algorithms
Hogenboom, Alexander; Milea, Viorel; Frasincar, Flavius; Kaymak, Uzay
The application of Semantic Web technologies in an Electronic Commerce environment implies a need for good support tools. Fast query engines are needed for efficient querying of large amounts of data, usually represented using RDF. We focus on optimizing a special class of SPARQL queries, the so-called RDF chain queries. For this purpose, we devise a genetic algorithm called RCQ-GA that determines the order in which joins need to be performed for an efficient evaluation of RDF chain queries. The approach is benchmarked against a two-phase optimization algorithm, previously proposed in literature. The more complex a query is, the more RCQ-GA outperforms the benchmark in solution quality, execution time needed, and consistency of solution quality. When the algorithms are constrained by a time limit, the overall performance of RCQ-GA compared to the benchmark further improves.
A Heuristics Approach for Classroom Scheduling Using Genetic Algorithm Technique
Ahmad, Izah R.; Sufahani, Suliadi; Ali, Maselan; Razali, Siti N. A. M.
2018-04-01
Reshuffling and arranging classroom based on the capacity of the audience, complete facilities, lecturing time and many more may lead to a complexity of classroom scheduling. While trying to enhance the productivity in classroom planning, this paper proposes a heuristic approach for timetabling optimization. A new algorithm was produced to take care of the timetabling problem in a university. The proposed of heuristics approach will prompt a superior utilization of the accessible classroom space for a given time table of courses at the university. Genetic Algorithm through Java programming languages were used in this study and aims at reducing the conflicts and optimizes the fitness. The algorithm considered the quantity of students in each class, class time, class size, time accessibility in each class and lecturer who in charge of the classes.
An Efficient Inductive Genetic Learning Algorithm for Fuzzy Relational Rules
Directory of Open Access Journals (Sweden)
Antonio
2012-04-01
Full Text Available Fuzzy modelling research has traditionally focused on certain types of fuzzy rules. However, the use of alternative rule models could improve the ability of fuzzy systems to represent a specific problem. In this proposal, an extended fuzzy rule model, that can include relations between variables in the antecedent of rules is presented. Furthermore, a learning algorithm based on the iterative genetic approach which is able to represent the knowledge using this model is proposed as well. On the other hand, potential relations among initial variables imply an exponential growth in the feasible rule search space. Consequently, two filters for detecting relevant potential relations are added to the learning algorithm. These filters allows to decrease the search space complexity and increase the algorithm efficiency. Finally, we also present an experimental study to demonstrate the benefits of using fuzzy relational rules.
An Airborne Conflict Resolution Approach Using a Genetic Algorithm
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.
Investigation of the three-dimensional lattice HP protein folding model using a genetic algorithm
Directory of Open Access Journals (Sweden)
Fábio L. Custódio
2004-01-01
Full Text Available An approach to the hydrophobic-polar (HP protein folding model was developed using a genetic algorithm (GA to find the optimal structures on a 3D cubic lattice. A modification was introduced to the scoring system of the original model to improve the model's capacity to generate more natural-like structures. The modification was based on the assumption that it may be preferable for a hydrophobic monomer to have a polar neighbor than to be in direct contact with the polar solvent. The compactness and the segregation criteria were used to compare structures created by the original HP model and by the modified one. An islands' algorithm, a new selection scheme and multiple-points crossover were used to improve the performance of the algorithm. Ten sequences, seven with length 27 and three with length 64 were analyzed. Our results suggest that the modified model has a greater tendency to form globular structures. This might be preferable, since the original HP model does not take into account the positioning of long polar segments. The algorithm was implemented in the form of a program with a graphical user interface that might have a didactical potential in the study of GA and on the understanding of hydrophobic core formation.
A cluster analysis on road traffic accidents using genetic algorithms
Saharan, Sabariah; Baragona, Roberto
2017-04-01
The analysis of traffic road accidents is increasingly important because of the accidents cost and public road safety. The availability or large data sets makes the study of factors that affect the frequency and severity accidents are viable. However, the data are often highly unbalanced and overlapped. We deal with the data set of the road traffic accidents recorded in Christchurch, New Zealand, from 2000-2009 with a total of 26440 accidents. The data is in a binary set and there are 50 factors road traffic accidents with four level of severity. We used genetic algorithm for the analysis because we are in the presence of a large unbalanced data set and standard clustering like k-means algorithm may not be suitable for the task. The genetic algorithm based on clustering for unknown K, (GCUK) has been used to identify the factors associated with accidents of different levels of severity. The results provided us with an interesting insight into the relationship between factors and accidents severity level and suggest that the two main factors that contributes to fatal accidents are "Speed greater than 60 km h" and "Did not see other people until it was too late". A comparison with the k-means algorithm and the independent component analysis is performed to validate the results.
Optimization-Based Image Segmentation by Genetic Algorithms
Directory of Open Access Journals (Sweden)
Rosenberger C
2008-01-01
Full Text Available Abstract Many works in the literature focus on the definition of evaluation metrics and criteria that enable to quantify the performance of an image processing algorithm. These evaluation criteria can be used to define new image processing algorithms by optimizing them. In this paper, we propose a general scheme to segment images by a genetic algorithm. The developed method uses an evaluation criterion which quantifies the quality of an image segmentation result. The proposed segmentation method can integrate a local ground truth when it is available in order to set the desired level of precision of the final result. A genetic algorithm is then used in order to determine the best combination of information extracted by the selected criterion. Then, we show that this approach can either be applied for gray-levels or multicomponents images in a supervised context or in an unsupervised one. Last, we show the efficiency of the proposed method through some experimental results on several gray-levels and multicomponents images.
Optimization-Based Image Segmentation by Genetic Algorithms
Directory of Open Access Journals (Sweden)
H. Laurent
2008-05-01
Full Text Available Many works in the literature focus on the definition of evaluation metrics and criteria that enable to quantify the performance of an image processing algorithm. These evaluation criteria can be used to define new image processing algorithms by optimizing them. In this paper, we propose a general scheme to segment images by a genetic algorithm. The developed method uses an evaluation criterion which quantifies the quality of an image segmentation result. The proposed segmentation method can integrate a local ground truth when it is available in order to set the desired level of precision of the final result. A genetic algorithm is then used in order to determine the best combination of information extracted by the selected criterion. Then, we show that this approach can either be applied for gray-levels or multicomponents images in a supervised context or in an unsupervised one. Last, we show the efficiency of the proposed method through some experimental results on several gray-levels and multicomponents images.
APPLICATION OF GENETIC ALGORITHMS FOR ROBUST PARAMETER OPTIMIZATION
Directory of Open Access Journals (Sweden)
N. Belavendram
2010-12-01
Full Text Available Parameter optimization can be achieved by many methods such as Monte-Carlo, full, and fractional factorial designs. Genetic algorithms (GA are fairly recent in this respect but afford a novel method of parameter optimization. In GA, there is an initial pool of individuals each with its own specific phenotypic trait expressed as a ‘genetic chromosome’. Different genes enable individuals with different fitness levels to reproduce according to natural reproductive gene theory. This reproduction is established in terms of selection, crossover and mutation of reproducing genes. The resulting child generation of individuals has a better fitness level akin to natural selection, namely evolution. Populations evolve towards the fittest individuals. Such a mechanism has a parallel application in parameter optimization. Factors in a parameter design can be expressed as a genetic analogue in a pool of sub-optimal random solutions. Allowing this pool of sub-optimal solutions to evolve over several generations produces fitter generations converging to a pre-defined engineering optimum. In this paper, a genetic algorithm is used to study a seven factor non-linear equation for a Wheatstone bridge as the equation to be optimized. A comparison of the full factorial design against a GA method shows that the GA method is about 1200 times faster in finding a comparable solution.
Application of mapping crossover genetic algorithm in nuclear power equipment optimization design
International Nuclear Information System (INIS)
Li Guijiang; Yan Changqi; Wang Jianjun; Liu Chengyang
2013-01-01
Genetic algorithm (GA) has been widely applied in nuclear engineering. An improved method, named the mapping crossover genetic algorithm (MCGA), was developed aiming at improving the shortcomings of traditional genetic algorithm (TGA). The optimal results of benchmark problems show that MCGA has better optimizing performance than TGA. MCGA was applied to the reactor coolant pump optimization design. (authors)
Directory of Open Access Journals (Sweden)
Mehrdad Mahdavi Jafari
2017-06-01
Full Text Available Among artificial intelligence approaches, artificial neural networks (ANNs and genetic algorithm (GA are widely applied for modification of materials property in engineering science in large scale modeling. In this work artificial neural network (ANN and genetic algorithm (GA were applied to find the optimal conditions for achieving the maximum hardness of Al6061 reinforced by multiwall carbon nanotubes (MWCNTs through modeling of nanocomposite characteristics. After examination the different ANN architectures an optimal structure of the model, i.e. 6-18-1, is obtained with 1.52% mean absolute error and R2 = 0.987. The proposed structure was used as fitting function for genetic algorithm. The results of GA simulation predicted that the combination sintering temperature 346 °C, sintering time 0.33 h, compact pressure 284.82 MPa, milling time 19.66 h and vial speed 310.5 rpm give the optimum hardness, (i.e., 87.5 micro Vickers in the composite with 0.53 wt% CNT. Also, sensitivity analysis shows that the sintering time, milling time, compact pressure, vial speed and amount of MWCNT are the significant parameter and sintering time is the most important parameter. Comparison of the predicted values with the experimental data revealed that the GA–ANN model is a powerful method to find the optimal conditions for preparing of Al6061-MWCNT.
Swarm, genetic and evolutionary programming algorithms applied to multiuser detection
Directory of Open Access Journals (Sweden)
Paul Jean Etienne Jeszensky
2005-02-01
Full Text Available In this paper, the particles swarm optimization technique, recently published in the literature, and applied to Direct Sequence/Code Division Multiple Access systems (DS/CDMA with multiuser detection (MuD is analyzed, evaluated and compared. The Swarm algorithm efficiency when applied to the DS-CDMA multiuser detection (Swarm-MuD is compared through the tradeoff performance versus computational complexity, being the complexity expressed in terms of the number of necessary operations in order to reach the performance obtained through the optimum detector or the Maximum Likelihood detector (ML. The comparison is accomplished among the genetic algorithm, evolutionary programming with cloning and Swarm algorithm under the same simulation basis. Additionally, it is proposed an heuristics-MuD complexity analysis through the number of computational operations. Finally, an analysis is carried out for the input parameters of the Swarm algorithm in the attempt to find the optimum parameters (or almost-optimum for the algorithm applied to the MuD problem.
Using Genetic Algorithms for Navigation Planning in Dynamic Environments
Directory of Open Access Journals (Sweden)
Ferhat Uçan
2012-01-01
Full Text Available Navigation planning can be considered as a combination of searching and executing the most convenient flight path from an initial waypoint to a destination waypoint. Generally the aim is to follow the flight path, which provides minimum fuel consumption for the air vehicle. For dynamic environments, constraints change dynamically during flight. This is a special case of dynamic path planning. As the main concern of this paper is flight planning, the conditions and objectives that are most probable to be used in navigation problem are considered. In this paper, the genetic algorithm solution of the dynamic flight planning problem is explained. The evolutionary dynamic navigation planning algorithm is developed for compensating the existing deficiencies of the other approaches. The existing fully dynamic algorithms process unit changes to topology one modification at a time, but when there are several such operations occurring in the environment simultaneously, the algorithms are quite inefficient. The proposed algorithm may respond to the concurrent constraint updates in a shorter time for dynamic environment. The most secure navigation of the air vehicle is planned and executed so that the fuel consumption is minimum.
A Parallel Genetic Algorithm for Automated Electronic Circuit Design
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
Segment-based dose optimization using a genetic algorithm
International Nuclear Information System (INIS)
Cotrutz, Cristian; Xing Lei
2003-01-01
Intensity modulated radiation therapy (IMRT) inverse planning is conventionally done in two steps. Firstly, the intensity maps of the treatment beams are optimized using a dose optimization algorithm. Each of them is then decomposed into a number of segments using a leaf-sequencing algorithm for delivery. An alternative approach is to pre-assign a fixed number of field apertures and optimize directly the shapes and weights of the apertures. While the latter approach has the advantage of eliminating the leaf-sequencing step, the optimization of aperture shapes is less straightforward than that of beamlet-based optimization because of the complex dependence of the dose on the field shapes, and their weights. In this work we report a genetic algorithm for segment-based optimization. Different from a gradient iterative approach or simulated annealing, the algorithm finds the optimum solution from a population of candidate plans. In this technique, each solution is encoded using three chromosomes: one for the position of the left-bank leaves of each segment, the second for the position of the right-bank and the third for the weights of the segments defined by the first two chromosomes. The convergence towards the optimum is realized by crossover and mutation operators that ensure proper exchange of information between the three chromosomes of all the solutions in the population. The algorithm is applied to a phantom and a prostate case and the results are compared with those obtained using beamlet-based optimization. The main conclusion drawn from this study is that the genetic optimization of segment shapes and weights can produce highly conformal dose distribution. In addition, our study also confirms previous findings that fewer segments are generally needed to generate plans that are comparable with the plans obtained using beamlet-based optimization. Thus the technique may have useful applications in facilitating IMRT treatment planning
Optimization of tokamak plasma equilibrium shape using parallel genetic algorithms
International Nuclear Information System (INIS)
Zhulin An; Bin Wu; Lijian Qiu
2006-01-01
In the device of non-circular cross sectional tokamaks, the plasma equilibrium shape has a strong influence on the confinement and MHD stability. The plasma equilibrium shape is determined by the configuration of the poloidal field (PF) system. Usually there are many PF systems that could support the specified plasma equilibrium, the differences are the number of coils used, their positions, sizes and currents. It is necessary to find the optimal choice that meets the engineering constrains, which is often done by a constrained optimization. The Genetic Algorithms (GAs) based method has been used to solve the problem of the optimization, but the time complexity limits the algorithms to become widely used. Due to the large search space that the optimization has, it takes several hours to get a nice result. The inherent parallelism in GAs can be exploited to enhance their search efficiency. In this paper, we introduce a parallel genetic algorithms (PGAs) based approach which can reduce the computational time. The algorithm has a master-slave structure, the slave explore the search space separately and return the results to the master. A program is also developed, and it can be running on any computers which support massage passing interface. Both the algorithm and the program are detailed discussed in the paper. We also include an application that uses the program to determine the positions and currents of PF coils in EAST. The program reach the target value within half an hour and yield a speedup rate of 5.21 on 8 CPUs. (author)
Automatic Data Filter Customization Using a Genetic Algorithm
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.
Directory of Open Access Journals (Sweden)
Johan Soewanda
2007-01-01
Full Text Available This paper discusses the application of Robust Hybrid Genetic Algorithm to solve a flow-shop scheduling problem. The proposed algorithm attempted to reach minimum makespan. PT. FSCM Manufacturing Indonesia Plant 4's case was used as a test case to evaluate the performance of the proposed algorithm. The proposed algorithm was compared to Ant Colony, Genetic-Tabu, Hybrid Genetic Algorithm, and the company's algorithm. We found that Robust Hybrid Genetic produces statistically better result than the company's, but the same as Ant Colony, Genetic-Tabu, and Hybrid Genetic. In addition, Robust Hybrid Genetic Algorithm required less computational time than Hybrid Genetic Algorithm
Optimal Design of Passive Power Filters Based on Pseudo-parallel Genetic Algorithm
Li, Pei; Li, Hongbo; Gao, Nannan; Niu, Lin; Guo, Liangfeng; Pei, Ying; Zhang, Yanyan; Xu, Minmin; Chen, Kerui
2017-05-01
The economic costs together with filter efficiency are taken as targets to optimize the parameter of passive filter. Furthermore, the method of combining pseudo-parallel genetic algorithm with adaptive genetic algorithm is adopted in this paper. In the early stages pseudo-parallel genetic algorithm is introduced to increase the population diversity, and adaptive genetic algorithm is used in the late stages to reduce the workload. At the same time, the migration rate of pseudo-parallel genetic algorithm is improved to change with population diversity adaptively. Simulation results show that the filter designed by the proposed method has better filtering effect with lower economic cost, and can be used in engineering.
Directory of Open Access Journals (Sweden)
Ashutosh K. AGARWAL
2011-10-01
Full Text Available Genetic algorithms are robust search techniques based on the principles of evolution. A genetic algorithm maintains a population of encoded solutions and guides the population towards the optimum solution. This important property of genetic algorithm is used in this paper to stabilize the Inverted pendulum system. This paper highlights the application and stability of inverted pendulum using PID controller with fuzzy logic genetic algorithm supervisor . There are a large number of well established search techniques in use within the information technology industry. We propose a method to control inverted pendulum steady state error and overshoot using genetic algorithm technique.
Optimal design of link systems using successive zooming genetic algorithm
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.
Articulated Human Motion Tracking Using Sequential Immune Genetic Algorithm
Directory of Open Access Journals (Sweden)
Yi Li
2013-01-01
Full Text Available We formulate human motion tracking as a high-dimensional constrained optimization problem. A novel generative method is proposed for human motion tracking in the framework of evolutionary computation. The main contribution is that we introduce immune genetic algorithm (IGA for pose optimization in latent space of human motion. Firstly, we perform human motion analysis in the learnt latent space of human motion. As the latent space is low dimensional and contents the prior knowledge of human motion, it makes pose analysis more efficient and accurate. Then, in the search strategy, we apply IGA for pose optimization. Compared with genetic algorithm and other evolutionary methods, its main advantage is the ability to use the prior knowledge of human motion. We design an IGA-based method to estimate human pose from static images for initialization of motion tracking. And we propose a sequential IGA (S-IGA algorithm for motion tracking by incorporating the temporal continuity information into the traditional IGA. Experimental results on different videos of different motion types show that our IGA-based pose estimation method can be used for initialization of motion tracking. The S-IGA-based motion tracking method can achieve accurate and stable tracking of 3D human motion.
Ebtehaj, Isa; Bonakdari, Hossein
2014-01-01
The existence of sediments in wastewater greatly affects the performance of the sewer and wastewater transmission systems. Increased sedimentation in wastewater collection systems causes problems such as reduced transmission capacity and early combined sewer overflow. The article reviews the performance of the genetic algorithm (GA) and imperialist competitive algorithm (ICA) in minimizing the target function (mean square error of observed and predicted Froude number). To study the impact of bed load transport parameters, using four non-dimensional groups, six different models have been presented. Moreover, the roulette wheel selection method is used to select the parents. The ICA with root mean square error (RMSE) = 0.007, mean absolute percentage error (MAPE) = 3.5% show better results than GA (RMSE = 0.007, MAPE = 5.6%) for the selected model. All six models return better results than the GA. Also, the results of these two algorithms were compared with multi-layer perceptron and existing equations.
Françoise Benz
2004-01-01
ACADEMIC TRAINING LECTURE REGULAR PROGRAMME 1, 2, 3 and 4 June From 11:00 hrs to 12:00 hrs - Main Auditorium bldg. 500 Evolutionary Heuristic Optimization: Genetic Algorithms and Estimation of Distribution Algorithms V. Robles Forcada and M. Perez Hernandez / Univ. de Madrid, Spain In the real world, there exist a huge number of problems that require getting an optimum or near-to-optimum solution. Optimization can be used to solve a lot of different problems such as network design, sets and partitions, storage and retrieval or scheduling. On the other hand, in nature, there exist many processes that seek a stable state. These processes can be seen as natural optimization processes. Over the last 30 years several attempts have been made to develop optimization algorithms, which simulate these natural optimization processes. These attempts have resulted in methods such as Simulated Annealing, based on natural annealing processes or Evolutionary Computation, based on biological evolution processes. Geneti...
Françoise Benz
2004-01-01
ENSEIGNEMENT ACADEMIQUE ACADEMIC TRAINING Françoise Benz 73127 academic.training@cern.ch ACADEMIC TRAINING LECTURE REGULAR PROGRAMME 1, 2, 3 and 4 June From 11:00 hrs to 12:00 hrs - Main Auditorium bldg. 500 Evolutionary Heuristic Optimization: Genetic Algorithms and Estimation of Distribution Algorithms V. Robles Forcada and M. Perez Hernandez / Univ. de Madrid, Spain In the real world, there exist a huge number of problems that require getting an optimum or near-to-optimum solution. Optimization can be used to solve a lot of different problems such as network design, sets and partitions, storage and retrieval or scheduling. On the other hand, in nature, there exist many processes that seek a stable state. These processes can be seen as natural optimization processes. Over the last 30 years several attempts have been made to develop optimization algorithms, which simulate these natural optimization processes. These attempts have resulted in methods such as Simulated Annealing, based on nat...
High-Speed General Purpose Genetic Algorithm Processor.
Hoseini Alinodehi, Seyed Pourya; Moshfe, Sajjad; Saber Zaeimian, Masoumeh; Khoei, Abdollah; Hadidi, Khairollah
2016-07-01
In this paper, an ultrafast steady-state genetic algorithm processor (GAP) is presented. Due to the heavy computational load of genetic algorithms (GAs), they usually take a long time to find optimum solutions. Hardware implementation is a significant approach to overcome the problem by speeding up the GAs procedure. Hence, we designed a digital CMOS implementation of GA in [Formula: see text] process. The proposed processor is not bounded to a specific application. Indeed, it is a general-purpose processor, which is capable of performing optimization in any possible application. Utilizing speed-boosting techniques, such as pipeline scheme, parallel coarse-grained processing, parallel fitness computation, parallel selection of parents, dual-population scheme, and support for pipelined fitness computation, the proposed processor significantly reduces the processing time. Furthermore, by relying on a built-in discard operator the proposed hardware may be used in constrained problems that are very common in control applications. In the proposed design, a large search space is achievable through the bit string length extension of individuals in the genetic population by connecting the 32-bit GAPs. In addition, the proposed processor supports parallel processing, in which the GAs procedure can be run on several connected processors simultaneously.
An Improved Chaos Genetic Algorithm for T-Shaped MIMO Radar Antenna Array Optimization
Directory of Open Access Journals (Sweden)
Xin Fu
2014-01-01
Full Text Available In view of the fact that the traditional genetic algorithm easily falls into local optimum in the late iterations, an improved chaos genetic algorithm employed chaos theory and genetic algorithm is presented to optimize the low side-lobe for T-shaped MIMO radar antenna array. The novel two-dimension Cat chaotic map has been put forward to produce its initial population, improving the diversity of individuals. The improved Tent map is presented for groups of individuals of a generation with chaos disturbance. Improved chaotic genetic algorithm optimization model is established. The algorithm presented in this paper not only improved the search precision, but also avoids effectively the problem of local convergence and prematurity. For MIMO radar, the improved chaos genetic algorithm proposed in this paper obtains lower side-lobe level through optimizing the exciting current amplitude. Simulation results show that the algorithm is feasible and effective. Its performance is superior to the traditional genetic algorithm.
Sastry, Kumara Narasimha
2007-03-01
building blocks in organic chemistry---indicate that MOGAs produce High-quality semiempirical methods that (1) are stable to small perturbations, (2) yield accurate configuration energies on untested and critical excited states, and (3) yield ab initio quality excited-state dynamics. The proposed method enables simulations of more complex systems to realistic, multi-picosecond timescales, well beyond previous attempts or expectation of human experts, and 2--3 orders-of-magnitude reduction in computational cost. While the two applications use simple evolutionary operators, in order to tackle more complex systems, their scalability and limitations have to be investigated. The second part of the thesis addresses some of the challenges involved with a successful design of genetic algorithms and genetic programming for multiscale modeling. The first issue addressed is the scalability of genetic programming, where facetwise models are built to assess the population size required by GP to ensure adequate supply of raw building blocks and also to ensure accurate decision-making between competing building blocks. This study also presents a design of competent genetic programming, where traditional fixed recombination operators are replaced by building and sampling probabilistic models of promising candidate programs. The proposed scalable GP, called extended compact GP (eCGP), combines the ideas from extended compact genetic algorithm (eCGA) and probabilistic incremental program evolution (PIPE) and adaptively identifies, propagates and exchanges important subsolutions of a search problem. Results show that eCGP scales cubically with problem size on both GP-easy and GP-hard problems. Finally, facetwise models are developed to explore limitations of scalability of MOGAs, where the scalability of multiobjective algorithms in reliably maintaining Pareto-optimal solutions is addressed. The results show that even when the building blocks are accurately identified, massive multimodality
Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments
Directory of Open Access Journals (Sweden)
Kairong Duan
2018-05-01
Full Text Available Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task scheduling is a process of mapping cloud tasks to Virtual Machines (VMs. When binding the tasks to VMs, the scheduling strategy has an important influence on the efficiency of datacenter and related energy consumption. Although many traditional scheduling algorithms have been applied in various platforms, they may not work efficiently due to the large number of user requests, the variety of computation resources and complexity of Cloud environment. In this paper, we tackle the task scheduling problem which aims to minimize makespan by Genetic Algorithm (GA. We propose an incremental GA which has adaptive probabilities of crossover and mutation. The mutation and crossover rates change according to generations and also vary between individuals. Large numbers of tasks are randomly generated to simulate various scales of task scheduling problem in Cloud environment. Based on the instance types of Amazon EC2, we implemented virtual machines with different computing capacity on CloudSim. We compared the performance of the adaptive incremental GA with that of Standard GA, Min-Min, Max-Min , Simulated Annealing and Artificial Bee Colony Algorithm in finding the optimal scheme. Experimental results show that the proposed algorithm can achieve feasible solutions which have acceptable makespan with less computation time.
Optimization in optical systems revisited: Beyond genetic algorithms
Gagnon, Denis; Dumont, Joey; Dubé, Louis
2013-05-01
Designing integrated photonic devices such as waveguides, beam-splitters and beam-shapers often requires optimization of a cost function over a large solution space. Metaheuristics - algorithms based on empirical rules for exploring the solution space - are specifically tailored to those problems. One of the most widely used metaheuristics is the standard genetic algorithm (SGA), based on the evolution of a population of candidate solutions. However, the stochastic nature of the SGA sometimes prevents access to the optimal solution. Our goal is to show that a parallel tabu search (PTS) algorithm is more suited to optimization problems in general, and to photonics in particular. PTS is based on several search processes using a pool of diversified initial solutions. To assess the performance of both algorithms (SGA and PTS), we consider an integrated photonics design problem, the generation of arbitrary beam profiles using a two-dimensional waveguide-based dielectric structure. The authors acknowledge financial support from the Natural Sciences and Engineering Research Council of Canada (NSERC).
Marine Traffic Optimization Using Petri Net and Genetic Algorithm
Directory of Open Access Journals (Sweden)
Anita Gudelj
2012-11-01
Full Text Available The paper deals with the traffic control and job optimization in the marine canal system. The moving of vessels can be described as a set of discrete events and states. Some of these states can be undesirable such as conflicts and deadlocks. It is necessary to apply adequate control policy to avoid deadlocks and blocks the vessels’ moving only in the case of dangerous situation. This paper addresses the use of Petri net as modelling and scheduling tool in this context. To find better solutions the authors propose the integration of Petri net with a genetic algorithm. Also, a matrix based formal method is proposed for analyzing discrete event dynamic system (DEDS. The algorithm is developed to deal with multi-project, multi-constrained scheduling problem with shared resources. It is verified by a computer simulation using MATLAB environment.
Genetic Algorithms: A New Method for Neutron Beam Spectral Characterization
International Nuclear Information System (INIS)
David W. Freeman
2000-01-01
A revolutionary new concept for solving the neutron spectrum unfolding problem using genetic algorithms (GAs) has recently been introduced. GAs are part of a new field of evolutionary solution techniques that mimic living systems with computer-simulated chromosome solutions that mate, mutate, and evolve to create improved solutions. The original motivation for the research was to improve spectral characterization of neutron beams associated with boron neutron capture therapy (BNCT). The GA unfolding technique has been successfully applied to problems with moderate energy resolution (up to 47 energy groups). Initial research indicates that the GA unfolding technique may well be superior to popular unfolding methods in common use. Research now under way at Kansas State University is focused on optimizing the unfolding algorithm and expanding its energy resolution to unfold detailed beam spectra based on multiple foil measurements. Indications are that the final code will significantly outperform current, state-of-the-art codes in use by the scientific community
Optimal Design of a Hydrogen Community by Genetic Algorithms
International Nuclear Information System (INIS)
Rodolfo Dufo Lopez; Jose Luis Bernal Agustin; Luis Correas Uson; Ismael Aso Aguarta
2006-01-01
A study was conducted for the implementation of two Hydrogen Communities, following the recommendations of the HY-COM initiative of the European Commission. The proposed communities find their place in the municipality of Sabinanigo (Aragon, Spain). Two cases are analyzed, one off-grid village house near Sabinanigo, and a house situated in the town proper. The study was carried out with the HOGA program, Hybrid Optimization by Genetic Algorithms. A description is provided for the algorithms. The off-grid study deals with a hybrid pv-wind system with hydrogen storage for AC supply to an isolated house. The urban study is related to hydrogen production by means of hybrid renewable sources available locally (photovoltaic, wind and hydro). These complement the existing industrial electrolysis processes, in order to cater for the energy requirements of a small fleet of municipal hydrogen-powered vehicles. HOGA was used to optimize both hybrid systems. Dimensioning and deployment estimations are also provided. (authors)
Optimal Design of a Hydrogen Community by Genetic Algorithms
International Nuclear Information System (INIS)
Rodolfo Dufo Lopeza; Jose Luis Bernal Agustin; Luis Correas Uson; Ismael Aso Aguarta
2006-01-01
A study was conducted for the implementation of two Hydrogen Communities, following the recommendations of the HY-COM initiative of the European Commission. The proposed communities find their place in the municipality of Sabinanigo (Aragon, Spain). Two cases are analyzed, one off-grid village house near Sabinanigo, and a house situated in the town proper. The study was carried out with the HOGA program, Hybrid Optimization by Genetic Algorithms. A description is provided for the algorithms. The off-grid study deals with a hybrid PV-wind system with hydrogen storage for AC supply to an isolated house. The urban study is related to hydrogen production by means of hybrid renewable sources available locally (photovoltaic, wind and hydro). These complement the existing industrial electrolysis processes, in order to cater for the energy requirements of a small fleet of municipal hydrogen-powered vehicles. HOGA was used to optimize both hybrid systems. Dimensioning and deployment estimations are also provided. (authors)
Solving “Antenna Array Thinning Problem” Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Rajashree Jain
2012-01-01
Full Text Available Thinning involves reducing total number of active elements in an antenna array without causing major degradation in system performance. Dynamic thinning is the process of achieving this under real-time conditions. It is required to find a strategic subset of antenna elements for thinning so as to have its optimum performance. From a mathematical perspective this is a nonlinear, multidimensional problem with multiple objectives and many constraints. Solution for such problem cannot be obtained by classical analytical techniques. It will be required to employ some type of search algorithm which can lead to a practical solution in an optimal. The present paper discusses an approach of using genetic algorithm for array thinning. After discussing the basic concept involving antenna array, array thinning, dynamic thinning, and application methodology, simulation results of applying the technique to linear and planar arrays are presented.
Application of genetic algorithms to tuning fuzzy control systems
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.
A New Adaptive Hungarian Mating Scheme in Genetic Algorithms
Directory of Open Access Journals (Sweden)
Chanju Jung
2016-01-01
Full Text Available In genetic algorithms, selection or mating scheme is one of the important operations. In this paper, we suggest an adaptive mating scheme using previously suggested Hungarian mating schemes. Hungarian mating schemes consist of maximizing the sum of mating distances, minimizing the sum, and random matching. We propose an algorithm to elect one of these Hungarian mating schemes. Every mated pair of solutions has to vote for the next generation mating scheme. The distance between parents and the distance between parent and offspring are considered when they vote. Well-known combinatorial optimization problems, the traveling salesperson problem, and the graph bisection problem are used for the test bed of our method. Our adaptive strategy showed better results than not only pure and previous hybrid schemes but also existing distance-based mating schemes.
Genetic algorithms for optimal design and control of adaptive structures
Ribeiro, R; Dias-Rodrigues, J; Vaz, M
2000-01-01
Future High Energy Physics experiments require the use of light and stable structures to support their most precise radiation detection elements. These large structures must be light, highly stable, stiff and radiation tolerant in an environment where external vibrations, high radiation levels, material aging, temperature and humidity gradients are not negligible. Unforeseen factors and the unknown result of the coupling of environmental conditions, together with external vibrations, may affect the position stability of the detectors and their support structures compromising their physics performance. Careful optimization of static and dynamic behavior must be an essential part of the engineering design. Genetic Algorithms ( GA) belong to the group of probabilistic algorithms, combining elements of direct and stochastic search. They are more robust than existing directed search methods with the advantage of maintaining a population of potential solutions. There is a class of optimization problems for which Ge...
Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem
Directory of Open Access Journals (Sweden)
Cheng Chen
2014-01-01
Full Text Available Selection and scheduling are an important topic in production systems. To tackle the order acceptance and scheduling problem on a single machine with release dates, tardiness penalty, and sequence-dependent setup times, in this paper a diversity controlling genetic algorithm (DCGA is proposed, in which a diversified population is maintained during the whole search process through survival selection considering both the fitness and the diversity of individuals. To measure the similarity between individuals, a modified Hamming distance without considering the unaccepted orders in the chromosome is adopted. The proposed DCGA was validated on 1500 benchmark instances with up to 100 orders. Compared with the state-of-the-art algorithms, the experimental results show that DCGA improves the solution quality obtained significantly, in terms of the deviation from upper bound.
Model parameters estimation and sensitivity by genetic algorithms
International Nuclear Information System (INIS)
Marseguerra, Marzio; Zio, Enrico; Podofillini, Luca
2003-01-01
In this paper we illustrate the possibility of extracting qualitative information on the importance of the parameters of a model in the course of a Genetic Algorithms (GAs) optimization procedure for the estimation of such parameters. The Genetic Algorithms' search of the optimal solution is performed according to procedures that resemble those of natural selection and genetics: an initial population of alternative solutions evolves within the search space through the four fundamental operations of parent selection, crossover, replacement, and mutation. During the search, the algorithm examines a large amount of solution points which possibly carries relevant information on the underlying model characteristics. A possible utilization of this information amounts to create and update an archive with the set of best solutions found at each generation and then to analyze the evolution of the statistics of the archive along the successive generations. From this analysis one can retrieve information regarding the speed of convergence and stabilization of the different control (decision) variables of the optimization problem. In this work we analyze the evolution strategy followed by a GA in its search for the optimal solution with the aim of extracting information on the importance of the control (decision) variables of the optimization with respect to the sensitivity of the objective function. The study refers to a GA search for optimal estimates of the effective parameters in a lumped nuclear reactor model of literature. The supporting observation is that, as most optimization procedures do, the GA search evolves towards convergence in such a way to stabilize first the most important parameters of the model and later those which influence little the model outputs. In this sense, besides estimating efficiently the parameters values, the optimization approach also allows us to provide a qualitative ranking of their importance in contributing to the model output. The
Transitioning from Targeted to Comprehensive Mass Spectrometry Using Genetic Algorithms.
Jaffe, Jacob D; Feeney, Caitlin M; Patel, Jinal; Lu, Xiaodong; Mani, D R
2016-11-01
Targeted proteomic assays are becoming increasingly popular because of their robust quantitative applications enabled by internal standardization, and they can be routinely executed on high performance mass spectrometry instrumentation. However, these assays are typically limited to 100s of analytes per experiment. Considerable time and effort are often expended in obtaining and preparing samples prior to targeted analyses. It would be highly desirable to detect and quantify 1000s of analytes in such samples using comprehensive mass spectrometry techniques (e.g., SWATH and DIA) while retaining a high degree of quantitative rigor for analytes with matched internal standards. Experimentally, it is facile to port a targeted assay to a comprehensive data acquisition technique. However, data analysis challenges arise from this strategy concerning agreement of results from the targeted and comprehensive approaches. Here, we present the use of genetic algorithms to overcome these challenges in order to configure hybrid targeted/comprehensive MS assays. The genetic algorithms are used to select precursor-to-fragment transitions that maximize the agreement in quantification between the targeted and the comprehensive methods. We find that the algorithm we used provided across-the-board improvement in the quantitative agreement between the targeted assay data and the hybrid comprehensive/targeted assay that we developed, as measured by parameters of linear models fitted to the results. We also found that the algorithm could perform at least as well as an independently-trained mass spectrometrist in accomplishing this task. We hope that this approach will be a useful tool in the development of quantitative approaches for comprehensive proteomics techniques. Graphical Abstract ᅟ.
Optimization of antibacterial peptides by genetic algorithms and cheminformatics
DEFF Research Database (Denmark)
Fjell, Christopher D.; Jenssen, Håvard; Cheung, Warren A.
2011-01-01
Pathogens resistant to available drug therapies are a pressing global health problem. Short, cationic peptides represent a novel class of agents that have lower rates of drug resistance than derivatives of current antibiotics. Previously, we created a software system utilizing artificial neural...... 47 of the top rated 50 peptides chosen from an in silico library of nearly 100 000 sequences. Here, we report a method of generating candidate peptide sequences using the heuristic evolutionary programming method of genetic algorithms (GA), which provided a large (19-fold) improvement...
A Hybrid Genetic Algorithm for the Multiple Crossdocks Problem
Directory of Open Access Journals (Sweden)
Zhaowei Miao
2012-01-01
Full Text Available We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be NP-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure, we propose a hybrid genetic algorithm (HGA integrating greedy technique and variable neighborhood search method to solve the problem. Extensive experiments under different scenarios were conducted, and results show that HGA outperforms CPLEX solver, providing solutions in realistic timescales.
Improvement in PWR automatic optimization reloading methods using genetic algorithm
International Nuclear Information System (INIS)
Levine, S.H.; Ivanov, K.; Feltus, M.
1996-01-01
The objective of using automatic optimized reloading methods is to provide the Nuclear Engineer with an efficient method for reloading a nuclear reactor which results in superior core configurations that minimize fuel costs. Previous methods developed by Levine et al required a large effort to develop the initial core loading using a priority loading scheme. Subsequent modifications to this core configuration were made using expert rules to produce the final core design. Improvements in this technique have been made by using a genetic algorithm to produce improved core reload designs for PWRs more efficiently (authors)
Parallel genetic algorithm as a tool for nuclear reactors reload
International Nuclear Information System (INIS)
Santos, Darley Roberto G.; Schirru, Roberto
1999-01-01
This work intends to present a tool which can be used by designers in order to get better solutions, in terms of computational costs, to solve problems of nuclear reactor reloads. It is known that the project of nuclear fuel reload is a complex combinatorial one. Generally, iterative processes are the most used ones because they generate answers to satisfy all restrictions. The model presented here uses Artificial Intelligence techniques, more precisely Genetic Algorithms techniques, mixed with parallelization techniques.Test of the tool presented here were highly satisfactory, due to a considerable reduction in computational time. (author)
A New Approach to Tuning Heuristic Parameters of Genetic Algorithms
Czech Academy of Sciences Publication Activity Database
Holeňa, Martin
2006-01-01
Roč. 3, č. 3 (2006), s. 562-569 ISSN 1790-0832. [AIKED'06. WSEAS International Conference on Artificial Intelligence , Knowledge Engineering and Data Bases. Madrid, 15.02.2006-17.02.2006] R&D Projects: GA ČR(CZ) GA201/05/0325; GA ČR(CZ) GA201/05/0557 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary optimization * genetic algorithms * heuristic parameters * parameter tuning * artificial neural networks * convergence speed * population diversity Subject RIV: IN - Informatics, Computer Science
Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm
Yu, Lifang; Zhao, Yao; Ni, Rongrong; Li, Ting
2010-12-01
We propose a novel steganographic method in JPEG images with high performance. Firstly, we propose improved adaptive LSB steganography, which can achieve high capacity while preserving the first-order statistics. Secondly, in order to minimize visual degradation of the stego image, we shuffle bits-order of the message based on chaos whose parameters are selected by the genetic algorithm. Shuffling message's bits-order provides us with a new way to improve the performance of steganography. Experimental results show that our method outperforms classical steganographic methods in image quality, while preserving characteristics of histogram and providing high capacity.
Optimal Parameter Selection of Power System Stabilizer using Genetic Algorithm
Energy Technology Data Exchange (ETDEWEB)
Chung, Hyeng Hwan; Chung, Dong Il; Chung, Mun Kyu [Dong-AUniversity (Korea); Wang, Yong Peel [Canterbury Univeristy (New Zealand)
1999-06-01
In this paper, it is suggested that the selection method of optimal parameter of power system stabilizer (PSS) with robustness in low frequency oscillation for power system using real variable elitism genetic algorithm (RVEGA). The optimal parameters were selected in the case of power system stabilizer with one lead compensator, and two lead compensator. Also, the frequency responses characteristics of PSS, the system eigenvalues criterion and the dynamic characteristics were considered in the normal load and the heavy load, which proved usefulness of RVEGA compare with Yu's compensator design theory. (author). 20 refs., 15 figs., 8 tabs.
Introduction to the application of genetic algorithms in engineering
Directory of Open Access Journals (Sweden)
I. S. Shaw
1998-07-01
Full Text Available Genetic algorithms constitute a new research area in the field of artificial intelligence. This work is aimed at their application in specific areas of engineering where good results have already been achieved. The purpose of this work is to provide a basic introduction for students as well as experienced engineers who wish to upgrade their knowledge. A distinctive feature of artificial intelligence is that instead of mathematical models, either direct human experience or certain functions of the human brain for the modelling of physical phenomena are used.
Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm
Directory of Open Access Journals (Sweden)
Yu Lifang
2010-01-01
Full Text Available We propose a novel steganographic method in JPEG images with high performance. Firstly, we propose improved adaptive LSB steganography, which can achieve high capacity while preserving the first-order statistics. Secondly, in order to minimize visual degradation of the stego image, we shuffle bits-order of the message based on chaos whose parameters are selected by the genetic algorithm. Shuffling message's bits-order provides us with a new way to improve the performance of steganography. Experimental results show that our method outperforms classical steganographic methods in image quality, while preserving characteristics of histogram and providing high capacity.
Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
Directory of Open Access Journals (Sweden)
Li Rui
2017-07-01
Full Text Available It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.
Parameterization of interatomic potential by genetic algorithms: A case study
Energy Technology Data Exchange (ETDEWEB)
Ghosh, Partha S., E-mail: psghosh@barc.gov.in; Arya, A.; Dey, G. K. [Materials Science Division, Bhabha Atomic Research Centre, Mumbai-400085 (India); Ranawat, Y. S. [Department of Ceramic Engineering, Indian Institute of Technology (BHU), Varanasi-221005 (India)
2015-06-24
A framework for Genetic Algorithm based methodology is developed to systematically obtain and optimize parameters for interatomic force field functions for MD simulations by fitting to a reference data base. This methodology is applied to the fitting of ThO{sub 2} (CaF{sub 2} prototype) – a representative of ceramic based potential fuel for nuclear applications. The resulting GA optimized parameterization of ThO{sub 2} is able to capture basic structural, mechanical, thermo-physical properties and also describes defect structures within the permissible range.
Improvement in PWR automatic optimization reloading methods using genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Levine, S H; Ivanov, K; Feltus, M [Pennsylvania State Univ., University Park, PA (United States)
1996-12-01
The objective of using automatic optimized reloading methods is to provide the Nuclear Engineer with an efficient method for reloading a nuclear reactor which results in superior core configurations that minimize fuel costs. Previous methods developed by Levine et al required a large effort to develop the initial core loading using a priority loading scheme. Subsequent modifications to this core configuration were made using expert rules to produce the final core design. Improvements in this technique have been made by using a genetic algorithm to produce improved core reload designs for PWRs more efficiently (authors).
Asset management using genetic algorithm: Evidence from Tehran Stock Exchange
Directory of Open Access Journals (Sweden)
Abbas Sarijaloo
2014-02-01
Full Text Available This paper presents an empirical investigation to study the effect of market management using Markowitz theorem. The study uses the information of 50 best performers on Tehran Stock Exchange over the period 2006-2009 and, using Markowitz theorem, the efficient asset allocation are determined and the result are analyzed. The proposed model of this paper has been solved using genetic algorithm. The results indicate that Tehran Stock Exchange has managed to perform much better than average world market in most years of studies especially on year 2009. The results of our investigation have also indicated that one could reach outstanding results using GA and forming efficient portfolio.
Nuclear power control system design using genetic algorithm
International Nuclear Information System (INIS)
Lee, Yoon Joon; Cho, Kyung Ho
1996-01-01
The genetic algorithm(GA) is applied to the design of the nuclear power control system. The reactor control system model is described in the LQR configuration. The LQR system order is increased to make the tracking system. The key parameters of the design are weighting matrices, and these are usually determined through numerous simulations in the conventional design. To determine the more objective and optimal weightings, the improved GA is applied. The results show that the weightings determined by the GA yield the better system responses than those obtained by the conventional design method
GPGPU Implementation of a Genetic Algorithm for Stereo Refinement
Directory of Open Access Journals (Sweden)
Álvaro Arranz
2015-03-01
Full Text Available During the last decade, the general-purpose computing on graphics processing units Graphics (GPGPU has turned out to be a useful tool for speeding up many scientific calculations. Computer vision is known to be one of the fields with more penetration of these new techniques. This paper explores the advantages of using GPGPU implementation to speedup a genetic algorithm used for stereo refinement. The main contribution of this paper is analyzing which genetic operators take advantage of a parallel approach and the description of an efficient state- of-the-art implementation for each one. As a result, speed-ups close to x80 can be achieved, demonstrating to be the only way of achieving close to real-time performance.
Research on fault diagnosis of nuclear power plants based on genetic algorithms and fuzzy logic
International Nuclear Information System (INIS)
Zhou Yangping; Zhao Bingquan
2001-01-01
Based on genetic algorithms and fuzzy logic and using expert knowledge, mini-knowledge tree model and standard signals from simulator, a new fuzzy-genetic method is developed to fault diagnosis in nuclear power plants. A new replacement method of genetic algorithms is adopted. Fuzzy logic is used to calculate the fitness of the strings in genetic algorithms. Experiments on the simulator show it can deal with the uncertainty and the fuzzy factor
Generation of Compliant Mechanisms using Hybrid Genetic Algorithm
Sharma, D.; Deb, K.
2014-10-01
Compliant mechanism is a single piece elastic structure which can deform to perform the assigned task. In this work, compliant mechanisms are evolved using a constraint based bi-objective optimization formulation which requires one user defined parameter ( η). This user defined parameter limits a gap between a desired path and an actual path traced by the compliant mechanism. The non-linear and discrete optimization problems are solved using the hybrid Genetic Algorithm (GA) wherein domain specific initialization, two-dimensional crossover operator and repairing techniques are adopted. A bit-wise local search method is used with elitist non-dominated sorting genetic algorithm to further refine the compliant mechanisms. Parallel computations are performed on the master-slave architecture to reduce the computation time. A parametric study is carried out for η value which suggests a range to evolve topologically different compliant mechanisms. The applied and boundary conditions to the compliant mechanisms are considered the variables that are evolved by the hybrid GA. The post-analysis of results unveils that the complaint mechanisms are always supported at unique location that can evolve the non-dominated solutions.
A genetic algorithm approach to recognition and data mining
Energy Technology Data Exchange (ETDEWEB)
Punch, W.F.; Goodman, E.D.; Min, Pei [Michigan State Univ., East Lansing, MI (United States)] [and others
1996-12-31
We review here our use of genetic algorithm (GA) and genetic programming (GP) techniques to perform {open_quotes}data mining,{close_quotes} the discovery of particular/important data within large datasets, by finding optimal data classifications using known examples. Our first experiments concentrated on the use of a K-nearest neighbor algorithm in combination with a GA. The GA selected weights for each feature so as to optimize knn classification based on a linear combination of features. This combined GA-knn approach was successfully applied to both generated and real-world data. We later extended this work by substituting a GP for the GA. The GP-knn could not only optimize data classification via linear combinations of features but also determine functional relationships among the features. This allowed for improved performance and new information on important relationships among features. We review the effectiveness of the overall approach on examples from biology and compare the effectiveness of the GA and GP.
Towards Merging Binary Integer Programming Techniques with Genetic Algorithms
Directory of Open Access Journals (Sweden)
Reza Zamani
2017-01-01
Full Text Available This paper presents a framework based on merging a binary integer programming technique with a genetic algorithm. The framework uses both lower and upper bounds to make the employed mathematical formulation of a problem as tight as possible. For problems whose optimal solutions cannot be obtained, precision is traded with speed through substituting the integrality constrains in a binary integer program with a penalty. In this way, instead of constraining a variable u with binary restriction, u is considered as real number between 0 and 1, with the penalty of Mu(1-u, in which M is a large number. Values not near to the boundary extremes of 0 and 1 make the component of Mu(1-u large and are expected to be avoided implicitly. The nonbinary values are then converted to priorities, and a genetic algorithm can use these priorities to fill its initial pool for producing feasible solutions. The presented framework can be applied to many combinatorial optimization problems. Here, a procedure based on this framework has been applied to a scheduling problem, and the results of computational experiments have been discussed, emphasizing the knowledge generated and inefficiencies to be circumvented with this framework in future.
Online management genetic algorithms of microgrid for residential application
International Nuclear Information System (INIS)
Mohamed, Faisal A.; Koivo, Heikki N.
2012-01-01
Highlights: ► We determine the optimal Generation optimization scheme of Microgrid. ► We employ Genetic Algorithm to the environmental/economic problem of the MG. ► We captured the optimal behavior of the MG with high accuracy even with new six different cases. - Abstract: This paper proposes a generalized formulation to determine the optimal operating strategy and cost optimization scheme for a MicroGrid (MG) for residential application. Genetic Algorithm is applied to the environmental/economic problem of the MG. The proposed problem is formulated as a nonlinear constrained MO optimization problem. Prior to the optimization of the microgrid itself, models for the system components are determined using real data. The proposed cost function takes into consideration the costs of the emissions, NOx, SO 2 , and CO 2 , start up costs, as well as the operation and maintenance costs. The MG considered in this paper consists of a wind turbine, a microturbine, a diesel generator, a photovoltaic array, a fuel cell, and a battery storage. The optimization is aimed at minimizing the cost function of the system while constraining it to meet the costumer demand and safety of the system. We also add a daily income and outgo from sale or purchased power. The results demonstrate the efficiency of the proposed approach to satisfy the load and to reduce the cost and the emissions. The comparison with other techniques demonstrates the superiority of the proposed approach and confirms its potential to solve the problem.
Genetic algorithms and experimental discrimination of SUSY models
International Nuclear Information System (INIS)
Allanach, B.C.; Quevedo, F.; Grellscheid, D.
2004-01-01
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, since that is how the experimental errors are expected to scale. 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. (author)
ROAD DETECTION BY NEURAL AND GENETIC ALGORITHM IN URBAN ENVIRONMENT
Directory of Open Access Journals (Sweden)
A. Barsi
2012-07-01
Full Text Available In the urban object detection challenge organized by the ISPRS WG III/4 high geometric and radiometric resolution aerial images about Vaihingen/Stuttgart, Germany are distributed. The acquired data set contains optical false color, near infrared images and airborne laserscanning data. The presented research focused exclusively on the optical image, so the elevation information was ignored. The road detection procedure has been built up of two main phases: a segmentation done by neural networks and a compilation made by genetic algorithms. The applied neural networks were support vector machines with radial basis kernel function and self-organizing maps with hexagonal network topology and Euclidean distance function for neighborhood management. The neural techniques have been compared by hyperbox classifier, known from the statistical image classification practice. The compilation of the segmentation is realized by a novel application of the common genetic algorithm and by differential evolution technique. The genes were implemented to detect the road elements by evaluating a special binary fitness function. The results have proven that the evolutional technique can automatically find major road segments.
Spatial correlation genetic algorithm for fractal image compression
International Nuclear Information System (INIS)
Wu, M.-S.; Teng, W.-C.; Jeng, J.-H.; Hsieh, J.-G.
2006-01-01
Fractal image compression explores the self-similarity property of a natural image and utilizes the partitioned iterated function system (PIFS) to encode it. This technique is of great interest both in theory and application. However, it is time-consuming in the encoding process and such drawback renders it impractical for real time applications. The time is mainly spent on the search for the best-match block in a large domain pool. In this paper, a spatial correlation genetic algorithm (SC-GA) is proposed to speed up the encoder. There are two stages for the SC-GA method. The first stage makes use of spatial correlations in images for both the domain pool and the range pool to exploit local optima. The second stage is operated on the whole image to explore more adequate similarities if the local optima are not satisfied. With the aid of spatial correlation in images, the encoding time is 1.5 times faster than that of traditional genetic algorithm method, while the quality of the retrieved image is almost the same. Moreover, about half of the matched blocks come from the correlated space, so fewer bits are required to represent the fractal transform and therefore the compression ratio is also improved
Reliable prediction of adsorption isotherms via genetic algorithm molecular simulation.
LoftiKatooli, L; Shahsavand, A
2017-01-01
Conventional molecular simulation techniques such as grand canonical Monte Carlo (GCMC) strictly rely on purely random search inside the simulation box for predicting the adsorption isotherms. This blind search is usually extremely time demanding for providing a faithful approximation of the real isotherm and in some cases may lead to non-optimal solutions. A novel approach is presented in this article which does not use any of the classical steps of the standard GCMC method, such as displacement, insertation, and removal. The new approach is based on the well-known genetic algorithm to find the optimal configuration for adsorption of any adsorbate on a structured adsorbent under prevailing pressure and temperature. The proposed approach considers the molecular simulation problem as a global optimization challenge. A detailed flow chart of our so-called genetic algorithm molecular simulation (GAMS) method is presented, which is entirely different from traditions molecular simulation approaches. Three real case studies (for adsorption of CO 2 and H 2 over various zeolites) are borrowed from literature to clearly illustrate the superior performances of the proposed method over the standard GCMC technique. For the present method, the average absolute values of percentage errors are around 11% (RHO-H 2 ), 5% (CHA-CO 2 ), and 16% (BEA-CO 2 ), while they were about 70%, 15%, and 40% for the standard GCMC technique, respectively.
Actuator Placement Via Genetic Algorithm for Aircraft Morphing
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.
Ternary alloy material prediction using genetic algorithm and cluster expansion
Energy Technology Data Exchange (ETDEWEB)
Chen, Chong [Iowa State Univ., Ames, IA (United States)
2015-12-01
This thesis summarizes our study on the crystal structures prediction of Fe-V-Si system using genetic algorithm and cluster expansion. Our goal is to explore and look for new stable compounds. We started from the current ten known experimental phases, and calculated formation energies of those compounds using density functional theory (DFT) package, namely, VASP. The convex hull was generated based on the DFT calculations of the experimental known phases. Then we did random search on some metal rich (Fe and V) compositions and found that the lowest energy structures were body centered cube (bcc) underlying lattice, under which we did our computational systematic searches using genetic algorithm and cluster expansion. Among hundreds of the searched compositions, thirteen were selected and DFT formation energies were obtained by VASP. The stability checking of those thirteen compounds was done in reference to the experimental convex hull. We found that the composition, 24-8-16, i.e., Fe_{3}VSi_{2} is a new stable phase and it can be very inspiring to the future experiments.
Designing shields for KeV photons with genetic algorithms
International Nuclear Information System (INIS)
Asbury, Stephen; Holloway, James P.
2011-01-01
Shielding of x-ray sources and low energy gamma rays is often accomplished with lead aprons, comprising a thin layer (0.5 mm to 1 mm) of lead or similar high-Z material. In previous work the authors used Genetic Algorithms to explore the design of a shadow shield for space applications. Now those techniques have been applied to the problem of shielding humans from low energy gamma radiation. This paper uses a simple geometry to explore layering various materials as a method to reduce mass and dose for thin gamma shields. The genetic algorithms discover layers of materials with various Z is in fact more effective than an equivalent mass of Pb alone for lower energy gammas, but as the incident radiation energy increases the efficacy of such layering diminishes. The utility of varying Z for lower energy gammas is in part due to their complementary K-edges, where one material compensates for the transmission that would occur just below the K-edge in another material. (author)
Combining neural networks and genetic algorithms for hydrological flow forecasting
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
Malyna, D.V.; Duarte, J.L.; Hendrix, M.A.M.; Horck, van F.B.M.
2007-01-01
A practical example of power electronic converter synthesis is presented, where a multi-objective genetic algorithm, namely non-dominated sorting genetic algorithm (NSGA-II) is used. The optimization algorithm takes an experimentally-derived thermal model for the converter into account. Experimental
Cost optimization model and its heuristic genetic algorithms
International Nuclear Information System (INIS)
Liu Wei; Wang Yongqing; Guo Jilin
1999-01-01
Interest and escalation are large quantity in proportion to the cost of nuclear power plant construction. In order to optimize the cost, the mathematics model of cost optimization for nuclear power plant construction was proposed, which takes the maximum net present value as the optimization goal. The model is based on the activity networks of the project and is an NP problem. A heuristic genetic algorithms (HGAs) for the model was introduced. In the algorithms, a solution is represented with a string of numbers each of which denotes the priority of each activity for assigned resources. The HGAs with this encoding method can overcome the difficulty which is harder to get feasible solutions when using the traditional GAs to solve the model. The critical path of the activity networks is figured out with the concept of predecessor matrix. An example was computed with the HGAP programmed in C language. The results indicate that the model is suitable for the objectiveness, the algorithms is effective to solve the model
DNA Cryptography and Deep Learning using Genetic Algorithm with NW algorithm for Key Generation.
Kalsi, Shruti; Kaur, Harleen; Chang, Victor
2017-12-05
Cryptography is not only a science of applying complex mathematics and logic to design strong methods to hide data called as encryption, but also to retrieve the original data back, called decryption. The purpose of cryptography is to transmit a message between a sender and receiver such that an eavesdropper is unable to comprehend it. To accomplish this, not only we need a strong algorithm, but a strong key and a strong concept for encryption and decryption process. We have introduced a concept of DNA Deep Learning Cryptography which is defined as a technique of concealing data in terms of DNA sequence and deep learning. In the cryptographic technique, each alphabet of a letter is converted into a different combination of the four bases, namely; Adenine (A), Cytosine (C), Guanine (G) and Thymine (T), which make up the human deoxyribonucleic acid (DNA). Actual implementations with the DNA don't exceed laboratory level and are expensive. To bring DNA computing on a digital level, easy and effective algorithms are proposed in this paper. In proposed work we have introduced firstly, a method and its implementation for key generation based on the theory of natural selection using Genetic Algorithm with Needleman-Wunsch (NW) algorithm and Secondly, a method for implementation of encryption and decryption based on DNA computing using biological operations Transcription, Translation, DNA Sequencing and Deep Learning.
Weight optimization of plane truss using genetic algorithm
Neeraja, D.; Kamireddy, Thejesh; Santosh Kumar, Potnuru; Simha Reddy, Vijay
2017-11-01
Optimization of structure on basis of weight has many practical benefits in every engineering field. The efficiency is proportionally related to its weight and hence weight optimization gains prime importance. Considering the field of civil engineering, weight optimized structural elements are economical and easier to transport to the site. In this study, genetic optimization algorithm for weight optimization of steel truss considering its shape, size and topology aspects has been developed in MATLAB. Material strength and Buckling stability have been adopted from IS 800-2007 code of construction steel. The constraints considered in the present study are fabrication, basic nodes, displacements, and compatibility. Genetic programming is a natural selection search technique intended to combine good solutions to a problem from many generations to improve the results. All solutions are generated randomly and represented individually by a binary string with similarities of natural chromosomes, and hence it is termed as genetic programming. The outcome of the study is a MATLAB program, which can optimise a steel truss and display the optimised topology along with element shapes, deflections, and stress results.
The pathogenicity of genetic variants previously associated with left ventricular non-compaction
DEFF Research Database (Denmark)
Abbasi, Yeganeh; Jabbari, Javad; Jabbari, Reza
2016-01-01
BACKGROUND: Left ventricular non-compaction (LVNC) is a rare cardiomyopathy. Many genetic variants have been associated with LVNC. However, the number of the previous LVNC-associated variants that are common in the background population remains unknown. The aim of this study was to provide...... an updated list of previously reported LVNC-associated variants with biologic description and investigate the prevalence of LVNC variants in healthy general population to find false-positive LVNC-associated variants. METHODS AND RESULTS: The Human Gene Mutation Database and PubMed were systematically...... searched to identify all previously reported LVNC-associated variants. Thereafter, the Exome Sequencing Project (ESP) and the Exome Aggregation Consortium (ExAC), that both represent the background population, was searched for all variants. Four in silico prediction tools were assessed to determine...
International Nuclear Information System (INIS)
Huang, Xiaobiao; Safranek, James
2014-01-01
Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications
Energy Technology Data Exchange (ETDEWEB)
Huang, Xiaobiao, E-mail: xiahuang@slac.stanford.edu; Safranek, James
2014-09-01
Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.
Energy Technology Data Exchange (ETDEWEB)
Bornholdt, S. [Heidelberg Univ., (Germany). Inst., fuer Theoretische Physik; Graudenz, D. [Lawrence Berkeley Lab., CA (United States)
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.
International Nuclear Information System (INIS)
Bornholdt, S.
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
A test sheet generating algorithm based on intelligent genetic algorithm and hierarchical planning
Gu, Peipei; Niu, Zhendong; Chen, Xuting; Chen, Wei
2013-03-01
In recent years, computer-based testing has become an effective method to evaluate students' overall learning progress so that appropriate guiding strategies can be recommended. Research has been done to develop intelligent test assembling systems which can automatically generate test sheets based on given parameters of test items. A good multisubject test sheet depends on not only the quality of the test items but also the construction of the sheet. Effective and efficient construction of test sheets according to multiple subjects and criteria is a challenging problem. In this paper, a multi-subject test sheet generation problem is formulated and a test sheet generating approach based on intelligent genetic algorithm and hierarchical planning (GAHP) is proposed to tackle this problem. The proposed approach utilizes hierarchical planning to simplify the multi-subject testing problem and adopts genetic algorithm to process the layered criteria, enabling the construction of good test sheets according to multiple test item requirements. Experiments are conducted and the results show that the proposed approach is capable of effectively generating multi-subject test sheets that meet specified requirements and achieve good performance.
An Improved Hierarchical Genetic Algorithm for Sheet Cutting Scheduling with Process Constraints
Yunqing Rao; Dezhong Qi; Jinling Li
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—hierarchical genetic algorithm) is developed for better ...
Nuclear power plant maintenance scheduling dilemma: a genetic algorithm approach
International Nuclear Information System (INIS)
Mahdavi, M.H.; Modarres, M.
2004-01-01
There are huge numbers of components scheduled for maintenance when a nuclear power plant is shut down. Among these components, a number of them are safety related which their operability as well as reliability when plant becomes up is main concerns. Not performing proper maintenance on this class of components/system would impose substantial risk on operating the NPP. In this paper a new approach based on genetic algorithms is presented to optimize the NPP maintenance schedule during shutdown. following this approach the cost incurred by maintenance activities for each schedule is balanced with the risk imposed by the maintenance scheduling plan to the plant operation status when it is up. The risk model implemented in the GA scheduler as its evaluation function is developed on the basis of the probabilistic risk assessment methodology. the Ga optimizers itself is shown to be superior compared to other optimization methods such as the monte carlo technique
District Heating Network Design and Configuration Optimization with Genetic Algorithm
DEFF Research Database (Denmark)
Li, Hongwei; Svendsen, Svend
2013-01-01
In this paper, the configuration of a district heating network which connects from the heating plant to the end users is optimized. Each end user in the network represents a building block. The connections between the heat generation plant and the end users are represented with mixed integer...... and the pipe friction and heat loss formulations are non-linear. In order to find the optimal district heating network configuration, genetic algorithm which handles the mixed integer nonlinear programming problem is chosen. The network configuration is represented with binary and integer encoding...... and it is optimized in terms of the net present cost. The optimization results indicates that the optimal DH network configuration is determined by multiple factors such as the consumer heating load, the distance between the heating plant to the consumer, the design criteria regarding the pressure and temperature...
District Heating Network Design and Configuration Optimization with Genetic Algorithm
DEFF Research Database (Denmark)
Li, Hongwei; Svendsen, Svend
2011-01-01
In this paper, the configuration of a district heating (DH) network which connects from the heating plant to the end users was optimized with emphasizing the network thermal performance. Each end user in the network represents a building block. The locations of the building blocks are fixed while...... the heating plant location is allowed to vary. The connection between the heat generation plant and the end users can be represented with mixed integer and the pipe friction and heat loss formulations are non-linear. In order to find the optimal DH distribution pipeline configuration, the genetic algorithm...... by multi factors as the consumer heating load, the distance between the heating plant to the consumer, the design criteria regarding pressure and temperature limitation, as well as the corresponding network heat loss....
Genetic Algorithms and Nucleation in VIH-AIDS transition.
Barranon, Armando
2003-03-01
VIH to AIDS transition has been modeled via a genetic algorithm that uses boom-boom principle and where population evolution is simulated with a cellular automaton based on SIR model. VIH to AIDS transition is signed by nucleation of infected cells and low probability of infection are obtained for different mutation rates in agreement with clinical results. A power law is obtained with a critical exponent close to the critical exponent of cubic, spherical percolation, colossal magnetic resonance, Ising Model and liquid-gas phase transition in heavy ion collisions. Computations were carried out at UAM-A Supercomputing Lab and author acknowledges financial support from Division of CBI at UAM-A.
Fuzzy Genetic Algorithm Based on Principal Operation and Inequity Degree
Li, Fachao; Jin, Chenxia
In this paper, starting from the structure of fuzzy information, by distinguishing principal indexes and assistant indexes, give comparison of fuzzy information on synthesizing effect and operation of fuzzy optimization on principal indexes transformation, further, propose axiom system of fuzzy inequity degree from essence of constraint, and give an instructive metric method; Then, combining genetic algorithm, give fuzzy optimization methods based on principal operation and inequity degree (denoted by BPO&ID-FGA, for short); Finally, consider its convergence using Markov chain theory and analyze its performance through an example. All these indicate, BPO&ID-FGA can not only effectively merge decision consciousness into the optimization process, but possess better global convergence, so it can be applied to many fuzzy optimization problems.
Scheduling Diet for Diabetes Mellitus Patients using Genetic Algorithm
Syahputra, M. F.; Felicia, V.; Rahmat, R. F.; Budiarto, R.
2017-01-01
Diabetes Melitus (DM) is one of metabolic diseases which affects on productivity and lowers the human resources quality. This disease can be controlled by maintaining and regulating balanced and healthy lifestyle especially for daily diet. However, nowadays, there is no system able to help DM patient to get any information of proper diet. Therefore, an approach is required to provide scheduling diet every day in a week with appropriate nutrition for DM patients to help them regulate their daily diet for healing this disease. In this research, we calculate the number of caloric needs using Harris-Benedict equation and propose genetic algorithm for scheduling diet for DM patient. The results show that the greater the number of individuals, the greater the more the possibility of changes in fitness score approaches the best fitness score. Moreover, the greater the created generation, the more the opportunites to obtain best individual with fitness score approaching 0 or equal to 0.
Optimization on Trajectory of Stanford Manipulator based on Genetic Algorithm
Directory of Open Access Journals (Sweden)
Han Xi
2017-01-01
Full Text Available The optimization of robot manipulator’s trajectory has become a hot topic in academic and industrial fields. In this paper, a method for minimizing the moving distance of robot manipulators is presented. The Stanford Manipulator is used as the research object and the inverse kinematics model is established with Denavit-Hartenberg method. Base on the initial posture matrix, the inverse kinematics model is used to find the initial state of each joint. In accordance with the given beginning moment, cubic polynomial interpolation is applied to each joint variable and the positive kinematic model is used to calculate the moving distance of end effector. Genetic algorithm is used to optimize the sequential order of each joint and the time difference between different starting time of joints. Numerical applications involving a Stanford manipulator are presented.
Reduced scale PWR passive safety system designing by genetic algorithms
International Nuclear Information System (INIS)
Cunha, Joao J. da; Alvim, Antonio Carlos M.; Lapa, Celso Marcelo Franklin
2007-01-01
This paper presents the concept of 'Design by Genetic Algorithms (DbyGA)', applied to a new reduced scale system problem. The design problem of a passive thermal-hydraulic safety system, considering dimensional and operational constraints, has been solved. Taking into account the passive safety characteristics of the last nuclear reactor generation, a PWR core under natural circulation is used in order to demonstrate the methodology applicability. The results revealed that some solutions (reduced scale system DbyGA) are capable of reproducing, both accurately and simultaneously, much of the physical phenomena that occur in real scale and operating conditions. However, some aspects, revealed by studies of cases, pointed important possibilities to DbyGA methodological performance improvement
GENETIC ALGORITHM BASED CONCEPT DESIGN TO OPTIMIZE NETWORK LOAD BALANCE
Directory of Open Access Journals (Sweden)
Ashish Jain
2012-07-01
Full Text Available Multiconstraints optimal network load balancing is an NP-hard problem and it is an important part of traffic engineering. In this research we balance the network load using classical method (brute force approach and dynamic programming is used but result shows the limitation of this method but at a certain level we recognized that the optimization of balanced network load with increased number of nodes and demands is intractable using the classical method because the solution set increases exponentially. In such case the optimization techniques like evolutionary techniques can employ for optimizing network load balance. In this paper we analyzed proposed classical algorithm and evolutionary based genetic approach is devise as well as proposed in this paper for optimizing the balance network load.
A genetic algorithm for preemptive scheduling of a single machine
Directory of Open Access Journals (Sweden)
Amir-Mohammad Golmohammadi
2016-09-01
Full Text Available This paper presents a mathematical model for scheduling of a single machine when there are preemptions in jobs. The primary objective of the study is to minimize different objectives such as earliness, tardiness and work in process. The proposed mathematical problem is considered as NP-Hard and the optimal solution is available for small scale problems. Therefore, a genetic algorithm (GA is developed to solve the problem for large-scale problems. The implementation of the proposed model is compared with GA for problems with up to 50 jobs using three methods of roulette wheel sampling, random sampling and competition sampling. The results have indicated that competition sampling has reached optimal solutions for small scale problems and it could obtain better near-optimal solutions in relatively lower running time compared with other sampling methods.
Analysis of Shrinkage on Thick Plate Part using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Najihah S.N.
2016-01-01
Full Text Available Injection moulding is the most widely used processes in manufacturing plastic products. Since the quality of injection improves plastic parts are mostly influenced by process conditions, the method to determine the optimum process conditions becomes the key to improving the part quality. This paper presents a systematic methodology to analyse the shrinkage of the thick plate part during the injection moulding process. Genetic Algorithm (GA method was proposed to optimise the process parameters that would result in optimal solutions of optimisation goals. Using the GA, the shrinkage of the thick plate part was improved by 39.1% in parallel direction and 17.21% in the normal direction of melt flow.
Genetic Algorithms for Development of New Financial Products
Directory of Open Access Journals (Sweden)
Eder Oliveira Abensur
2007-06-01
Full Text Available New Product Development (NPD is recognized as a fundamental activity that has a relevant impact on the performance of companies. Despite the relevance of the financial market there is a lack of work on new financial product development. The aim of this research is to propose the use of Genetic Algorithms (GA as an alternative procedure for evaluating the most favorable combination of variables for the product launch. The paper focuses on: (i determining the essential variables of the financial product studied (investment fund; (ii determining how to evaluate the success of a new investment fund launch and (iii how GA can be applied to the financial product development problem. The proposed framework was tested using 4 years of real data from the Brazilian financial market and the results suggest that this is an innovative development methodology and useful for designing complex financial products with many attributes.
Genetic Algorithms vs. Artificial Neural Networks in Economic Forecasting Process
Directory of Open Access Journals (Sweden)
Nicolae Morariu
2008-01-01
Full Text Available This paper aims to describe the implementa-tion of a neural network and a genetic algorithm system in order to forecast certain economic indicators of a free market economy. In a free market economy forecasting process precedes the economic planning (a management function, providing important information for the result of the last process. Forecasting represents a starting point in setting of target for a firm, an organization or even a branch of the economy. Thus, the forecasting method used can influence in a significant mode the evolution of an entity. In the following we will describe the forecasting of an economic indicator using two intelligent systems. The difference between the results obtained by this two systems are described in chapter IV.
A genetic algorithm application in backcross breeding problem
Carnia, E.; Napitupulu, H.; Supriatna, A. K.
2018-03-01
In this paper we discuss a mathematical model of goat breeding strategy, i.e. the backcrossing breeding. The model is aimed to obtain a strategy in producing better variant of species. In this strategy, a female (doe) of a lesser quality goat, in terms of goat quality is bred with a male (buck) of an exotic goat which has a better goat quality. In this paper we will explore a problem on how to harvest the population optimally. A genetic algorithm (GA) approach will been devised to obtain the solution of the problem. We do several trials of the GA implementation which gives different set of solutions, but relatively close to each other in terms of the resulting total revenue, except a few. Further study need to be done to obtain GA solution that closer to the exact solution.
An Intelligent Model for Pairs Trading Using Genetic Algorithms.
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.
Combinatorial Optimization in Project Selection Using Genetic Algorithm
Dewi, Sari; Sawaluddin
2018-01-01
This paper discusses the problem of project selection in the presence of two objective functions that maximize profit and minimize cost and the existence of some limitations is limited resources availability and time available so that there is need allocation of resources in each project. These resources are human resources, machine resources, raw material resources. This is treated as a consideration to not exceed the budget that has been determined. So that can be formulated mathematics for objective function (multi-objective) with boundaries that fulfilled. To assist the project selection process, a multi-objective combinatorial optimization approach is used to obtain an optimal solution for the selection of the right project. It then described a multi-objective method of genetic algorithm as one method of multi-objective combinatorial optimization approach to simplify the project selection process in a large scope.
Some Studies on Forming Optimization with Genetic Algorithm
Directory of Open Access Journals (Sweden)
Ganesh Marotrao KAKANDIKAR
2012-07-01
Full Text Available Forming is a compression-tension process involving wide spectrum of operations andflow conditions. The result of the process depends on the large number of parameters and theirinterdependence. The selection of various parameters is still based on trial and error methods. In thispaper the authors present a new approach to optimize the geometry parameters of circularcomponents, process parameters such as blank holder pressure and coefficient of friction etc. Theoptimization problem has been formulated with the objective of optimizing the maximum formingload required in Forming. Genetic algorithm is used as a tool for the optimization: to optimize thedrawing load and to optimize the process parameters. A finite element analysis simulation softwareFast Form Advanced is used for the validations of the results after optimization with prior results.
Multi-objective optimization using genetic algorithms: A tutorial
International Nuclear Information System (INIS)
Konak, Abdullah; Coit, David W.; Smith, Alice E.
2006-01-01
Multi-objective formulations are realistic models for many complex engineering optimization problems. In many real-life problems, objectives under consideration conflict with each other, and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other objectives. A reasonable solution to a multi-objective problem is to investigate a set of solutions, each of which satisfies the objectives at an acceptable level without being dominated by any other solution. In this paper, an overview and tutorial is presented describing genetic algorithms (GA) developed specifically for problems with multiple objectives. They differ primarily from traditional GA by using specialized fitness functions and introducing methods to promote solution diversity
Bias correction of daily satellite precipitation data using genetic algorithm
Pratama, A. W.; Buono, A.; Hidayat, R.; Harsa, H.
2018-05-01
Climate Hazards Group InfraRed Precipitation with Stations (CHIRPS) was producted by blending Satellite-only Climate Hazards Group InfraRed Precipitation (CHIRP) with Stasion observations data. The blending process was aimed to reduce bias of CHIRP. However, Biases of CHIRPS on statistical moment and quantil values were high during wet season over Java Island. This paper presented a bias correction scheme to adjust statistical moment of CHIRP using observation precipitation data. The scheme combined Genetic Algorithm and Nonlinear Power Transformation, the results was evaluated based on different season and different elevation level. The experiment results revealed that the scheme robustly reduced bias on variance around 100% reduction and leaded to reduction of first, and second quantile biases. However, bias on third quantile only reduced during dry months. Based on different level of elevation, the performance of bias correction process is only significantly different on skewness indicators.
Tuning of active vibration controllers for ACTEX by genetic algorithm
Kwak, Moon K.; Denoyer, Keith K.
1999-06-01
This paper is concerned with the optimal tuning of digitally programmable analog controllers on the ACTEX-1 smart structures flight experiment. The programmable controllers for each channel include a third order Strain Rate Feedback (SRF) controller, a fifth order SRF controller, a second order Positive Position Feedback (PPF) controller, and a fourth order PPF controller. Optimal manual tuning of several control parameters can be a difficult task even though the closed-loop control characteristics of each controller are well known. Hence, the automatic tuning of individual control parameters using Genetic Algorithms is proposed in this paper. The optimal control parameters of each control law are obtained by imposing a constraint on the closed-loop frequency response functions using the ACTEX mathematical model. The tuned control parameters are then uploaded to the ACTEX electronic control electronics and experiments on the active vibration control are carried out in space. The experimental results on ACTEX will be presented.
Reusable rocket engine preventive maintenance scheduling using genetic algorithm
International Nuclear Information System (INIS)
Chen, Tao; Li, Jiawen; Jin, Ping; Cai, Guobiao
2013-01-01
This paper deals with the preventive maintenance (PM) scheduling problem of reusable rocket engine (RRE), which is different from the ordinary repairable systems, by genetic algorithm. Three types of PM activities for RRE are considered and modeled by introducing the concept of effective age. The impacts of PM on all subsystems' aging processes are evaluated based on improvement factor model. Then the reliability of engine is formulated by considering the accumulated time effect. After that, optimization model subjected to reliability constraint is developed for RRE PM scheduling at fixed interval. The optimal PM combination is obtained by minimizing the total cost in the whole life cycle for a supposed engine. Numerical investigations indicate that the subsystem's intrinsic reliability characteristic and the improvement factor of maintain operations are the most important parameters in RRE's PM scheduling management
Using Genetic Algorithm to Estimate Hydraulic Parameters of Unconfined Aquifers
Directory of Open Access Journals (Sweden)
Asghar Asghari Moghaddam
2009-03-01
Full Text Available Nowadays, optimization techniques such as Genetic Algorithms (GA have attracted wide attention among scientists for solving complicated engineering problems. In this article, pumping test data are used to assess the efficiency of GA in estimating unconfined aquifer parameters and a sensitivity analysis is carried out to propose an optimal arrangement of GA. For this purpose, hydraulic parameters of three sets of pumping test data are calculated by GA and they are compared with the results of graphical methods. The results indicate that the GA technique is an efficient, reliable, and powerful method for estimating the hydraulic parameters of unconfined aquifer and, further, that in cases of deficiency in pumping test data, it has a better performance than graphical methods.
Optimization of high harmonic generation by genetic algorithm
International Nuclear Information System (INIS)
Constance Valentin; Olga Boyko; Gilles Rey; Brigitte Mercier; Evaggelos Papalazarou; Laure Antonucci; Philippe Balcou
2006-01-01
Complete test of publication follows. High Harmonic Generation (HHG) is very sensitive to pulse shape of the fundamental laser. We have first used an Acousto-Optic Programmable Dispersive Filter (AOPDF) in order to modify the spectral phase and second, a deformable mirror in order to modify the wavefront. We have optimized harmonic signal using a genetic algorithm coupled with both setups. We show the influence of macroscopic parameters for optimization process. Genetic algorithms have been already used to modify pulse shapes of the fundamental laser in order to optimize high harmonic signals, in order to change the emission wavelength of one harmonic or to modify the fundamental wavefront to optimize harmonic signals. For the first time, we present a systematic study of the optimization of harmonic signals using the AOPDF. Signal optimizations by a factor 2 to 10 have been measured depending of parameters of generation. For instance, one of the interesting result concerns the effect of macroscopic parameters as position of the entrance of the cell with respect to the focus of the IR laser when we change the pulse shapes. For instance, the optimization is higher when the cell entrance is above the focus where the intensity gradients are higher. Although the spectral phase of the IR laser is important for the response of one atom, the optimization depends also of phase-matching and especially of the effect intensity gradients. Other systematic studies have been performed as well as measurements of temporal profiles and wavefronts of the IR beam. These studies allow bringing out the behaviour of high harmonic generation with respect to the optimization process.
Cloud identification using genetic algorithms and massively parallel computation
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
Reactor controller design using genetic algorithm with simulated annealing
International Nuclear Information System (INIS)
Willjuice Iruthyarajan, M.
2012-01-01
Many reactor control design work, specifically the problem of synthesis and optimization of reactor networks involving the classical reaction schemes was studied, considering a superstructure formed by a CSTR and a PFR and their possible arrangements. A genetic algorithm was proposed, together with a systematic procedure. Two case studies were solved with the proposed systematic. Both of them present similar results than the published in the literature. The first case studied was the Trambouze reaction scheme. Although selectivity values are smaller then the values published in the referred papers, the reactors system combined volume is always minor them the other ones. The second case studied was the Van de Vusse reaction scheme. In this case, the obtained value for the total volume is always minor then the considered papers. One can conclude that when compared with the other works presented in the literature results are compatible and very interesting. The developed algorithms can be used as a good alternative for reactor networks design and optimization problem
Primary chromatic aberration elimination via optimization work with genetic algorithm
Wu, Bo-Wen; Liu, Tung-Kuan; Fang, Yi-Chin; Chou, Jyh-Horng; Tsai, Hsien-Lin; Chang, En-Hao
2008-09-01
Chromatic Aberration plays a part in modern optical systems, especially in digitalized and smart optical systems. Much effort has been devoted to eliminating specific chromatic aberration in order to match the demand for advanced digitalized optical products. Basically, the elimination of axial chromatic and lateral color aberration of an optical lens and system depends on the selection of optical glass. According to reports from glass companies all over the world, the number of various newly developed optical glasses in the market exceeds three hundred. However, due to the complexity of a practical optical system, optical designers have so far had difficulty in finding the right solution to eliminate small axial and lateral chromatic aberration except by the Damped Least Squares (DLS) method, which is limited in so far as the DLS method has not yet managed to find a better optical system configuration. In the present research, genetic algorithms are used to replace traditional DLS so as to eliminate axial and lateral chromatic, by combining the theories of geometric optics in Tessar type lenses and a technique involving Binary/Real Encoding, Multiple Dynamic Crossover and Random Gene Mutation to find a much better configuration for optical glasses. By implementing the algorithms outlined in this paper, satisfactory results can be achieved in eliminating axial and lateral color aberration.
Improved Genetic Algorithm Optimization for Forward Vehicle Detection Problems
Directory of Open Access Journals (Sweden)
Longhui Gang
2015-07-01
Full Text Available Automated forward vehicle detection is an integral component of many advanced driver-assistance systems. The method based on multi-visual information fusion, with its exclusive advantages, has become one of the important topics in this research field. During the whole detection process, there are two key points that should to be resolved. One is to find the robust features for identification and the other is to apply an efficient algorithm for training the model designed with multi-information. This paper presents an adaptive SVM (Support Vector Machine model to detect vehicle with range estimation using an on-board camera. Due to the extrinsic factors such as shadows and illumination, we pay more attention to enhancing the system with several robust features extracted from a real driving environment. Then, with the introduction of an improved genetic algorithm, the features are fused efficiently by the proposed SVM model. In order to apply the model in the forward collision warning system, longitudinal distance information is provided simultaneously. The proposed method is successfully implemented on a test car and evaluation experimental results show reliability in terms of both the detection rate and potential effectiveness in a real-driving environment.
Genetic Algorithm-Based Identification of Fractional-Order Systems
Directory of Open Access Journals (Sweden)
Shengxi Zhou
2013-05-01
Full Text Available Fractional calculus has become an increasingly popular tool for modeling the complex behaviors of physical systems from diverse domains. One of the key issues to apply fractional calculus to engineering problems is to achieve the parameter identification of fractional-order systems. A time-domain identification algorithm based on a genetic algorithm (GA is proposed in this paper. The multi-variable parameter identification is converted into a parameter optimization by applying GA to the identification of fractional-order systems. To evaluate the identification accuracy and stability, the time-domain output error considering the condition variation is designed as the fitness function for parameter optimization. The identification process is established under various noise levels and excitation levels. The effects of external excitation and the noise level on the identification accuracy are analyzed in detail. The simulation results show that the proposed method could identify the parameters of both commensurate rate and non-commensurate rate fractional-order systems from the data with noise. It is also observed that excitation signal is an important factor influencing the identification accuracy of fractional-order systems.
Determination of Selection Method in Genetic Algorithm for Land Suitability
Directory of Open Access Journals (Sweden)
Irfianti Asti Dwi
2016-01-01
Full Text Available Genetic Algoirthm is one alternative solution in the field of modeling optimization, automatic programming and machine learning. The purpose of the study was to compare some type of selection methods in Genetic Algorithm for land suitability. Contribution of this research applies the best method to develop region based horticultural commodities. This testing is done by comparing the three methods on the method of selection, the Roulette Wheel, Tournament Selection and Stochastic Universal Sampling. Parameters of the locations used in the test scenarios include Temperature = 27°C, Rainfall = 1200 mm, hummidity = 30%, Cluster fruit = 4, Crossover Probabiitiy (Pc = 0.6, Mutation Probabilty (Pm = 0.2 and Epoch = 10. The second test epoch incluides location parameters consist of Temperature = 30°C, Rainfall = 2000 mm, Humidity = 35%, Cluster fruit = 5, Crossover Probability (Pc = 0.7, Mutation Probability (Pm = 0.3 and Epoch 10. The conclusion of this study shows that the Roulette Wheel is the best method because it produces more stable and fitness value than the other two methods.
MICRONEEDLE STRUCTURE DESIGN AND OPTIMIZATION USING GENETIC ALGORITHM
Directory of Open Access Journals (Sweden)
N. A. ISMAIL
2015-07-01
Full Text Available This paper presents a Genetic Algorithm (GA based microneedle design and analysis. GA is an evolutionary optimization technique that mimics the natural biological evolution. The design of microneedle structure considers the shape of microneedle, material used, size of the array, the base of microneedle, the lumen base, the height of microneedle, the height of the lumen, and the height of the drug container or reservoir. The GA is executed in conjunction with ANSYS simulation system to assess the design specifications. The GA uses three operators which are reproduction, crossover and mutation to manipulate the genetic composition of the population. In this research, the microneedle is designed to meet a number of significant specifications such as nodal displacement, strain energy, equivalent stress and flow rate of the fluid / drug that flow through its channel / lumen. A comparison study is conducted to investigate the design of microneedle structure with and without the implementation of GA model. The results showed that GA is able to optimize the design parameters of microneedle and is capable to achieve the required specifications with better performance.
Support Vector Regression and Genetic Algorithm for HVAC Optimal Operation
Directory of Open Access Journals (Sweden)
Ching-Wei Chen
2016-01-01
Full Text Available This study covers records of various parameters affecting the power consumption of air-conditioning systems. Using the Support Vector Machine (SVM, the chiller power consumption model, secondary chilled water pump power consumption model, air handling unit fan power consumption model, and air handling unit load model were established. In addition, it was found that R2 of the models all reached 0.998, and the training time was far shorter than that of the neural network. Through genetic programming, a combination of operating parameters with the least power consumption of air conditioning operation was searched. Moreover, the air handling unit load in line with the air conditioning cooling load was predicted. The experimental results show that for the combination of operating parameters with the least power consumption in line with the cooling load obtained through genetic algorithm search, the power consumption of the air conditioning systems under said combination of operating parameters was reduced by 22% compared to the fixed operating parameters, thus indicating significant energy efficiency.
International Nuclear Information System (INIS)
Kastanya, Doddy
2012-01-01
Highlights: ► ADORE is an algorithm for CANDU ROP Detector Layout Optimization. ► ADORE-GA is a Genetic Algorithm variant of the ADORE algorithm. ► Robustness test of ADORE-GA algorithm is presented in this paper. - Abstract: The regional overpower protection (ROP) systems protect CANDU® reactors against overpower in the fuel that could reduce the safety margin-to-dryout. The overpower could originate from a localized power peaking within the core or a general increase in the global core power level. The design of the detector layout for ROP systems is a challenging discrete optimization problem. In recent years, two algorithms have been developed to find a quasi optimal solution to this detector layout optimization problem. Both of these algorithms utilize the simulated annealing (SA) algorithm as their optimization engine. In the present paper, an alternative optimization algorithm, namely the genetic algorithm (GA), has been implemented as the optimization engine. The implementation is done within the ADORE algorithm. Results from evaluating the effects of using various mutation rates and crossover parameters are presented in this paper. It has been demonstrated that the algorithm is sufficiently robust in producing similar quality solutions.
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Ahmed Azouaoui
2012-01-01
Full Text Available A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.
Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm
Directory of Open Access Journals (Sweden)
Xu Mingji
2017-01-01
Full Text Available It is very effective to solve the multi variable optimization problem by using hierarchical genetic algorithm. This thesis analyzes both advantages and disadvantages of hierarchical genetic algorithm and puts forward an improved simulated annealing genetic algorithm. The new algorithm is applied to solve the multiple traveling salesman problem, which can improve the performance of the solution. First, it improves the design of chromosomes hierarchical structure in terms of redundant hierarchical algorithm, and it suggests a suffix design of chromosomes; Second, concerning to some premature problems of genetic algorithm, it proposes a self-identify crossover operator and mutation; Third, when it comes to the problem of weak ability of local search of genetic algorithm, it stretches the fitness by mixing genetic algorithm with simulated annealing algorithm. Forth, it emulates the problems of N traveling salesmen and M cities so as to verify its feasibility. The simulation and calculation shows that this improved algorithm can be quickly converged to a best global solution, which means the algorithm is encouraging in practical uses.
Dynamic modeling of genetic networks using genetic algorithm and S-system.
Kikuchi, Shinichi; Tominaga, Daisuke; Arita, Masanori; Takahashi, Katsutoshi; Tomita, Masaru
2003-03-22
The modeling of system dynamics of genetic networks, metabolic networks or signal transduction cascades from time-course data is formulated as a reverse-problem. Previous studies focused on the estimation of only network structures, and they were ineffective in inferring a network structure with feedback loops. We previously proposed a method to predict not only the network structure but also its dynamics using a Genetic Algorithm (GA) and an S-system formalism. However, it could predict only a small number of parameters and could rarely obtain essential structures. In this work, we propose a unified extension of the basic method. Notable improvements are as follows: (1) an additional term in its evaluation function that aims at eliminating futile parameters; (2) a crossover method called Simplex Crossover (SPX) to improve its optimization ability; and (3) a gradual optimization strategy to increase the number of predictable parameters. The proposed method is implemented as a C program called PEACE1 (Predictor by Evolutionary Algorithms and Canonical Equations 1). Its performance was compared with the basic method. The comparison showed that: (1) the convergence rate increased about 5-fold; (2) the optimization speed was raised about 1.5-fold; and (3) the number of predictable parameters was increased about 5-fold. Moreover, we successfully inferred the dynamics of a small genetic network constructed with 60 parameters for 5 network variables and feedback loops using only time-course data of gene expression.
Genetic algorithms applied to nonlinear and complex domains; TOPICAL
International Nuclear Information System (INIS)
Barash, D; Woodin, A E
1999-01-01
The dissertation, titled ''Genetic Algorithms Applied to Nonlinear and Complex Domains'', describes and then applies a new class of powerful search algorithms (GAS) to certain domains. GAS are capable of solving complex and nonlinear problems where many parameters interact to produce a ''final'' result such as the optimization of the laser pulse in the interaction of an atom with an intense laser field. GAS can very efficiently locate the global maximum by searching parameter space in problems which are unsuitable for a search using traditional methods. In particular, the dissertation contains new scientific findings in two areas. First, the dissertation examines the interaction of an ultra-intense short laser pulse with atoms. GAS are used to find the optimal frequency for stabilizing atoms in the ionization process. This leads to a new theoretical formulation, to explain what is happening during the ionization process and how the electron is responding to finite (real-life) laser pulse shapes. It is shown that the dynamics of the process can be very sensitive to the ramp of the pulse at high frequencies. The new theory which is formulated, also uses a novel concept (known as the (t,t') method) to numerically solve the time-dependent Schrodinger equation Second, the dissertation also examines the use of GAS in modeling decision making problems. It compares GAS with traditional techniques to solve a class of problems known as Markov Decision Processes. The conclusion of the dissertation should give a clear idea of where GAS are applicable, especially in the physical sciences, in problems which are nonlinear and complex, i.e. difficult to analyze by other means
Genetic algorithms applied to nonlinear and complex domains
International Nuclear Information System (INIS)
Barash, D; Woodin, A E
1999-01-01
The dissertation, titled ''Genetic Algorithms Applied to Nonlinear and Complex Domains'', describes and then applies a new class of powerful search algorithms (GAS) to certain domains. GAS are capable of solving complex and nonlinear problems where many parameters interact to produce a ''final'' result such as the optimization of the laser pulse in the interaction of an atom with an intense laser field. GAS can very efficiently locate the global maximum by searching parameter space in problems which are unsuitable for a search using traditional methods. In particular, the dissertation contains new scientific findings in two areas. First, the dissertation examines the interaction of an ultra-intense short laser pulse with atoms. GAS are used to find the optimal frequency for stabilizing atoms in the ionization process. This leads to a new theoretical formulation, to explain what is happening during the ionization process and how the electron is responding to finite (real-life) laser pulse shapes. It is shown that the dynamics of the process can be very sensitive to the ramp of the pulse at high frequencies. The new theory which is formulated, also uses a novel concept (known as the (t,t') method) to numerically solve the time-dependent Schrodinger equation Second, the dissertation also examines the use of GAS in modeling decision making problems. It compares GAS with traditional techniques to solve a class of problems known as Markov Decision Processes. The conclusion of the dissertation should give a clear idea of where GAS are applicable, especially in the physical sciences, in problems which are nonlinear and complex, i.e. difficult to analyze by other means
Zhang, Aizhu; Sun, Genyun; Wang, Zhenjie
2015-12-01
The serious information redundancy in hyperspectral images (HIs) cannot contribute to the data analysis accuracy, instead it require expensive computational resources. Consequently, to identify the most useful and valuable information from the HIs, thereby improve the accuracy of data analysis, this paper proposed a novel hyperspectral band selection method using the hybrid genetic algorithm and gravitational search algorithm (GA-GSA). In the proposed method, the GA-GSA is mapped to the binary space at first. Then, the accuracy of the support vector machine (SVM) classifier and the number of selected spectral bands are utilized to measure the discriminative capability of the band subset. Finally, the band subset with the smallest number of spectral bands as well as covers the most useful and valuable information is obtained. To verify the effectiveness of the proposed method, studies conducted on an AVIRIS image against two recently proposed state-of-the-art GSA variants are presented. The experimental results revealed the superiority of the proposed method and indicated that the method can indeed considerably reduce data storage costs and efficiently identify the band subset with stable and high classification precision.
Reliability Based Spare Parts Management Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Rahul Upadhyay
2015-08-01
Full Text Available Effective and efficient inventory management is the key to the economic sustainability of capital intensive modern industries. Inventory grows exponentially with complexity and size of the equipment fleet. Substantial amount of capital is required for maintaining an inventory and therefore its optimization is beneficial for smooth operation of the project at minimum cost of inventory. The size and hence the cost of the inventory is influenced by a large no of factors. This makes the optimization problem complex. This work presents a model to solve the problem of optimization of spare parts inventory. The novelty of this study lies with the fact that the developed method could tackle not only the artificial test case but also a real-world industrial problem. Various investigators developed several methods and semi-analytical tools for obtaining optimum solutions for this problem. In this study non-traditional optimization tool namely genetic algorithms GA are utilized. Apart from this Coxs regression analysis is also used to incorporate the effect of some environmental factors on the demand of spares. It shows the efficacy of the applicability of non-traditional optimization tool like GA to solve these problems. This research illustrates the proposed model with the analysis of data taken from a fleet of dumper operated in a large surface coal mine. The optimum time schedules so suggested by this GA-based model are found to be cost effective. A sensitivity analysis is also conducted for this industrial problem. Objective function is developed and the factors like the effect of season and production pressure overloading towards financial year-ending is included in the equations. Statistical analysis of the collected operational and performance data were carried out with the help of Easy-Fit Ver-5.5.The analysis gives the shape and scale parameter of theoretical Weibull distribution. The Coxs regression coefficient corresponding to excessive loading
Applications of hybrid genetic algorithms in seismic tomography
Soupios, Pantelis; Akca, Irfan; Mpogiatzis, Petros; Basokur, Ahmet T.; Papazachos, Constantinos
2011-11-01
Almost all earth sciences inverse problems are nonlinear and involve a large number of unknown parameters, making the application of analytical inversion methods quite restrictive. In practice, most analytical methods are local in nature and rely on a linearized form of the problem equations, adopting an iterative procedure which typically employs partial derivatives in order to optimize the starting (initial) model by minimizing a misfit (penalty) function. Unfortunately, especially for highly non-linear cases, the final model strongly depends on the initial model, hence it is prone to solution-entrapment in local minima of the misfit function, while the derivative calculation is often computationally inefficient and creates instabilities when numerical approximations are used. An alternative is to employ global techniques which do not rely on partial derivatives, are independent of the misfit form and are computationally robust. Such methods employ pseudo-randomly generated models (sampling an appropriately selected section of the model space) which are assessed in terms of their data-fit. A typical example is the class of methods known as genetic algorithms (GA), which achieves the aforementioned approximation through model representation and manipulations, and has attracted the attention of the earth sciences community during the last decade, with several applications already presented for several geophysical problems. In this paper, we examine the efficiency of the combination of the typical regularized least-squares and genetic methods for a typical seismic tomography problem. The proposed approach combines a local (LOM) and a global (GOM) optimization method, in an attempt to overcome the limitations of each individual approach, such as local minima and slow convergence, respectively. The potential of both optimization methods is tested and compared, both independently and jointly, using the several test models and synthetic refraction travel-time date sets
Jing Chen
2015-01-01
This study takes the concept of food logistics distribution as the breakthrough point, by means of the aim of optimization of food logistics distribution routes and analysis of the optimization model of food logistics route, as well as the interpretation of the genetic algorithm, it discusses the optimization of food logistics distribution route based on genetic and cluster scheme algorithm.
Genetic algorithms for adaptive real-time control in space systems
Vanderzijp, J.; Choudry, A.
1988-01-01
Genetic Algorithms that are used for learning as one way to control the combinational explosion associated with the generation of new rules are discussed. The Genetic Algorithm approach tends to work best when it can be applied to a domain independent knowledge representation. Applications to real time control in space systems are discussed.
Kumar, S.; Kaushal, D. R.; Gosain, A. K.
2017-12-01
Urban hydrology will have an increasing role to play in the sustainability of human settlements. Expansion of urban areas brings significant changes in physical characteristics of landuse. Problems with administration of urban flooding have their roots in concentration of population within a relatively small area. As watersheds are urbanized, infiltration decreases, pattern of surface runoff is changed generating high peak flows, large runoff volumes from urban areas. Conceptual rainfall-runoff models have become a foremost tool for predicting surface runoff and flood forecasting. Manual calibration is often time consuming and tedious because of the involved subjectivity, which makes automatic approach more preferable. The calibration of parameters usually includes numerous criteria for evaluating the performances with respect to the observed data. Moreover, derivation of objective function assosciat6ed with the calibration of model parameters is quite challenging. Various studies dealing with optimization methods has steered the embracement of evolution based optimization algorithms. In this paper, a systematic comparison of two evolutionary approaches to multi-objective optimization namely shuffled frog leaping algorithm (SFLA) and genetic algorithms (GA) is done. SFLA is a cooperative search metaphor, stimulated by natural memetics based on the population while, GA is based on principle of survival of the fittest and natural evolution. SFLA and GA has been employed for optimizing the major parameters i.e. width, imperviousness, Manning's coefficient and depression storage for the highly urbanized catchment of Delhi, India. The study summarizes the auto-tuning of a widely used storm water management model (SWMM), by internal coupling of SWMM with SFLA and GA separately. The values of statistical parameters such as, Nash-Sutcliffe efficiency (NSE) and Percent Bias (PBIAS) were found to lie within the acceptable limit, indicating reasonably good model performance
A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
Thammano, Arit; Teekeng, Wannaporn
2015-05-01
The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.
International Nuclear Information System (INIS)
Jayalal, M.L.; Kumar, L. Satish; Jehadeesan, R.; Rajeswari, S.; Satya Murty, S.A.V.; Balasubramaniyan, V.; Chetal, S.C.
2011-01-01
Highlights: → We model design optimization of a vital reactor component using Genetic Algorithm. → Real-parameter Genetic Algorithm is used for steam condenser optimization study. → Comparison analysis done with various Genetic Algorithm related mechanisms. → The results obtained are validated with the reference study results. - Abstract: This work explores the use of Real-parameter Genetic Algorithm and analyses its performance in the steam condenser (or Circulating Water System) optimization study of a 500 MW fast breeder nuclear reactor. Choice of optimum design parameters for condenser for a power plant from among a large number of technically viable combination is a complex task. This is primarily due to the conflicting nature of the economic implications of the different system parameters for maximizing the capitalized profit. In order to find the optimum design parameters a Real-parameter Genetic Algorithm model is developed and applied. The results obtained are validated with the reference study results.
Energy Technology Data Exchange (ETDEWEB)
Jayalal, M.L., E-mail: jayalal@igcar.gov.in [Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamil Nadu (India); Kumar, L. Satish, E-mail: satish@igcar.gov.in [Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamil Nadu (India); Jehadeesan, R., E-mail: jeha@igcar.gov.in [Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamil Nadu (India); Rajeswari, S., E-mail: raj@igcar.gov.in [Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamil Nadu (India); Satya Murty, S.A.V., E-mail: satya@igcar.gov.in [Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamil Nadu (India); Balasubramaniyan, V.; Chetal, S.C. [Indira Gandhi Centre for Atomic Research, Kalpakkam 603102, Tamil Nadu (India)
2011-10-15
Highlights: > We model design optimization of a vital reactor component using Genetic Algorithm. > Real-parameter Genetic Algorithm is used for steam condenser optimization study. > Comparison analysis done with various Genetic Algorithm related mechanisms. > The results obtained are validated with the reference study results. - Abstract: This work explores the use of Real-parameter Genetic Algorithm and analyses its performance in the steam condenser (or Circulating Water System) optimization study of a 500 MW fast breeder nuclear reactor. Choice of optimum design parameters for condenser for a power plant from among a large number of technically viable combination is a complex task. This is primarily due to the conflicting nature of the economic implications of the different system parameters for maximizing the capitalized profit. In order to find the optimum design parameters a Real-parameter Genetic Algorithm model is developed and applied. The results obtained are validated with the reference study results.
Simulating Evolution of Drosophila melanogaster Ebony Mutants Using a Genetic Algorithm
DEFF Research Database (Denmark)
Helles, Glennie
2009-01-01
Genetic algorithms are generally quite easy to understand and work with, and they are a popular choice in many cases. One area in which genetic algorithms are widely and successfully used is artificial life where they are used to simulate evolution of artificial creatures. However, despite...... their suggestive name, simplicity and popularity in artificial life, they do not seem to have gained a footing within the field of population genetics to simulate evolution of real organisms --- possibly because genetic algorithms are based on a rather crude simplification of the evolutionary mechanisms known...
Programmable genetic algorithm IP core for sensing and surveillance applications
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.
Using genetic algorithms to calibrate a water quality model.
Liu, Shuming; Butler, David; Brazier, Richard; Heathwaite, Louise; Khu, Soon-Thiam
2007-03-15
With the increasing concern over the impact of diffuse pollution on water bodies, many diffuse pollution models have been developed in the last two decades. A common obstacle in using such models is how to determine the values of the model parameters. This is especially true when a model has a large number of parameters, which makes a full range of calibration expensive in terms of computing time. Compared with conventional optimisation approaches, soft computing techniques often have a faster convergence speed and are more efficient for global optimum searches. This paper presents an attempt to calibrate a diffuse pollution model using a genetic algorithm (GA). Designed to simulate the export of phosphorus from diffuse sources (agricultural land) and point sources (human), the Phosphorus Indicators Tool (PIT) version 1.1, on which this paper is based, consisted of 78 parameters. Previous studies have indicated the difficulty of full range model calibration due to the number of parameters involved. In this paper, a GA was employed to carry out the model calibration in which all parameters were involved. A sensitivity analysis was also performed to investigate the impact of operators in the GA on its effectiveness in optimum searching. The calibration yielded satisfactory results and required reasonable computing time. The application of the PIT model to the Windrush catchment with optimum parameter values was demonstrated. The annual P loss was predicted as 4.4 kg P/ha/yr, which showed a good fitness to the observed value.
Exchange inlet optimization by genetic algorithm for improved RBCC performance
Chorkawy, G.; Etele, J.
2017-09-01
A genetic algorithm based on real parameter representation using a variable selection pressure and variable probability of mutation is used to optimize an annular air breathing rocket inlet called the Exchange Inlet. A rapid and accurate design method which provides estimates for air breathing, mixing, and isentropic flow performance is used as the engine of the optimization routine. Comparison to detailed numerical simulations show that the design method yields desired exit Mach numbers to within approximately 1% over 75% of the annular exit area and predicts entrained air massflows to between 1% and 9% of numerically simulated values depending on the flight condition. Optimum designs are shown to be obtained within approximately 8000 fitness function evaluations in a search space on the order of 106. The method is also shown to be able to identify beneficial values for particular alleles when they exist while showing the ability to handle cases where physical and aphysical designs co-exist at particular values of a subset of alleles within a gene. For an air breathing engine based on a hydrogen fuelled rocket an exchange inlet is designed which yields a predicted air entrainment ratio within 95% of the theoretical maximum.
Genetic Algorithm (GA)-Based Inclinometer Layout Optimization.
Liang, Weijie; Zhang, Ping; Chen, Xianping; Cai, Miao; Yang, Daoguo
2015-04-17
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.
Optimization on robot arm machining by using genetic algorithms
Liu, Tung-Kuan; Chen, Chiu-Hung; Tsai, Shang-En
2007-12-01
In this study, an optimization problem on the robot arm machining is formulated and solved by using genetic algorithms (GAs). The proposed approach adopts direct kinematics model and utilizes GA's global search ability to find the optimum solution. The direct kinematics equations of the robot arm are formulated and can be used to compute the end-effector coordinates. Based on these, the objective of optimum machining along a set of points can be evolutionarily evaluated with the distance between machining points and end-effector positions. Besides, a 3D CAD application, CATIA, is used to build up the 3D models of the robot arm, work-pieces and their components. A simulated experiment in CATIA is used to verify the computation results first and a practical control on the robot arm through the RS232 port is also performed. From the results, this approach is proved to be robust and can be suitable for most machining needs when robot arms are adopted as the machining tools.
Optimization of Nuclear Reactor power Distribution using Genetic Algorithm
International Nuclear Information System (INIS)
Kim, Hyu Chan
1996-02-01
The main purpose of study is to develop a computer code named as 'MGA-SCOUPE' which can determine an optimal fuel-loading pattern for the nuclear reactor. The developed code, MGA-SCOUPE, automatically lots of searches for the globally optimum solutions based upon the modified Genetic Algorithm(MGA). The optimization goal of the MGA-SCOUPE is (1) the minimization of the deviations in the power peaking factors both at BOC and EOC, and (2) the maximization of the average burnup ration at EOC of the total fuel assemblies. For the reactor core calculation module in the MGA-SCOUPE, the SCOUPE code was partially modified and used. It had been developed originally in MIT and has been used currently in Kyung Hee University. The application of the MGA-SCOUPE to KORI 4-4 Cycle Model show several satisfactory results. Among them, two dominant improvements compared with the SCOUPE code can be summarized as follow: - The MGA-SCOUPE removes the user-dependency problem of the SCOUPE in the optimal loading pattern searches. Therefore, the searching process in the MGA-SCOUPE can be easily automated. - The final fuel loading pattern obtained by the MGA-SCOUPE shows 25.8%, 18.7% reduced standard deviations of the power peaking factors both at BOC and EOC, and 45% increased avg. burnup ratio at EOC compare with those of the SCOUPE
Speed Bump Detection Using Accelerometric Features: A Genetic Algorithm Approach.
Celaya-Padilla, Jose M; Galván-Tejada, Carlos E; López-Monteagudo, F E; Alonso-González, O; Moreno-Báez, Arturo; Martínez-Torteya, Antonio; Galván-Tejada, Jorge I; Arceo-Olague, Jose G; Luna-García, Huizilopoztli; Gamboa-Rosales, Hamurabi
2018-02-03
Among the current challenges of the Smart City, traffic management and maintenance are of utmost importance. Road surface monitoring is currently performed by humans, but the road surface condition is one of the main indicators of road quality, and it may drastically affect fuel consumption and the safety of both drivers and pedestrians. Abnormalities in the road, such as manholes and potholes, can cause accidents when not identified by the drivers. Furthermore, human-induced abnormalities, such as speed bumps, could also cause accidents. In addition, while said obstacles ought to be signalized according to specific road regulation, they are not always correctly labeled. Therefore, we developed a novel method for the detection of road abnormalities (i.e., speed bumps). This method makes use of a gyro, an accelerometer, and a GPS sensor mounted in a car. After having the vehicle cruise through several streets, data is retrieved from the sensors. Then, using a cross-validation strategy, a genetic algorithm is used to find a logistic model that accurately detects road abnormalities. The proposed model had an accuracy of 0.9714 in a blind evaluation, with a false positive rate smaller than 0.018, and an area under the receiver operating characteristic curve of 0.9784. This methodology has the potential to detect speed bumps in quasi real-time conditions, and can be used to construct a real-time surface monitoring system.
Variable selection in Logistic regression model with genetic algorithm.
Zhang, Zhongheng; Trevino, Victor; Hoseini, Sayed Shahabuddin; Belciug, Smaranda; Boopathi, Arumugam Manivanna; Zhang, Ping; Gorunescu, Florin; Subha, Velappan; Dai, Songshi
2018-02-01
Variable or feature selection is one of the most important steps in model specification. Especially in the case of medical-decision making, the direct use of a medical database, without a previous analysis and preprocessing step, is often counterproductive. In this way, the variable selection represents the method of choosing the most relevant attributes from the database in order to build a robust learning models and, thus, to improve the performance of the models used in the decision process. In biomedical research, the purpose of variable selection is to select clinically important and statistically significant variables, while excluding unrelated or noise variables. A variety of methods exist for variable selection, but none of them is without limitations. For example, the stepwise approach, which is highly used, adds the best variable in each cycle generally producing an acceptable set of variables. Nevertheless, it is limited by the fact that it commonly trapped in local optima. The best subset approach can systematically search the entire covariate pattern space, but the solution pool can be extremely large with tens to hundreds of variables, which is the case in nowadays clinical data. Genetic algorithms (GA) are heuristic optimization approaches and can be used for variable selection in multivariable regression models. This tutorial paper aims to provide a step-by-step approach to the use of GA in variable selection. The R code provided in the text can be extended and adapted to other data analysis needs.
Finding optimal vaccination strategies for pandemic influenza using genetic algorithms.
Patel, Rajan; Longini, Ira M; Halloran, M Elizabeth
2005-05-21
In the event of pandemic influenza, only limited supplies of vaccine may be available. We use stochastic epidemic simulations, genetic algorithms (GA), and random mutation hill climbing (RMHC) to find optimal vaccine distributions to minimize the number of illnesses or deaths in the population, given limited quantities of vaccine. Due to the non-linearity, complexity and stochasticity of the epidemic process, it is not possible to solve for optimal vaccine distributions mathematically. However, we use GA and RMHC to find near optimal vaccine distributions. We model an influenza pandemic that has age-specific illness attack rates similar to the Asian pandemic in 1957-1958 caused by influenza A(H2N2), as well as a distribution similar to the Hong Kong pandemic in 1968-1969 caused by influenza A(H3N2). We find the optimal vaccine distributions given that the number of doses is limited over the range of 10-90% of the population. While GA and RMHC work well in finding optimal vaccine distributions, GA is significantly more efficient than RMHC. We show that the optimal vaccine distribution found by GA and RMHC is up to 84% more effective than random mass vaccination in the mid range of vaccine availability. GA is generalizable to the optimization of stochastic model parameters for other infectious diseases and population structures.
Genetic algorithm learning in a New Keynesian macroeconomic setup.
Hommes, Cars; Makarewicz, Tomasz; Massaro, Domenico; Smits, Tom
2017-01-01
In order to understand heterogeneous behavior amongst agents, empirical data from Learning-to-Forecast (LtF) experiments can be used to construct learning models. This paper follows up on Assenza et al. (2013) by using a Genetic Algorithms (GA) model to replicate the results from their LtF experiment. In this GA model, individuals optimize an adaptive, a trend following and an anchor coefficient in a population of general prediction heuristics. We replicate experimental treatments in a New-Keynesian environment with increasing complexity and use Monte Carlo simulations to investigate how well the model explains the experimental data. We find that the evolutionary learning model is able to replicate the three different types of behavior, i.e. convergence to steady state, stable oscillations and dampened oscillations in the treatments using one GA model. Heterogeneous behavior can thus be explained by an adaptive, anchor and trend extrapolating component and the GA model can be used to explain heterogeneous behavior in LtF experiments with different types of complexity.
Designing optimal degradation tests via multi-objective genetic algorithms
International Nuclear Information System (INIS)
Marseguerra, Marzio; Zio, Enrico; Cipollone, Maurizio
2003-01-01
The experimental determination of the failure time probability distribution of highly reliable components, such as those used in nuclear and aerospace applications, is intrinsically difficult due to the lack, or scarce significance, of failure data which can be collected during the relatively short test periods. A possibility to overcome this difficulty is to resort to the so-called degradation tests, in which measurements of components' degradation are used to infer the failure time distribution. To design such tests, parameters like the number of tests to be run, their frequency and duration, must be set so as to obtain an accurate estimate of the distribution statistics, under the existing limitations of budget. The optimisation problem which results is a non-linear one. In this work, we propose a method, based on multi-objective genetic algorithms for determining the values of the test parameters which optimise both the accuracy in the estimate of the failure time distribution percentiles and the testing costs. The method has been validated on a degradation model of literature
Alternatives and challenges in optimizing industrial safety using genetic algorithms
International Nuclear Information System (INIS)
Martorell, Sebastian; Sanchez, Ana; Carlos, Sofia; Serradell, Vicente
2004-01-01
Safety (S) improvement of industrial installations leans on the optimal allocation of designs that use more reliable equipment and testing and maintenance activities to assure a high level of reliability, availability and maintainability (RAM) for their safety-related systems. However, this also requires assigning a certain amount of resources (C) that are usually limited. Therefore, the decision-maker in this context faces in general a multiple-objective optimization problem (MOP) based on RAMS+C criteria where the parameters of design, testing and maintenance act as decision variables. Solutions to the MOP can be obtained by solving the problem directly, or by transforming it into several single-objective problems. A general framework for such MOP based on RAMS+C criteria is proposed in this paper. Then, problem formulation and fundamentals of two major groups of resolution alternatives are presented. Next, both alternatives are implemented in this paper using genetic algorithms (GAs), named single-objective GA and multi-objective GA, respectively, which are then used in the case of application to solve the problem of testing and maintenance optimization based on unavailability and cost criteria. The results show the capabilities and limitations of both approaches. Based on them, future challenges are identified in this field and guidelines provided for further research
Multi Objective Optimization Using Genetic Algorithm of a Pneumatic Connector
Salaam, HA; Taha, Zahari; Ya, TMYS Tuan
2018-03-01
The concept of sustainability was first introduced by Dr Harlem Brutland in the 1980’s promoting the need to preserve today’s natural environment for the sake of future generations. Based on this concept, John Elkington proposed an approach to measure sustainability known as Triple Bottom Line (TBL). There are three evaluation criteria’s involved in the TBL approach; namely economics, environmental integrity and social equity. In manufacturing industry the manufacturing costs measure the economic sustainability of a company in a long term. Environmental integrity is a measure of the impact of manufacturing activities on the environment. Social equity is complicated to evaluate; but when the focus is at the production floor level, the production operator health can be considered. In this paper, the TBL approach is applied in the manufacturing of a pneumatic nipple hose. The evaluation criteria used are manufacturing costs, environmental impact, ergonomics impact and also energy used for manufacturing. This study involves multi objective optimization by using genetic algorithm of several possible alternatives for material used in the manufacturing of the pneumatic nipple.
Shape: automatic conformation prediction of carbohydrates using a genetic algorithm
Directory of Open Access Journals (Sweden)
Rosen Jimmy
2009-09-01
Full Text Available Abstract Background Detailed experimental three dimensional structures of carbohydrates are often difficult to acquire. Molecular modelling and computational conformation prediction are therefore commonly used tools for three dimensional structure studies. Modelling procedures generally require significant training and computing resources, which is often impractical for most experimental chemists and biologists. Shape has been developed to improve the availability of modelling in this field. Results The Shape software package has been developed for simplicity of use and conformation prediction performance. A trivial user interface coupled to an efficient genetic algorithm conformation search makes it a powerful tool for automated modelling. Carbohydrates up to a few hundred atoms in size can be investigated on common computer hardware. It has been shown to perform well for the prediction of over four hundred bioactive oligosaccharides, as well as compare favourably with previously published studies on carbohydrate conformation prediction. Conclusion The Shape fully automated conformation prediction can be used by scientists who lack significant modelling training, and performs well on computing hardware such as laptops and desktops. It can also be deployed on computer clusters for increased capacity. The prediction accuracy under the default settings is good, as it agrees well with experimental data and previously published conformation prediction studies. This software is available both as open source and under commercial licenses.
Innovative applications of genetic algorithms to problems in accelerator physics
Directory of Open Access Journals (Sweden)
Alicia Hofler
2013-01-01
Full Text Available 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.
Trans gene regulation in adaptive evolution: a genetic algorithm model.
Behera, N; Nanjundiah, V
1997-09-21
This is a continuation of earlier studies on the evolution of infinite populations of haploid genotypes within a genetic algorithm framework. We had previously explored the evolutionary consequences of the existence of indeterminate-"plastic"-loci, where a plastic locus had a finite probability in each generation of functioning (being switched "on") or not functioning (being switched "off"). The relative probabilities of the two outcomes were assigned on a stochastic basis. The present paper examines what happens when the transition probabilities are biased by the presence of regulatory genes. We find that under certain conditions regulatory genes can improve the adaptation of the population and speed up the rate of evolution (on occasion at the cost of lowering the degree of adaptation). Also, the existence of regulatory loci potentiates selection in favour of plasticity. There is a synergistic effect of regulatory genes on plastic alleles: the frequency of such alleles increases when regulatory loci are present. Thus, phenotypic selection alone can be a potentiating factor in a favour of better adaptation. Copyright 1997 Academic Press Limited.
An Adaptive Test Sheet Generation Mechanism Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Huan-Yu Lin
2012-01-01
Full Text Available For test-sheet composition systems, it is important to adaptively compose test sheets with diverse conceptual scopes, discrimination and difficulty degrees to meet various assessment requirements during real learning situations. Computation time and item exposure rate also influence performance and item bank security. Therefore, this study proposes an Adaptive Test Sheet Generation (ATSG mechanism, where a Candidate Item Selection Strategy adaptively determines candidate test items and conceptual granularities according to desired conceptual scopes, and an Aggregate Objective Function applies Genetic Algorithm (GA to figure out the approximate solution of mixed integer programming problem for the test-sheet composition. Experimental results show that the ATSG mechanism can efficiently, precisely generate test sheets to meet the various assessment requirements than existing ones. Furthermore, according to experimental finding, Fractal Time Series approach can be applied to analyze the self-similarity characteristics of GA’s fitness scores for improving the quality of the test-sheet composition in the near future.
Speed Bump Detection Using Accelerometric Features: A Genetic Algorithm Approach
Directory of Open Access Journals (Sweden)
Jose M. Celaya-Padilla
2018-02-01
Full Text Available Among the current challenges of the Smart City, traffic management and maintenance are of utmost importance. Road surface monitoring is currently performed by humans, but the road surface condition is one of the main indicators of road quality, and it may drastically affect fuel consumption and the safety of both drivers and pedestrians. Abnormalities in the road, such as manholes and potholes, can cause accidents when not identified by the drivers. Furthermore, human-induced abnormalities, such as speed bumps, could also cause accidents. In addition, while said obstacles ought to be signalized according to specific road regulation, they are not always correctly labeled. Therefore, we developed a novel method for the detection of road abnormalities (i.e., speed bumps. This method makes use of a gyro, an accelerometer, and a GPS sensor mounted in a car. After having the vehicle cruise through several streets, data is retrieved from the sensors. Then, using a cross-validation strategy, a genetic algorithm is used to find a logistic model that accurately detects road abnormalities. The proposed model had an accuracy of 0.9714 in a blind evaluation, with a false positive rate smaller than 0.018, and an area under the receiver operating characteristic curve of 0.9784. This methodology has the potential to detect speed bumps in quasi real-time conditions, and can be used to construct a real-time surface monitoring system.
Optimizing Fukushima Emissions Through Pattern Matching and Genetic Algorithms
Lucas, D. D.; Simpson, M. D.; Philip, C. S.; Baskett, R.
2017-12-01
Hazardous conditions during the Fukushima Daiichi nuclear power plant (NPP) accident hindered direct observations of the emissions of radioactive materials into the atmosphere. A wide range of emissions are estimated from bottom-up studies using reactor inventories and top-down approaches based on inverse modeling. We present a new inverse modeling estimate of cesium-137 emitted from the Fukushima NPP. Our estimate considers weather uncertainty through a large ensemble of Weather Research and Forecasting model simulations and uses the FLEXPART atmospheric dispersion model to transport and deposit cesium. The simulations are constrained by observations of the spatial distribution of cumulative cesium deposited on the surface of Japan through April 2, 2012. Multiple spatial metrics are used to quantify differences between observed and simulated deposition patterns. In order to match the observed pattern, we use a multi-objective genetic algorithm to optimize the time-varying emissions. We find that large differences with published bottom-up estimates are required to explain the observations. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.
Improved interpretation of satellite altimeter data using genetic algorithms
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.
Feature selection using genetic algorithms for fetal heart rate analysis
International Nuclear Information System (INIS)
Xu, Liang; Redman, Christopher W G; Georgieva, Antoniya; Payne, Stephen J
2014-01-01
The fetal heart rate (FHR) is monitored on a paper strip (cardiotocogram) during labour to assess fetal health. If necessary, clinicians can intervene and assist with a prompt delivery of the baby. Data-driven computerized FHR analysis could help clinicians in the decision-making process. However, selecting the best computerized FHR features that relate to labour outcome is a pressing research problem. The objective of this study is to apply genetic algorithms (GA) as a feature selection method to select the best feature subset from 64 FHR features and to integrate these best features to recognize unfavourable FHR patterns. The GA was trained on 404 cases and tested on 106 cases (both balanced datasets) using three classifiers, respectively. Regularization methods and backward selection were used to optimize the GA. Reasonable classification performance is shown on the testing set for the best feature subset (Cohen's kappa values of 0.45 to 0.49 using different classifiers). This is, to our knowledge, the first time that a feature selection method for FHR analysis has been developed on a database of this size. This study indicates that different FHR features, when integrated, can show good performance in predicting labour outcome. It also gives the importance of each feature, which will be a valuable reference point for further studies. (paper)
Optimal Intermittent Dose Schedules for Chemotherapy Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Nadia ALAM
2013-08-01
Full Text Available In this paper, a design method for optimal cancer chemotherapy schedules via genetic algorithm (GA is presented. The design targets the key objective of chemotherapy to minimize the size of cancer tumor after a predefined time with keeping toxic side effects in limit. This is a difficult target to achieve using conventional clinical methods due to poor therapeutic indices of existing anti-cancer drugs. Moreover, there are clinical limitations in treatment administration to maintain continuous treatment. Besides, carefully decided rest periods are recommended to for patient’s comfort. Three intermittent drug scheduling schemes are presented in this paper where GA is used to optimize the dose quantities and timings by satisfying several treatment constraints. All three schemes are found to be effective in total elimination of cancer tumor after an agreed treatment length. The number of cancer cells is found zero at the end of the treatment for all three cases with tolerable toxicity. Finally, two of the schemes, “Fixed interval variable dose (FIVD and “Periodic dose” that are periodic in characteristic have been emphasized due to their additional simplicity in administration along with friendliness to patients. responses to the designed treatment schedules. Therefore the proposed design method is capable of planning effective, simple, patient friendly and acceptable chemotherapy schedules.
Solving fuzzy shortest path problem by genetic algorithm
Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.
2018-03-01
Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.
Route Selection with Unspecified Sites Using Knowledge Based Genetic Algorithm
Kanoh, Hitoshi; Nakamura, Nobuaki; Nakamura, Tomohiro
This paper addresses the problem of selecting a route to a given destination that traverses several non-specific sites (e.g. a bank, a gas station) as requested by a driver. The proposed solution uses a genetic algorithm that includes viral infection. The method is to generate two populations of viruses as domain specific knowledge in addition to a population of routes. A part of an arterial road is regarded as a main virus, and a road that includes a site is regarded as a site virus. An infection occurs between two points common to a candidate route and the virus, and involves the substitution of the intersections carried by the virus for those on the existing candidate route. Crossover and infection determine the easiest-to-drive and quasi-shortest route through the objective landmarks. Experiments using actual road maps show that this infection-based mechanism is an effective way of solving the problem. Our strategy is general, and can be effectively used in other optimization problems.
Optimizing SRF Gun Cavity Profiles in a Genetic Algorithm Framework
International Nuclear Information System (INIS)
Hofler, Alicia; Evtushenko, Pavel; Marhauser, Frank
2009-01-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.
Ripple-Spreading Network Model Optimization by Genetic Algorithm
Directory of Open Access Journals (Sweden)
Xiao-Bing Hu
2013-01-01
Full Text Available Small-world and scale-free properties are widely acknowledged in many real-world complex network systems, and many network models have been developed to capture these network properties. The ripple-spreading network model (RSNM is a newly reported complex network model, which is inspired by the natural ripple-spreading phenomenon on clam water surface. The RSNM exhibits good potential for describing both spatial and temporal features in the development of many real-world networks where the influence of a few local events spreads out through nodes and then largely determines the final network topology. However, the relationships between ripple-spreading related parameters (RSRPs of RSNM and small-world and scale-free topologies are not as obvious or straightforward as in many other network models. This paper attempts to apply genetic algorithm (GA to tune the values of RSRPs, so that the RSNM may generate these two most important network topologies. The study demonstrates that, once RSRPs are properly tuned by GA, the RSNM is capable of generating both network topologies and therefore has a great flexibility to study many real-world complex network systems.
International Nuclear Information System (INIS)
Tolabi, H.B.; Ayob, S.M.
2014-01-01
In this paper, a novel approach based on simulated annealing algorithm as a meta-heuristic method is implemented in MATLAB software to estimate the monthly average daily global solar radiation on a horizontal surface for six different climate cities of Iran. A search method based on genetic algorithm is applied to accelerate problem solving. Results show that simulated annealing based on genetic algorithm search is a suitable method to find the global solar radiation. (author)
Research and application of multi-agent genetic algorithm in tower defense game
Jin, Shaohua
2018-04-01
In this paper, a new multi-agent genetic algorithm based on orthogonal experiment is proposed, which is based on multi-agent system, genetic algorithm and orthogonal experimental design. The design of neighborhood competition operator, orthogonal crossover operator, Son and self-learning operator. The new algorithm is applied to mobile tower defense game, according to the characteristics of the game, the establishment of mathematical models, and finally increases the value of the game's monster.
Directory of Open Access Journals (Sweden)
Qiuhong Sun
2014-04-01
Full Text Available Based on the data mining research, the data mining based on genetic algorithm method, the genetic algorithm is briefly introduced, while the genetic algorithm based on two important theories and theoretical templates principle implicit parallelism is also discussed. Focuses on the application of genetic algorithms for association rule mining method based on association rule mining, this paper proposes a genetic algorithm fitness function structure, data encoding, such as the title of the improvement program, in particular through the early issues study, proposed the improved adaptive Pc, Pm algorithm is applied to the genetic algorithm, thereby improving efficiency of the algorithm. Finally, a genetic algorithm based association rule mining algorithm, and be applied in sea water samples database in data mining and prove its effective.
Use of a genetic algorithm in a subchannel model
International Nuclear Information System (INIS)
Alberto Teyssedou; Armando Nava-Dominguez
2005-01-01
Full text of publication follows: The channel of a nuclear reactor contains the fuel bundles which are made up of fuel elements distributed in a manner that creates a series of interconnected subchannels through which the coolant flows. Subchannel codes are used to determine local flow variables; these codes consider the complex geometry of a nuclear fuel bundle as being divided in simple parallel and interconnected cells called 'subchannels'. Each subchannel is bounded by the solid walls of the fuel rods or by imaginary boundaries placed between adjacent subchannels. In each subchannel the flow is considered as one dimensional, therefore lateral mixing mechanisms between subchannels should be taken into account. These mixing mechanisms are: Diversion cross-flow, Turbulent mixing, Turbulent void diffusion, Void drift and Buoyancy drift; they are implemented as independent contribution terms in a pseudo-vectorial lateral momentum equation. These mixing terms are calculated with correlations that require the use of empirical coefficients. It has been observed, however, that there is no unique set of coefficients and or correlations that can be used to predict a complete range of experimental conditions. To avoid this drawback, in this paper a Genetic Algorithm (GA) was coupled to a subchannel model. The use of a GA in conjunction with an appropriate objective function allows the subchannel model to internally determine the optimal values of the coefficients without user intervention. The subchannel model requires two diffusion coefficients, the drift flux two-phase flow distribution coefficient, C 0 , and a coefficient used to control the lateral pressure losses. The GA algorithm was implemented in order to find the most appropriate values of these four coefficients. Genetic algorithms (GA) are based on the theory of evolution; thus, the GA manipulates a population of individuals (chromosomes) in order to evolve them towards a best adaptation (fitness criterion) to
A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.
Hajri, S; Liouane, N; Hammadi, S; Borne, P
2000-01-01
Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.
Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms
Luo, Zihan; Armour, Simon; McGeehan, Joe
2015-01-01
This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implementedto guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genet...
A fuzzy hill-climbing algorithm for the development of a compact associative classifier
Mitra, Soumyaroop; Lam, Sarah S.
2012-02-01
Classification, a data mining technique, has widespread applications including medical diagnosis, targeted marketing, and others. Knowledge discovery from databases in the form of association rules is one of the important data mining tasks. An integrated approach, classification based on association rules, has drawn the attention of the data mining community over the last decade. While attention has been mainly focused on increasing classifier accuracies, not much efforts have been devoted towards building interpretable and less complex models. This paper discusses the development of a compact associative classification model using a hill-climbing approach and fuzzy sets. The proposed methodology builds the rule-base by selecting rules which contribute towards increasing training accuracy, thus balancing classification accuracy with the number of classification association rules. The results indicated that the proposed associative classification model can achieve competitive accuracies on benchmark datasets with continuous attributes and lend better interpretability, when compared with other rule-based systems.
Automatic Curve Fitting Based on Radial Basis Functions and a Hierarchical Genetic Algorithm
Directory of Open Access Journals (Sweden)
G. Trejo-Caballero
2015-01-01
Full Text Available Curve fitting is a very challenging problem that arises in a wide variety of scientific and engineering applications. Given a set of data points, possibly noisy, the goal is to build a compact representation of the curve that corresponds to the best estimate of the unknown underlying relationship between two variables. Despite the large number of methods available to tackle this problem, it remains challenging and elusive. In this paper, a new method to tackle such problem using strictly a linear combination of radial basis functions (RBFs is proposed. To be more specific, we divide the parameter search space into linear and nonlinear parameter subspaces. We use a hierarchical genetic algorithm (HGA to minimize a model selection criterion, which allows us to automatically and simultaneously determine the nonlinear parameters and then, by the least-squares method through Singular Value Decomposition method, to compute the linear parameters. The method is fully automatic and does not require subjective parameters, for example, smooth factor or centre locations, to perform the solution. In order to validate the efficacy of our approach, we perform an experimental study with several tests on benchmarks smooth functions. A comparative analysis with two successful methods based on RBF networks has been included.
Bandyopadhyay, Sanghamitra
2007-01-01
This book provides a unified framework that describes how genetic learning can be used to design pattern recognition and learning systems. It examines how a search technique, the genetic algorithm, can be used for pattern classification mainly through approximating decision boundaries. Coverage also demonstrates the effectiveness of the genetic classifiers vis-à-vis several widely used classifiers, including neural networks.
Classon, Johan; Andersson, Viktor
2016-01-01
This thesis describes the implementation and evaluation of a genetic algorithm (GA) for procedurally generating levels with controllable difficulty for a motion-based 2D platform game. Manually creating content can be time-consuming, and it may be desirable to automate this process with an algorithm, using Procedural Content Generation (PCG). An algorithm was implemented and then refined with an iterative method by conducting user tests. The resulting algorithm is considered a success and sho...
Optimization of heat exchanger networks using genetic algorithms
International Nuclear Information System (INIS)
Teyssedou, A.; Dipama, J.; Sorin, M.
2004-01-01
Most thermal processes encountered in the power industry (chemical, metallurgical, nuclear and thermal power stations) necessitate the transfer of large amounts of heat between fluids having different thermal potentials. A common practice applied to achieve such a requirement consists of using heat exchangers. In general, each current of fluid is conveniently cooled or heated independently from each other in the power plant. When the number of heat exchangers is large enough, however, a convenient arrangement of different flow currents may allow a considerable reduction in energy consumption to be obtained (Linnhoff and Hidmarsh, 1983). In such a case the heat exchangers form a 'Heat Exchanger Network' (HEN) that can be optimized to reduce the overall energy consumption. This type of optimization problem, involves two separates calculation procedures. First, it is necessary to optimize the topology of the HEN that will permit a reduction in energy consumption to be obtained. In a second step the power distribution across the HEN should be optimized without violating the second law of thermodynamics. The numerical treatment of this kind of problem requires the use of both discrete variables (for taking into account each heat exchanger unit) and continuous variables for handling the thermal load of each unit. It is obvious that for a large number of heat exchangers, the use of conventional calculation methods, i.e., Simplexe, becomes almost impossible. Therefore, in this paper we present a 'Genetic Algorithm' (GA), that has been implemented and successfully used to treat complex HENs, containing a large number of heat exchangers. As opposed to conventional optimization techniques that require the knowledge of the derivatives of a function, GAs start the calculation process from a large population of possible solutions of a given problem (Goldberg, 1999). Each possible solution is in turns evaluated according to a 'fitness' criterion obtained from an objective
Portfolio optimization by using linear programing models based on genetic algorithm
Sukono; Hidayat, Y.; Lesmana, E.; Putra, A. S.; Napitupulu, H.; Supian, S.
2018-01-01
In this paper, we discussed the investment portfolio optimization using linear programming model based on genetic algorithms. It is assumed that the portfolio risk is measured by absolute standard deviation, and each investor has a risk tolerance on the investment portfolio. To complete the investment portfolio optimization problem, the issue is arranged into a linear programming model. Furthermore, determination of the optimum solution for linear programming is done by using a genetic algorithm. As a numerical illustration, we analyze some of the stocks traded on the capital market in Indonesia. Based on the analysis, it is shown that the portfolio optimization performed by genetic algorithm approach produces more optimal efficient portfolio, compared to the portfolio optimization performed by a linear programming algorithm approach. Therefore, genetic algorithms can be considered as an alternative on determining the investment portfolio optimization, particularly using linear programming models.
Directory of Open Access Journals (Sweden)
Wensheng Guo
Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
Genetic algorithms with memory- and elitism-based immigrants in dynamic environments.
Yang, Shengxiang
2008-01-01
In recent years the genetic algorithm community has shown a growing interest 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 by maintaining the population diversity while the memory scheme aims to adapt genetic algorithms quickly to new environments by reusing historical information. This paper investigates a hybrid memory and random immigrants scheme, called memory-based immigrants, and a hybrid elitism and random immigrants scheme, called elitism-based immigrants, for genetic algorithms in dynamic environments. In these schemes, the best individual from memory or the elite from the previous generation is retrieved as the base to create immigrants into the population by mutation. This way, not only can diversity be maintained but it is done more efficiently to adapt genetic algorithms to the current environment. Based on a series of systematically constructed dynamic problems, experiments are carried out to compare genetic algorithms with the memory-based and elitism-based immigrants schemes against genetic algorithms with traditional memory and random immigrants schemes and a hybrid memory and multi-population scheme. The sensitivity analysis regarding some key parameters is also carried out. Experimental results show that the memory-based and elitism-based immigrants schemes efficiently improve the performance of genetic algorithms in dynamic environments.
Springback optimization in automotive Shock Absorber Cup with Genetic Algorithm
Kakandikar, Ganesh; Nandedkar, Vilas
2018-02-01
Drawing or forming is a process normally used to achieve a required component form from a metal blank by applying a punch which radially draws the blank into the die by a mechanical or hydraulic action or combining both. When the component is drawn for more depth than the diameter, it is usually seen as deep drawing, which involves complicated states of material deformation. Due to the radial drawing of the material as it enters the die, radial drawing stress occurs in the flange with existence of the tangential compressive stress. This compression generates wrinkles in the flange. Wrinkling is unwanted phenomenon and can be controlled by application of a blank-holding force. Tensile stresses cause thinning in the wall region of the cup. Three main types of the errors occur in such a process are wrinkling, fracturing and springback. This paper reports a work focused on the springback and control. Due to complexity of the process, tool try-outs and experimentation may be costly, bulky and time consuming. Numerical simulation proves to be a good option for studying the process and developing a control strategy for reducing the springback. Finite-element based simulations have been used popularly for such purposes. In this study, the springback in deep drawing of an automotive Shock Absorber Cup is simulated with finite element method. Taguchi design of experiments and analysis of variance are used to analyze the influencing process parameters on the springback. Mathematical relations are developed to relate the process parameters and the resulting springback. The optimization problem is formulated for the springback, referring to the displacement magnitude in the selected sections. Genetic Algorithm is then applied for process optimization with an objective to minimize the springback. The results indicate that a better prediction of the springback and process optimization could be achieved with a combined use of these methods and tools.
Dynamic characterization of oil fields, complex stratigraphically using genetic algorithms
International Nuclear Information System (INIS)
Gonzalez, Santiago; Hidrobo, Eduardo A
2004-01-01
A novel methodology is presented in this paper for the characterization of highly heterogeneous oil fields by integration of the oil fields dynamic information to the static updated model. The objective of the oil field's characterization process is to build an oil field model, as realistic as possible, through the incorporation of all the available information. The classical approach consists in producing a model based in the oil field's static information, having as the process final stage the validation model with the dynamic information available. It is important to clarify that the term validation implies a punctual process by nature, generally intended to secure the required coherence between productive zones and petrophysical properties. The objective of the proposed methodology is to enhance the prediction capacity of the oil field's model by previously integrating, parameters inherent to the oil field's fluid dynamics by a process of dynamic data inversion through an optimization procedure based on evolutionary computation. The proposed methodology relies on the construction of the oil field's high-resolution static model, escalated by means of hybrid techniques while aiming to preserve the oil field's heterogeneity. Afterwards, using an analytic simulator as reference, the scaled model is methodically modified by means of an optimization process that uses genetic algorithms and production data as conditional information. The process's final product is a model that observes the static and dynamic conditions of the oil field with the capacity to minimize the economic impact that generates production historical adjustments to the simulation tasks. This final model features some petrophysical properties (porosity, permeability and water saturation), as modified to achieve a better adjustment of the simulated production's history versus the real one history matching. Additionally, the process involves a slight modification of relative permeability, which has
A genetic algorithm based method for neutron spectrum unfolding
International Nuclear Information System (INIS)
Suman, Vitisha; Sarkar, P.K.
2013-03-01
An approach to neutron spectrum unfolding based on a stochastic evolutionary search mechanism - Genetic Algorithm (GA) is presented. It is tested to unfold a set of simulated spectra, the unfolded spectra is compared to the output of a standard code FERDOR. The method was then applied to a set of measured pulse height spectrum of neutrons from the AmBe source as well as of emitted neutrons from Li(p,n) and Ag(C,n) nuclear reactions carried out in the accelerator environment. The unfolded spectra compared to the output of FERDOR show good agreement in the case of AmBe spectra and Li(p,n) spectra. In the case of Ag(C,n) spectra GA method results in some fluctuations. Necessity of carrying out smoothening of the obtained solution is also studied, which leads to approximation of the solution yielding an appropriate solution finally. Few smoothing techniques like second difference smoothing, Monte Carlo averaging, combination of both and gaussian based smoothing methods are also studied. Unfolded results obtained after inclusion of the smoothening criteria are in close agreement with the output obtained from the FERDOR code. The present method is also tested on a set of underdetermined problems, the outputs of which is compared to the unfolded spectra obtained from the FERDOR applied to a completely determined problem, shows a good match. The distribution of the unfolded spectra is also studied. Uncertainty propagation in the unfolded spectra due to the errors present in the measurement as well as the response function is also carried out. The method appears to be promising for unfolding the completely determined as well as underdetermined problems. It also has provisions to carry out the uncertainty analysis. (author)
Global search in photoelectron diffraction structure determination using genetic algorithms
Energy Technology Data Exchange (ETDEWEB)
Viana, M L [Departamento de Fisica, Icex, UFMG, Belo Horizonte, Minas Gerais (Brazil); Muino, R Diez [Donostia International Physics Center DIPC, Paseo Manuel de Lardizabal 4, 20018 San Sebastian (Spain); Soares, E A [Departamento de Fisica, Icex, UFMG, Belo Horizonte, Minas Gerais (Brazil); Hove, M A Van [Department of Physics and Materials Science, City University of Hong Kong, Hong Kong (China); Carvalho, V E de [Departamento de Fisica, Icex, UFMG, Belo Horizonte, Minas Gerais (Brazil)
2007-11-07
Photoelectron diffraction (PED) is an experimental technique widely used to perform structural determinations of solid surfaces. Similarly to low-energy electron diffraction (LEED), structural determination by PED requires a fitting procedure between the experimental intensities and theoretical results obtained through simulations. Multiple scattering has been shown to be an effective approach for making such simulations. The quality of the fit can be quantified through the so-called R-factor. Therefore, the fitting procedure is, indeed, an R-factor minimization problem. However, the topography of the R-factor as a function of the structural and non-structural surface parameters to be determined is complex, and the task of finding the global minimum becomes tough, particularly for complex structures in which many parameters have to be adjusted. In this work we investigate the applicability of the genetic algorithm (GA) global optimization method to this problem. The GA is based on the evolution of species, and makes use of concepts such as crossover, elitism and mutation to perform the search. We show results of its application in the structural determination of three different systems: the Cu(111) surface through the use of energy-scanned experimental curves; the Ag(110)-c(2 x 2)-Sb system, in which a theory-theory fit was performed; and the Ag(111) surface for which angle-scanned experimental curves were used. We conclude that the GA is a highly efficient method to search for global minima in the optimization of the parameters that best fit the experimental photoelectron diffraction intensities to the theoretical ones.
GRAVITATIONAL LENS MODELING WITH GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZERS
International Nuclear Information System (INIS)
Rogers, Adam; Fiege, Jason D.
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 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.
The use of genetic algorithms to model protoplanetary discs
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.
Genetic algorithm optimization for dynamic construction site layout planning
Directory of Open Access Journals (Sweden)
Farmakis Panagiotis M.
2018-02-01
Full Text Available The dynamic construction site layout planning (DCSLP problem refers to the efficient placement and relocation of temporary construction facilities within a dynamically changing construction site environment considering the characteristics of facilities and work interrelationships, the shape and topography of the construction site, and the time-varying project needs. A multi-objective dynamic optimization model is developed for this problem that considers construction and relocation costs of facilities, transportation costs of resources moving from one facility to another or to workplaces, as well as safety and environmental considerations resulting from facilities’ operations and interconnections. The latter considerations are taken into account in the form of preferences or constraints regarding the proximity or remoteness of particular facilities to other facilities or work areas. The analysis of multiple project phases and the dynamic facility relocation from phase to phase highly increases the problem size, which, even in its static form, falls within the NP (for Nondeterministic Polynomial time- hard class of combinatorial optimization problems. For this reason, a genetic algorithm has been implemented for the solution due to its capability to robustly search within a large solution space. Several case studies and operational scenarios have been implemented through the Palisade’s Evolver software for model testing and evaluation. The results indicate satisfactory model response to time-varying input data in terms of solution quality and computation time. The model can provide decision support to site managers, allowing them to examine alternative scenarios and fine-tune optimal solutions according to their experience by introducing desirable preferences or constraints in the decision process.
Design optimization of space launch vehicles using a genetic algorithm
Bayley, Douglas James
The United States Air Force (USAF) continues to have a need for assured access to space. In addition to flexible and responsive spacelift, a reduction in the cost per launch of space launch vehicles is also desirable. For this purpose, an investigation of the design optimization of space launch vehicles has been conducted. Using a suite of custom codes, the performance aspects of an entire space launch vehicle were analyzed. A genetic algorithm (GA) was employed to optimize the design of the space launch vehicle. A cost model was incorporated into the optimization process with the goal of minimizing the overall vehicle cost. The other goals of the design optimization included obtaining the proper altitude and velocity to achieve a low-Earth orbit. Specific mission parameters that are particular to USAF space endeavors were specified at the start of the design optimization process. Solid propellant motors, liquid fueled rockets, and air-launched systems in various configurations provided the propulsion systems for two, three and four-stage launch vehicles. Mass properties models, an aerodynamics model, and a six-degree-of-freedom (6DOF) flight dynamics simulator were all used to model the system. The results show the feasibility of this method in designing launch vehicles that meet mission requirements. Comparisons to existing real world systems provide the validation for the physical system models. However, the ability to obtain a truly minimized cost was elusive. The cost model uses an industry standard approach, however, validation of this portion of the model was challenging due to the proprietary nature of cost figures and due to the dependence of many existing systems on surplus hardware.
Advertisement scheduling on commercial radio station using genetics algorithm
Purnamawati, S.; Nababan, E. B.; Tsani, B.; Taqyuddin, R.; Rahmat, R. F.
2018-03-01
On the commercial radio station, the advertising schedule is done manually, which resulted in ineffectiveness of ads schedule. Playback time consists of two types such as prime time and regular time. Radio Ads scheduling will be discussed in this research is based on ad playback schedule between 5am until 12am which rules every 15 minutes. It provides 3 slots ads with playback duration per ads maximum is 1 minute. If the radio broadcast time per day is 12 hours, then the maximum number of ads per day which can be aired is 76 ads. The other is the enactment of rules of prime time, namely the hours where the common people (listeners) have the greatest opportunity to listen to the radio, namely between the hours and hours of 4 am - 8 am, 6 pm - 10 pm. The number of screenings of the same ads on one day are limited to prime time ie 5 times, while for regular time is 8 times. Radio scheduling process is done using genetic algorithms which are composed of processes initialization chromosomes, selection, crossover and mutation. Study on chromosome 3 genes, each chromosome will be evaluated based on the value of fitness calculated based on the number of infractions that occurred on each individual chromosome. Where rule 1 is the number of screenings per ads must not be more than 5 times per day and rule 2 is there should never be two or more scheduling ads delivered on the same day and time. After fitness value of each chromosome is acquired, then the do the selection, crossover and mutation. From this research result, the optimal advertising schedule with schedule a whole day and ads data playback time ads with this level of accuracy: the average percentage was 83.79%.
Hybridizing Differential Evolution with a Genetic Algorithm for Color Image Segmentation
Directory of Open Access Journals (Sweden)
R. V. V. Krishna
2016-10-01
Full Text Available This paper proposes a hybrid of differential evolution and genetic algorithms to solve the color image segmentation problem. Clustering based color image segmentation algorithms segment an image by clustering the features of color and texture, thereby obtaining accurate prototype cluster centers. In the proposed algorithm, the color features are obtained using the homogeneity model. A new texture feature named Power Law Descriptor (PLD which is a modification of Weber Local Descriptor (WLD is proposed and further used as a texture feature for clustering. Genetic algorithms are competent in handling binary variables, while differential evolution on the other hand is more efficient in handling real parameters. The obtained texture feature is binary in nature and the color feature is a real value, which suits very well the hybrid cluster center optimization problem in image segmentation. Thus in the proposed algorithm, the optimum texture feature centers are evolved using genetic algorithms, whereas the optimum color feature centers are evolved using differential evolution.
A genetic algorithm for the optimization of fiber angles in composite laminates
International Nuclear Information System (INIS)
Hwang, Shun Fa; Hsu, Ya Chu; Chen, Yuder
2014-01-01
A genetic algorithm for the optimization of composite laminates is proposed in this work. The well-known roulette selection criterion, one-point crossover operator, and uniform mutation operator are used in this genetic algorithm to create the next population. To improve the hill-climbing capability of the algorithm, adaptive mechanisms designed to adjust the probabilities of the crossover and mutation operators are included, and the elite strategy is enforced to ensure the quality of the optimum solution. The proposed algorithm includes a new operator called the elite comparison, which compares and uses the differences in the design variables of the two best solutions to find possible combinations. This genetic algorithm is tested in four optimization problems of composite laminates. Specifically, the effect of the elite comparison operator is evaluated. Results indicate that the elite comparison operator significantly accelerates the convergence of the algorithm, which thus becomes a good candidate for the optimization of composite laminates.
Energy Technology Data Exchange (ETDEWEB)
Kawanishi, H.; Hagiwara, M. [Keio University, Tokyo (Japan)
1998-05-01
Improved Genetic Algorithms (GAs) have been proposed in this paper. We have directed our attention to `selection` and `crossover` in GAs. Novel strategies in selection and crossover are used in the proposed method. Various selecting strategies have been used in the conventional GAs such as Elitism, Tournament, Ranking, Roulette wheel, and Expected value model. These are not always effective, since these refer to only the fitness of each chromosome. We have developed the following techniques to improve the conventional GAs: `inverse-elitism` as a selecting strategy and variable crossover range as a crossover strategy. In the `inverse-elitism`, an inverse-elite whose gene values are reversed from those in the corresponding elite is produced. This strategy greatly contributes to diversification of chromosomes. As for the variable crossover range, we combine the following crossover techniques effectively: one is that range in crossover is varied from wide to narrow gradually to carry out global search in the beginning and local search in the ending; another is that range in crossover is varied from narrow to wide. We confirmed validity and superior performance of the proposed method by computer simulations. 18 refs., 9 figs., 3 tabs.
Multiple depots vehicle routing based on the ant colony with the genetic algorithm
Directory of Open Access Journals (Sweden)
ChunYing Liu
2013-09-01
Full Text Available Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm
Increasing Prediction the Original Final Year Project of Student Using Genetic Algorithm
Saragih, Rijois Iboy Erwin; Turnip, Mardi; Sitanggang, Delima; Aritonang, Mendarissan; Harianja, Eva
2018-04-01
Final year project is very important forgraduation study of a student. Unfortunately, many students are not seriouslydidtheir final projects. Many of studentsask for someone to do it for them. In this paper, an application of genetic algorithms to predict the original final year project of a studentis proposed. In the simulation, the data of the final project for the last 5 years is collected. The genetic algorithm has several operators namely population, selection, crossover, and mutation. The result suggest that genetic algorithm can do better prediction than other comparable model. Experimental results of predicting showed that 70% was more accurate than the previous researched.
Hitting times of local and global optima in genetic algorithms with very high selection pressure
Directory of Open Access Journals (Sweden)
Eremeev Anton V.
2017-01-01
Full Text Available The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds do not require the probability of fitness-decreasing mutation to be bounded by a constant which is less than one.
A Novel Real-coded Quantum-inspired Genetic Algorithm and Its Application in Data Reconciliation
Directory of Open Access Journals (Sweden)
Gao Lin
2012-06-01
Full Text Available Traditional quantum-inspired genetic algorithm (QGA has drawbacks such as premature convergence, heavy computational cost, complicated coding and decoding process etc. In this paper, a novel real-coded quantum-inspired genetic algorithm is proposed based on interval division thinking. Detailed comparisons with some similar approaches for some standard benchmark functions test validity of the proposed algorithm. Besides, the proposed algorithm is used in two typical nonlinear data reconciliation problems (distilling process and extraction process and simulation results show its efficiency in nonlinear data reconciliation problems.
Hybrid Modeling KMeans – Genetic Algorithms in the Health Care Data
Directory of Open Access Journals (Sweden)
Tessy Badriyah
2013-06-01
Full Text Available K-Means is one of the major algorithms widely used in clustering due to its good computational performance. However, K-Means is very sensitive to the initially selected points which randomly selected, and therefore it does not always generate optimum solutions. Genetic algorithm approach can be applied to solve this problem. In this research we examine the potential of applying hybrid GA- KMeans with focus on the area of health care data. We proposed a new technique using hybrid method combining KMeans Clustering and Genetic Algorithms, called the “Hybrid K-Means Genetic Algorithms” (HKGA. HKGA combines the power of Genetic Algorithms and the efficiency of K-Means Clustering. We compare our results with other conventional algorithms and also with other published research as well. Our results demonstrate that the HKGA achieves very good results and in some cases superior to other methods. Keywords: Machine Learning, K-Means, Genetic Algorithms, Hybrid KMeans Genetic Algorithm (HGKA.
Genetic Algorithms for a Parameter Estimation of a Fermentation Process Model: A Comparison
Directory of Open Access Journals (Sweden)
Olympia Roeva
2005-12-01
Full Text Available In this paper the problem of a parameter estimation using genetic algorithms is examined. A case study considering the estimation of 6 parameters of a nonlinear dynamic model of E. coli fermentation is presented as a test problem. The parameter estimation problem is stated as a nonlinear programming problem subject to nonlinear differential-algebraic constraints. This problem is known to be frequently ill-conditioned and multimodal. Thus, traditional (gradient-based local optimization methods fail to arrive satisfied solutions. To overcome their limitations, the use of different genetic algorithms as stochastic global optimization methods is explored. These algorithms are proved to be very suitable for the optimization of highly non-linear problems with many variables. Genetic algorithms can guarantee global optimality and robustness. These facts make them advantageous in use for parameter identification of fermentation models. A comparison between simple, modified and multi-population genetic algorithms is presented. The best result is obtained using the modified genetic algorithm. The considered algorithms converged very closely to the cost value but the modified algorithm is in times faster than other two.
Radial optimization of a BWR fuel cell using genetic algorithms
International Nuclear Information System (INIS)
Martin del Campo M, C.; Carmona H, R.; Oropeza C, I.P.
2006-01-01
The development of the application of the Genetic Algorithms (GA) to the optimization of the radial distribution of enrichment in a cell of fuel of a BWR (Boiling Water Reactor) is presented. The optimization process it was ties to the HELIOS simulator, which is a transport code of neutron simulation of fuel cells that has been validated for the calculation of nuclear banks for BWRs. With heterogeneous radial designs can improve the radial distribution of the power, for what the radial design of fuel has a strong influence in the global design of fuel recharges. The optimum radial distribution of fuel bars is looked for with different enrichments of U 235 and contents of consumable poison. For it is necessary to define the representation of the solution, the objective function and the implementation of the specific optimization process to the solution of the problem. The optimization process it was coded in 'C' language, it was automated the creation of the entrances to the simulator, the execution of the simulator and the extraction, in the exit of the simulator, of the parameters that intervene in the objective function. The objective function includes four parameters: average enrichment of the cell, average gadolinia concentration of the cell, peak factor of radial power and k-infinite multiplication factor. To be able to calculate the parameters that intervene in the objective function, the one evaluation process of GA was ties to the HELIOS code executed in a Compaq Alpha workstation. It was applied to the design of a fuel cell of 10 x 10 that it can be employee in the fuel assemble designs that are used at the moment in the Laguna Verde Nucleo electric Central. Its were considered 10 different fuel compositions which four contain gadolinia. Three heuristic rules that consist in prohibiting the placement of bars with gadolinia in the ends of the cell, to place the compositions with the smallest enrichment in the corners of the cell and to fix the placement of
Design optimization of brushed permanent magnet D C motor by genetic algorithm
Amini, S
2002-01-01
Because of field winding replacement with permanent magnet in brushed permanent magnet D C (PMDC) motors, field losses are eliminated and the structure of the motor is more simple. Efficiency of these motors is therefore increased and the manufacturing process is simplified. Hence, these motors are commonly used in low power applications and their design and optimization is an important consideration. Genetic algorithms are proposed for design optimization of PMD motors because of their independence to objective function structure and its derivative. In this paper genetic algorithms are evaluated for PMDC motor design optimization. an introduction is first presented about PMDC motors, general design procedure and elements of their optimization. Genetic algorithms are then briefly described. Finally results of optimization by genetic algorithms are compared with the one obtained using a conventional method.
Genetic algorithms - A new technique for solving the neutron spectrum unfolding problem
International Nuclear Information System (INIS)
Freeman, David W.; Edwards, D. Ray; Bolon, Albert E.
1999-01-01
A new technique utilizing genetic algorithms has been applied to the Bonner sphere neutron spectrum unfolding problem. Genetic algorithms are part of a relatively new field of 'evolutionary' solution techniques that mimic living systems with computer-simulated 'chromosome' solutions. Solutions mate and mutate to create better solutions. Several benchmark problems, considered representative of radiation protection environments, have been evaluated using the newly developed UMRGA code which implements the genetic algorithm unfolding technique. The results are compared with results from other well-established unfolding codes. The genetic algorithm technique works remarkably well and produces solutions with relatively high spectral qualities. UMRGA appears to be a superior technique in the absence of a priori data - it does not rely on 'lucky' guesses of input spectra. Calculated personnel doses associated with the unfolded spectra match benchmark values within a few percent
Design of a Ground-Launched Ballistic Missile Interceptor Using a Genetic Algorithm
National Research Council Canada - National Science Library
Anderson, Murray
1999-01-01
...) minimize maximum U-loading. In 50 generations the genetic algorithm was able to develop two basic types of external aerodynamic designs that performed nearly the same, with miss distances less than 1.0 foot...
Directory of Open Access Journals (Sweden)
Weihua Jin
2013-01-01
Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.
Design optimization of brushed permanent magnet D C motor by genetic algorithm
International Nuclear Information System (INIS)
Amini, S.; Oraee, H.
2002-01-01
Because of field winding replacement with permanent magnet in brushed permanent magnet D C (PMDC) motors, field losses are eliminated and the structure of the motor is more simple. Efficiency of these motors is therefore increased and the manufacturing process is simplified. Hence, these motors are commonly used in low power applications and their design and optimization is an important consideration. Genetic algorithms are proposed for design optimization of PMD motors because of their independence to objective function structure and its derivative. In this paper genetic algorithms are evaluated for PMDC motor design optimization. an introduction is first presented about PMDC motors, general design procedure and elements of their optimization. Genetic algorithms are then briefly described. Finally results of optimization by genetic algorithms are compared with the one obtained using a conventional method
Bio-Inspired Genetic Algorithms with Formalized Crossover Operators for Robotic Applications.
Zhang, Jie; Kang, Man; Li, Xiaojuan; Liu, Geng-Yang
2017-01-01
Genetic algorithms are widely adopted to solve optimization problems in robotic applications. In such safety-critical systems, it is vitally important to formally prove the correctness when genetic algorithms are applied. This paper focuses on formal modeling of crossover operations that are one of most important operations in genetic algorithms. Specially, we for the first time formalize crossover operations with higher-order logic based on HOL4 that is easy to be deployed with its user-friendly programing environment. With correctness-guaranteed formalized crossover operations, we can safely apply them in robotic applications. We implement our technique to solve a path planning problem using a genetic algorithm with our formalized crossover operations, and the results show the effectiveness of our technique.
Shafiee, Alireza; Arab, Mobin; Lai, Zhiping; Liu, Zongwen; Abbas, Ali
2016-01-01
In optimization-based process flowsheet synthesis, optimization methods, including genetic algorithms (GA), are used as advantageous tools to select a high performance flowsheet by ‘screening’ large numbers of possible flowsheets. In this study, we
Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator
Directory of Open Access Journals (Sweden)
Abid Hussain
2017-01-01
Full Text Available Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
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.
Compact data structure and scalable algorithms for the sparse grid technique
Murarasu, Alin
2011-01-01
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data structures, thus being far from well-suited for GPUs. In this paper, we describe optimizations that enable us to implement compression and decompression, the crucial sparse grid algorithms for our application, on Nvidia GPUs. The main idea consists of a bijective mapping between the set of points in a multi-dimensional sparse grid and a set of consecutive natural numbers. The resulting data structure consumes a minimum amount of memory. For a 10-dimensional sparse grid with approximately 127 million points, it consumes up to 30 times less memory than trees or hash tables which are typically used. Compared to a sequential CPU implementation, the speedups achieved on GPU are up to 17 for compression and up to 70 for decompression, respectively. We show that the optimizations are also applicable to multicore CPUs. Copyright © 2011 ACM.
Sengupta, A S; Lazzarini, A; Prince, T
2002-01-01
Pattern matching techniques such as matched filtering will be used for online extraction of gravitational wave signals buried inside detector noise. This involves cross correlating the detector output with hundreds of thousands of templates spanning a multi-dimensional parameter space, which is very expensive computationally. A faster implementation algorithm was devised by Mohanty and Dhurandhar using a hierarchy of templates over the mass parameters, which speeded up the procedure by about 25-30 times. We show that a further reduction in computational cost is possible if we extend the hierarchy paradigm to an extra parameter, namely, the time of arrival of the signal. In the first stage, the chirp waveform is cut-off at a relatively low frequency allowing the data to be coarsely sampled leading to cost saving in performing the FFTs. This is possible because most of the signal power is at low frequencies, and therefore the advantage due to hierarchy over masses is not compromised. Results are obtained for sp...
Directory of Open Access Journals (Sweden)
C. Fernandez-Lozano
2013-01-01
Full Text Available 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.
Study on characteristic points of boiling curve by using wavelet analysis and genetic algorithm
International Nuclear Information System (INIS)
Wei Huiming; Su Guanghui; Qiu Suizheng; Yang Xingbo
2009-01-01
Based on the wavelet analysis theory of signal singularity detection,the critical heat flux (CHF) and minimum film boiling starting point (q min ) of boiling curves can be detected and analyzed by using the wavelet multi-resolution analysis. To predict the CHF in engineering, empirical relations were obtained based on genetic algorithm. The results of wavelet detection and genetic algorithm prediction are consistent with experimental data very well. (authors)
International Nuclear Information System (INIS)
Shi Xueming; Wu Hongchun; Sun Shouhua; Liu Shuiqing
2003-01-01
The in-core fuel management optimization model based on the genetic algorithm has been established. An encode/decode technique based on the assemblies position is presented according to the characteristics of HFETR. Different reproduction strategies have been studied. The expert knowledge and the adaptive genetic algorithms are incorporated into the code to get the optimized loading patterns that can be used in HFETR
Optimization of magnet sorting in a storage ring using genetic algorithms
International Nuclear Information System (INIS)
Chen Jia; Wang Lin; Li Weimin; Gao Weiwei
2013-01-01
In this paper, the genetic algorithms are applied to the optimization problem of magnet sorting in an electron storage ring, according to which the objectives are set so that the closed orbit distortion and beta beating can be minimized and the dynamic aperture maximized. The sorting of dipole, quadrupole and sextupole magnets is optimized while the optimization results show the power of the application of genetic algorithms in magnet sorting. (authors)
Application of genetic algorithm in modeling on-wafer inductors for up to 110 Ghz
Liu, Nianhong; Fu, Jun; Liu, Hui; Cui, Wenpu; Liu, Zhihong; Liu, Linlin; Zhou, Wei; Wang, Quan; Guo, Ao
2018-05-01
In this work, the genetic algorithm has been introducted into parameter extraction for on-wafer inductors for up to 110 GHz millimeter-wave operations, and nine independent parameters of the equivalent circuit model are optimized together. With the genetic algorithm, the model with the optimized parameters gives a better fitting accuracy than the preliminary parameters without optimization. Especially, the fitting accuracy of the Q value achieves a significant improvement after the optimization.
Genetic algorithm and neural network hybrid approach for job-shop scheduling
Zhao, Kai; Yang, Shengxiang; Wang, Dingwei
1998-01-01
Copyright @ 1998 ACTA Press This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach for job-shop scheduling with respect to the quality of solutions and ...
Application of genetic algorithm for extraction of the parameters from powder EPR spectra
International Nuclear Information System (INIS)
Spalek, T.; Pietrzyk, P.; Sojka, Z.
2005-01-01
The application of the stochastic genetic algorithm in tandem with the deterministic Powell method to automated extraction of the magnetic parameters from powder EPR spectra was described. The efficiency and robustness of such hybrid approach were investigated as a function of the uncertainty range of parameters, using simulated data sets. The discussed results demonstrate superior performance of the hybrid genetic algorithm in fitting of complex spectra in comparison to the common Monte Carlo Method joint with the Powell refinement. (author)
Multiobjective Economic Load Dispatch in 3-D Space by Genetic Algorithm
Jain, N. K.; Nangia, Uma; Singh, Iqbal
2017-10-01
This paper presents the application of genetic algorithm to Multiobjective Economic Load Dispatch (MELD) problem considering fuel cost, transmission losses and environmental pollution as objective functions. The MELD problem has been formulated using constraint method. The non-inferior set for IEEE 5, 14 and 30-bus system has been generated by using genetic algorithm and the target point has been obtained by using maximization of minimum relative attainments.
Optimization of MIS/IL solar cells parameters using genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Ahmed, K.A.; Mohamed, E.A.; Alaa, S.H. [Faculty of Engineering, Alexandria Univ. (Egypt); Motaz, M.S. [Institute of Graduate Studies and Research, Alexandria Univ. (Egypt)
2004-07-01
This paper presents a genetic algorithm optimization for MIS/IL solar cell parameters including doping concentration NA, metal work function {phi}m, oxide thickness d{sub ox}, mobile charge density N{sub m}, fixed oxide charge density N{sub ox} and the external back bias applied to the inversion grid V. The optimization results are compared with theoretical optimization and shows that the genetic algorithm can be used for determining the optimum parameters of the cell. (orig.)
Genetic algorithms with memory- and elitism-based immigrants in dynamic environments
Yang, S
2008-01-01
Copyright @ 2008 by the Massachusetts Institute of Technology In recent years the genetic algorithm community has shown a growing interest 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 by maintaining the population diversity while the memory scheme aims to adapt genetic algorithms quickly to new environments by reusing historical inform...
Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.
2018-03-01
Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.
Reactive power and voltage control based on general quantum genetic algorithms
DEFF Research Database (Denmark)
Vlachogiannis, Ioannis (John); Østergaard, Jacob
2009-01-01
This paper presents an improved evolutionary algorithm based on quantum computing for optima l steady-state performance of power systems. However, the proposed general quantum genetic algorithm (GQ-GA) can be applied in various combinatorial optimization problems. In this study the GQ-GA determines...... techniques such as enhanced GA, multi-objective evolutionary algorithm and particle swarm optimization algorithms, as well as the classical primal-dual interior-point optimal power flow algorithm. The comparison demonstrates the ability of the GQ-GA in reaching more optimal solutions....
Empirical study of self-configuring genetic programming algorithm performance and behaviour
International Nuclear Information System (INIS)
KrasnoyarskiyRabochiy prospect, Krasnoyarsk, 660014 (Russian Federation))" data-affiliation=" (Siberian State Aerospace University named after Academician M.F. Reshetnev 31 KrasnoyarskiyRabochiy prospect, Krasnoyarsk, 660014 (Russian Federation))" >Semenkin, E; KrasnoyarskiyRabochiy prospect, Krasnoyarsk, 660014 (Russian Federation))" data-affiliation=" (Siberian State Aerospace University named after Academician M.F. Reshetnev 31 KrasnoyarskiyRabochiy prospect, Krasnoyarsk, 660014 (Russian Federation))" >Semenkina, M
2015-01-01
The behaviour of the self-configuring genetic programming algorithm with a modified uniform crossover operator that implements a selective pressure on the recombination stage, is studied over symbolic programming problems. The operator's probabilistic rates interplay is studied and the role of operator variants on algorithm performance is investigated. Algorithm modifications based on the results of investigations are suggested. The performance improvement of the algorithm is demonstrated by the comparative analysis of suggested algorithms on the benchmark and real world problems
Ensemble of hybrid genetic algorithm for two-dimensional phase unwrapping
Balakrishnan, D.; Quan, C.; Tay, C. J.
2013-06-01
The phase unwrapping is the final and trickiest step in any phase retrieval technique. Phase unwrapping by artificial intelligence methods (optimization algorithms) such as hybrid genetic algorithm, reverse simulated annealing, particle swarm optimization, minimum cost matching showed better results than conventional phase unwrapping methods. In this paper, Ensemble of hybrid genetic algorithm with parallel populations is proposed to solve the branch-cut phase unwrapping problem. In a single populated hybrid genetic algorithm, the selection, cross-over and mutation operators are applied to obtain new population in every generation. The parameters and choice of operators will affect the performance of the hybrid genetic algorithm. The ensemble of hybrid genetic algorithm will facilitate to have different parameters set and different choice of operators simultaneously. Each population will use different set of parameters and the offspring of each population will compete against the offspring of all other populations, which use different set of parameters. The effectiveness of proposed algorithm is demonstrated by phase unwrapping examples and advantages of the proposed method are discussed.
Application of Hybrid Genetic Algorithm Routine in Optimizing Food and Bioengineering Processes
Directory of Open Access Journals (Sweden)
Jaya Shankar Tumuluru
2016-11-01
Full Text Available Optimization is a crucial step in the analysis of experimental results. Deterministic methods only converge on local optimums and require exponentially more time as dimensionality increases. Stochastic algorithms are capable of efficiently searching the domain space; however convergence is not guaranteed. This article demonstrates the novelty of the hybrid genetic algorithm (HGA, which combines both stochastic and deterministic routines for improved optimization results. The new hybrid genetic algorithm developed is applied to the Ackley benchmark function as well as case studies in food, biofuel, and biotechnology processes. For each case study, the hybrid genetic algorithm found a better optimum candidate than reported by the sources. In the case of food processing, the hybrid genetic algorithm improved the anthocyanin yield by 6.44%. Optimization of bio-oil production using HGA resulted in a 5.06% higher yield. In the enzyme production process, HGA predicted a 0.39% higher xylanase yield. Hybridization of the genetic algorithm with a deterministic algorithm resulted in an improved optimum compared to statistical methods.
A Swarm Optimization Genetic Algorithm Based on Quantum-Behaved Particle Swarm Optimization.
Sun, Tao; Xu, Ming-Hai
2017-01-01
Quantum-behaved particle swarm optimization (QPSO) algorithm is a variant of the traditional particle swarm optimization (PSO). The QPSO that was originally developed for continuous search spaces outperforms the traditional PSO in search ability. This paper analyzes the main factors that impact the search ability of QPSO and converts the particle movement formula to the mutation condition by introducing the rejection region, thus proposing a new binary algorithm, named swarm optimization genetic algorithm (SOGA), because it is more like genetic algorithm (GA) than PSO in form. SOGA has crossover and mutation operator as GA but does not need to set the crossover and mutation probability, so it has fewer parameters to control. The proposed algorithm was tested with several nonlinear high-dimension functions in the binary search space, and the results were compared with those from BPSO, BQPSO, and GA. The experimental results show that SOGA is distinctly superior to the other three algorithms in terms of solution accuracy and convergence.
Genetic local search algorithm for optimization design of diffractive optical elements.
Zhou, G; Chen, Y; Wang, Z; Song, H
1999-07-10
We propose a genetic local search algorithm (GLSA) for the optimization design of diffractive optical elements (DOE's). This hybrid algorithm incorporates advantages of both genetic algorithm (GA) and local search techniques. It appears better able to locate the global minimum compared with a canonical GA. Sample cases investigated here include the optimization design of binary-phase Dammann gratings, continuous surface-relief grating array generators, and a uniform top-hat focal plane intensity profile generator. Two GLSA's whose incorporated local search techniques are the hill-climbing method and the simulated annealing algorithm are investigated. Numerical experimental results demonstrate that the proposed algorithm is highly efficient and robust. DOE's that have high diffraction efficiency and excellent uniformity can be achieved by use of the algorithm we propose.
Innovation of genetic algorithm code GenA for WWER fuel loading optimization
International Nuclear Information System (INIS)
Sustek, J.
2005-01-01
One of the stochastic search techniques - genetic algorithms - was recently used for optimization of arrangement of fuel assemblies (FA) in core of reactors WWER-440 and WWER-1000. Basic algorithm was modified by incorporation of SPEA scheme. Both were enhanced and some results are presented (Authors)
Tran, Huu-Khoa; Chiou, Juing -Shian; Peng, Shou-Tao
2016-01-01
In this paper, the feasibility of a Genetic Algorithm Optimization (GAO) education software based Fuzzy Logic Controller (GAO-FLC) for simulating the flight motion control of Unmanned Aerial Vehicles (UAVs) is designed. The generated flight trajectories integrate the optimized Scaling Factors (SF) fuzzy controller gains by using GAO algorithm. The…
Automated Test Assembly for Cognitive Diagnosis Models Using a Genetic Algorithm
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…
Research on application of complex-genetic algorithm in nuclear component optimal design
International Nuclear Information System (INIS)
He Shijing; Yan Changqi; Wang Jianjun; Wang Meng
2010-01-01
Complex algorithm is one of the most commonly used methods in the mechanical design optimization, such as the optimization of nuclear component. An improved method,complex-genetic algorithm(CGA), is developed based on traditional complex algorithm(TCA), in which the disadvantages of TCA have been overcome. An optimal calculation,which represents the pressurizer, is carried out in order to analyze the optimization capability of CGA. The results show that CGA has better optimizing performance than TCA. (authors)
Directory of Open Access Journals (Sweden)
Nadeem Javaid
2017-03-01
Full Text Available In recent years, demand side management (DSM techniques have been designed for residential, industrial and commercial sectors. These techniques are very effective in flattening the load profile of customers in grid area networks. In this paper, a heuristic algorithms-based energy management controller is designed for a residential area in a smart grid. In essence, five heuristic algorithms (the genetic algorithm (GA, the binary particle swarm optimization (BPSO algorithm, the bacterial foraging optimization algorithm (BFOA, the wind-driven optimization (WDO algorithm and our proposed hybrid genetic wind-driven (GWD algorithm are evaluated. These algorithms are used for scheduling residential loads between peak hours (PHs and off-peak hours (OPHs in a real-time pricing (RTP environment while maximizing user comfort (UC and minimizing both electricity cost and the peak to average ratio (PAR. Moreover, these algorithms are tested in two scenarios: (i scheduling the load of a single home and (ii scheduling the load of multiple homes. Simulation results show that our proposed hybrid GWD algorithm performs better than the other heuristic algorithms in terms of the selected performance metrics.
Bioinformatics for genetical genomics : novel experimental design and algorithms
Fu, Jingyuan
2007-01-01
Jingyuan Fu promoveert op een onderzoek naar genetische analyses. Onder andere werkte ze aan een nieuw softwarepakket MetaNetwork, dat hulp biedt bij het zoeken naar een optimaal ontwerp van experimenten op het gebied van genetical genomics.
Implementation of Genetic Algorithm in Control Structure of Induction Motor A.C. Drive
Directory of Open Access Journals (Sweden)
BRANDSTETTER, P.
2014-11-01
Full Text Available Modern concepts of control systems with digital signal processors allow the implementation of time-consuming control algorithms in real-time, for example soft computing methods. The paper deals with the design and technical implementation of a genetic algorithm for setting proportional and integral gain of the speed controller of the A.C. drive with the vector-controlled induction motor. Important simulations and experimental measurements have been realized that confirm the correctness of the proposed speed controller tuned by the genetic algorithm and the quality speed response of the A.C. drive with changing parameters and disturbance variables, such as changes in load torque.
Series Hybrid Electric Vehicle Power System Optimization Based on Genetic Algorithm
Zhu, Tianjun; Li, Bin; Zong, Changfu; Wu, Yang
2017-09-01
Hybrid electric vehicles (HEV), compared with conventional vehicles, have complex structures and more component parameters. If variables optimization designs are carried on all these parameters, it will increase the difficulty and the convergence of algorithm program, so this paper chooses the parameters which has a major influence on the vehicle fuel consumption to make it all work at maximum efficiency. First, HEV powertrain components modelling are built. Second, taking a tandem hybrid structure as an example, genetic algorithm is used in this paper to optimize fuel consumption and emissions. Simulation results in ADVISOR verify the feasibility of the proposed genetic optimization algorithm.
Use of Genetic Algorithms for Contrast and Entropy Optimization in ISAR Autofocusing
Directory of Open Access Journals (Sweden)
Martorella Marco
2006-01-01
Full Text Available Image contrast maximization and entropy minimization are two commonly used techniques for ISAR image autofocusing. When the signal phase history due to the target radial motion has to be approximated with high order polynomial models, classic optimization techniques fail when attempting to either maximize the image contrast or minimize the image entropy. In this paper a solution of this problem is proposed by using genetic algorithms. The performances of the new algorithms that make use of genetic algorithms overcome the problem with previous implementations based on deterministic approaches. Tests on real data of airplanes and ships confirm the insight.
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
Directory of Open Access Journals (Sweden)
Eremeev Anton V.
2014-01-01
Full Text Available This paper surveys results on complexity of the optimal recombination problem (ORP, which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we consider the computational complexity of ORPs arising in genetic algorithms for problems on permutations: the Travelling Salesman Problem, the Shortest Hamilton Path Problem and the Makespan Minimization on Single Machine and some other related problems. The analysis indicates that the corresponding ORPs are NP-hard, but solvable by faster algorithms, compared to the problems they are derived from.
Nonlinear inversion of potential-field data using a hybrid-encoding genetic algorithm
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
Modelling and genetic algorithm based optimisation of inverse supply chain
Bányai, T.
2009-04-01
(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
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. Copyright © 2015 Elsevier Ltd. All rights reserved.
A new hybrid genetic algorithm for optimizing the single and multivariate objective functions
Energy Technology Data Exchange (ETDEWEB)
Tumuluru, Jaya Shankar [Idaho National Laboratory; McCulloch, Richard Chet James [Idaho National Laboratory
2015-07-01
In this work a new hybrid genetic algorithm was developed which combines a rudimentary adaptive steepest ascent hill climbing algorithm with a sophisticated evolutionary algorithm in order to optimize complex multivariate design problems. By combining a highly stochastic algorithm (evolutionary) with a simple deterministic optimization algorithm (adaptive steepest ascent) computational resources are conserved and the solution converges rapidly when compared to either algorithm alone. In genetic algorithms natural selection is mimicked by random events such as breeding and mutation. In the adaptive steepest ascent algorithm each variable is perturbed by a small amount and the variable that caused the most improvement is incremented by a small step. If the direction of most benefit is exactly opposite of the previous direction with the most benefit then the step size is reduced by a factor of 2, thus the step size adapts to the terrain. A graphical user interface was created in MATLAB to provide an interface between the hybrid genetic algorithm and the user. Additional features such as bounding the solution space and weighting the objective functions individually are also built into the interface. The algorithm developed was tested to optimize the functions developed for a wood pelleting process. Using process variables (such as feedstock moisture content, die speed, and preheating temperature) pellet properties were appropriately optimized. Specifically, variables were found which maximized unit density, bulk density, tapped density, and durability while minimizing pellet moisture content and specific energy consumption. The time and computational resources required for the optimization were dramatically decreased using the hybrid genetic algorithm when compared to MATLAB's native evolutionary optimization tool.
The Parallel Algorithm Based on Genetic Algorithm for Improving the Performance of Cognitive Radio
Directory of Open Access Journals (Sweden)
Liu Miao
2018-01-01
Full Text Available The intercarrier interference (ICI problem of cognitive radio (CR is severe. In this paper, the machine learning algorithm is used to obtain the optimal interference subcarriers of an unlicensed user (un-LU. Masking the optimal interference subcarriers can suppress the ICI of CR. Moreover, the parallel ICI suppression algorithm is designed to improve the calculation speed and meet the practical requirement of CR. Simulation results show that the data transmission rate threshold of un-LU can be set, the data transmission quality of un-LU can be ensured, the ICI of a licensed user (LU is suppressed, and the bit error rate (BER performance of LU is improved by implementing the parallel suppression algorithm. The ICI problem of CR is solved well by the new machine learning algorithm. The computing performance of the algorithm is improved by designing a new parallel structure and the communication performance of CR is enhanced.
A Constrained Genetic Algorithm with Adaptively Defined Fitness Function in MRS Quantification
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.
An Improved Hierarchical Genetic Algorithm for Sheet Cutting Scheduling with Process Constraints
Directory of Open Access Journals (Sweden)
Yunqing Rao
2013-01-01
Full Text Available 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—hierarchical 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.
An improved hierarchical genetic algorithm for sheet cutting scheduling with process constraints.
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--hierarchical 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.
Cultural-Based Genetic Tabu Algorithm for Multiobjective Job Shop Scheduling
Directory of Open Access Journals (Sweden)
Yuzhen Yang
2014-01-01
Full Text Available The job shop scheduling problem, which has been dealt with by various traditional optimization methods over the decades, has proved to be an NP-hard problem and difficult in solving, especially in the multiobjective field. In this paper, we have proposed a novel quadspace cultural genetic tabu algorithm (QSCGTA to solve such problem. This algorithm provides a different structure from the original cultural algorithm in containing double brief spaces and population spaces. These spaces deal with different levels of populations globally and locally by applying genetic and tabu searches separately and exchange information regularly to make the process more effective towards promising areas, along with modified multiobjective domination and transform functions. Moreover, we have presented a bidirectional shifting for the decoding process of job shop scheduling. The computational results we presented significantly prove the effectiveness and efficiency of the cultural-based genetic tabu algorithm for the multiobjective job shop scheduling problem.
A Genetic Algorithms Based Approach for Identification of Escherichia coli Fed-batch Fermentation
Directory of Open Access Journals (Sweden)
Olympia Roeva
2004-10-01
Full Text Available This paper presents the use of genetic algorithms for identification of Escherichia coli fed-batch fermentation process. Genetic algorithms are a directed random search technique, based on the mechanics of natural selection and natural genetics, which can find the global optimal solution in complex multidimensional search space. The dynamic behavior of considered process has known nonlinear structure, described with a system of deterministic nonlinear differential equations according to the mass balance. The parameters of the model are estimated using genetic algorithms. Simulation examples for demonstration of the effectiveness and robustness of the proposed identification scheme are included. As a result, the model accurately predicts the process of cultivation of E. coli.
Design Optimization of Tilting-Pad Journal Bearing Using a Genetic Algorithm
Directory of Open Access Journals (Sweden)
Hamit Saruhan
2004-01-01
Full Text Available This article focuses on the use of genetic algorithms in developing an efficient optimum design method for tilting pad bearings. The approach optimizes based on minimum film thickness, power loss, maximum film temperature, and a global objective. Results for a five tilting-pad preloaded bearing are presented to provide a comparison with more traditional optimum design methods such as the gradient-based global criterion method, and also to provide insight into the potential of genetic algorithms in the design of rotor bearings. Genetic algorithms are efficient search techniques based on the idea of natural selection and genetics. These robust methods have gained recognition as general problem solving techniques in many applications.
Optimization of Neuro-Fuzzy System Using Genetic Algorithm for Chromosome Classification
Directory of Open Access Journals (Sweden)
M. Sarosa
2013-09-01
Full Text Available Neuro-fuzzy system has been shown to provide a good performance on chromosome classification but does not offer a simple method to obtain the accurate parameter values required to yield the best recognition rate. This paper presents a neuro-fuzzy system where its parameters can be automatically adjusted using genetic algorithms. The approach combines the advantages of fuzzy logic theory, neural networks, and genetic algorithms. The structure consists of a four layer feed-forward neural network that uses a GBell membership function as the output function. The proposed methodology has been applied and tested on banded chromosome classification from the Copenhagen Chromosome Database. Simulation result showed that the proposed neuro-fuzzy system optimized by genetic algorithms offers advantages in setting the parameter values, improves the recognition rate significantly and decreases the training/testing time which makes genetic neuro-fuzzy system suitable for chromosome classification.
Optimising a shaft's geometry by applying genetic algorithms
Directory of Open Access Journals (Sweden)
María Alejandra Guzmán
2005-05-01
Full Text Available Many engnieering design tasks involve optimising several conflicting goals; these types of problem are known as Multiobjective Optimisation Problems (MOPs. Evolutionary techniques have proved to be an effective tool for finding solutions to these MOPs during the last decade, Variations on the basic generic algorithm have been particulary proposed by different researchers for finding rapid optimal solutions to MOPs. The NSGA (Non-dominated Sorting Generic Algorithm has been implemented in this paper for finding an optimal design for a shaft subjected to cyclic loads, the conflycting goals being minimum weight and minimum lateral deflection.
[Algorithm of toxigenic genetically altered Vibrio cholerae El Tor biovar strain identification].
Smirnova, N I; Agafonov, D A; Zadnova, S P; Cherkasov, A V; Kutyrev, V V
2014-01-01
Development of an algorithm of genetically altered Vibrio cholerae biovar El Tor strai identification that ensures determination of serogroup, serovar and biovar of the studied isolate based on pheno- and genotypic properties, detection of genetically altered cholera El Tor causative agents, their differentiation by epidemic potential as well as evaluation of variability of key pathogenicity genes. Complex analysis of 28 natural V. cholerae strains was carried out by using traditional microbiological methods, PCR and fragmentary sequencing. An algorithm of toxigenic genetically altered V. cholerae biovar El Tor strain identification was developed that includes 4 stages: determination of serogroup, serovar and biovar based on phenotypic properties, confirmation of serogroup and biovar based on molecular-genetic properties determination of strains as genetically altered, differentiation of genetically altered strains by their epidemic potential and detection of ctxB and tcpA key pathogenicity gene polymorphism. The algorithm is based on the use of traditional microbiological methods, PCR and sequencing of gene fragments. The use of the developed algorithm will increase the effectiveness of detection of genetically altered variants of the cholera El Tor causative agent, their differentiation by epidemic potential and will ensure establishment of polymorphism of genes that code key pathogenicity factors for determination of origins of the strains and possible routes of introduction of the infection.
A hybrid niched-island genetic algorithm applied to a nuclear core optimization problem
International Nuclear Information System (INIS)
Pereira, Claudio M.N.A.
2005-01-01
Diversity maintenance is a key-feature in most genetic-based optimization processes. The quest for such characteristic, has been motivating improvements in the original genetic algorithm (GA). The use of multiple populations (called islands) has demonstrating to increase diversity, delaying the genetic drift. Island Genetic Algorithms (IGA) lead to better results, however, the drift is only delayed, but not avoided. An important advantage of this approach is the simplicity and efficiency for parallel processing. Diversity can also be improved by the use of niching techniques. Niched Genetic Algorithms (NGA) are able to avoid the genetic drift, by containing evolution in niches of a single-population GA, however computational cost is increased. In this work it is investigated the use of a hybrid Niched-Island Genetic Algorithm (NIGA) in a nuclear core optimization problem found in literature. Computational experiments demonstrate that it is possible to take advantage of both, performance enhancement due to the parallelism and drift avoidance due to the use of niches. Comparative results shown that the proposed NIGA demonstrated to be more efficient and robust than an IGA and a NGA for solving the proposed optimization problem. (author)
A novel method to design S-box based on chaotic map and genetic algorithm
International Nuclear Information System (INIS)
Wang, Yong; Wong, Kwok-Wo; Li, Changbing; Li, Yang
2012-01-01
The substitution box (S-box) is an important component in block encryption algorithms. In this Letter, the problem of constructing S-box is transformed to a Traveling Salesman Problem and a method for designing S-box based on chaos and genetic algorithm is proposed. Since the proposed method makes full use of the traits of chaotic map and evolution process, stronger S-box is obtained. The results of performance test show that the presented S-box has good cryptographic properties, which justify that the proposed algorithm is effective in generating strong S-boxes. -- Highlights: ► The problem of constructing S-box is transformed to a Traveling Salesman Problem. ► We present a new method for designing S-box based on chaos and genetic algorithm. ► The proposed algorithm is effective in generating strong S-boxes.
Simulated Annealing Genetic Algorithm Based Schedule Risk Management of IT Outsourcing Project
Directory of Open Access Journals (Sweden)
Fuqiang Lu
2017-01-01
Full Text Available IT outsourcing is an effective way to enhance the core competitiveness for many enterprises. But the schedule risk of IT outsourcing project may cause enormous economic loss to enterprise. In this paper, the Distributed Decision Making (DDM theory and the principal-agent theory are used to build a model for schedule risk management of IT outsourcing project. In addition, a hybrid algorithm combining simulated annealing (SA and genetic algorithm (GA is designed, namely, simulated annealing genetic algorithm (SAGA. The effect of the proposed model on the schedule risk management problem is analyzed in the simulation experiment. Meanwhile, the simulation results of the three algorithms GA, SA, and SAGA show that SAGA is the most superior one to the other two algorithms in terms of stability and convergence. Consequently, this paper provides the scientific quantitative proposal for the decision maker who needs to manage the schedule risk of IT outsourcing project.
International Nuclear Information System (INIS)
Li Qianqian; Jiang Xiaofeng; Zhang Shaohong
2009-01-01
In this study, the age technique, the concepts of relativeness degree and worth function are exploited to improve the performance of genetic algorithm (GA) for PWR loading pattern search. Among them, the age technique endows the algorithm be capable of learning from previous search 'experience' and guides it to do a better search in the vicinity ora local optimal; the introduction of the relativeness degree checks the relativeness of two loading patterns before performing crossover between them, which can significantly reduce the possibility of prematurity of the algorithm; while the application of the worth function makes the algorithm be capable of generating new loading patterns based on the statistics of common features of evaluated good loading patterns. Numerical verification against a loading pattern search benchmark problem ora two-loop reactor demonstrates that the adoption of these techniques is able to significantly enhance the efficiency of the genetic algorithm while improves the quality of the final solution as well. (authors)
A novel method to design S-box based on chaotic map and genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Wang, Yong, E-mail: wangyong_cqupt@163.com [State Key Laboratory of Power Transmission Equipment and System Security and New Technology, Chongqing University, Chongqing 400044 (China); Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065 (China); Wong, Kwok-Wo [Department of Electronic Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong (Hong Kong); Li, Changbing [Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065 (China); Li, Yang [Department of Automatic Control and Systems Engineering, The University of Sheffield, Mapping Street, S1 3DJ (United Kingdom)
2012-01-30
The substitution box (S-box) is an important component in block encryption algorithms. In this Letter, the problem of constructing S-box is transformed to a Traveling Salesman Problem and a method for designing S-box based on chaos and genetic algorithm is proposed. Since the proposed method makes full use of the traits of chaotic map and evolution process, stronger S-box is obtained. The results of performance test show that the presented S-box has good cryptographic properties, which justify that the proposed algorithm is effective in generating strong S-boxes. -- Highlights: ► The problem of constructing S-box is transformed to a Traveling Salesman Problem. ► We present a new method for designing S-box based on chaos and genetic algorithm. ► The proposed algorithm is effective in generating strong S-boxes.
A new genetic algorithm for flexible job-shop scheduling problems
International Nuclear Information System (INIS)
Driss, Imen; Mouss, Kinza Nadia; Laggoun, Assia
2015-01-01
Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.
A new genetic algorithm for flexible job-shop scheduling problems
Energy Technology Data Exchange (ETDEWEB)
Driss, Imen; Mouss, Kinza Nadia; Laggoun, Assia [University of Batna, Batna (Algeria)
2015-03-15
Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.
Genetic algorithms and their applications in accelerator physics
Energy Technology Data Exchange (ETDEWEB)
Hofler, Alicia S. [JLAB
2013-12-01
Multi-objective optimization techniques are widely used in an extremely broad range of fields. Genetic optimization for multi-objective optimization was introduced in the accelerator community in relatively recent times and quickly spread becoming a fundamental tool in multi-dimensional optimization problems. This discussion introduces the basics of the technique and reviews applications in accelerator problems.
GMDH Method with Genetic Selection Algorithm and Cloning
Czech Academy of Sciences Publication Activity Database
Jiřina, Marcel; Jiřina jr., M.
2013-01-01
Roč. 23, č. 5 (2013), s. 451-464 ISSN 1210-0552 Institutional support: RVO:67985807 Keywords : multivariate data * GMDH * linear regression * Gauss-Markov conditions * cloning * genetic selection * classification Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.412, year: 2013
DARWIN: analogue circuit synthesis based on a genetic algorithms
Kruiskamp, M.W.; Leenaerts, D.M.W.
1995-01-01
DARWIN is a synthesis tool for generating sized net lists of CMOS op amps from performance specifications and process parameters. the synthesis process starts with an initial set of randomly generated op amps. Owing to genetic operator ‘crossover’ and ‘mutation’, the population of op amps evolves to
Directory of Open Access Journals (Sweden)
Imam Ahmad Ashari
2016-11-01
Full Text Available Scheduling problems at the university is a complex type of scheduling problems. The scheduling process should be carried out at every turn of the semester's. The core of the problem of scheduling courses at the university is that the number of components that need to be considered in making the schedule, some of the components was made up of students, lecturers, time and a room with due regard to the limits and certain conditions so that no collision in the schedule such as mashed room, mashed lecturer and others. To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired. Metaheuristic algorithm is an algorithm that has a lot of ways to solve the problems to the very limit the optimal solution. In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling. The two algorithm will be tested and compared to get performance is the best. The algorithm was tested using data schedule courses of the university in Semarang. From the experimental results we conclude that the genetic algorithm has better performance than the ant colony optimization algorithm in solving the case of course scheduling.
Cellular Genetic Algorithm with Communicating Grids for Assembly Line Balancing Problems
Directory of Open Access Journals (Sweden)
BRUDARU, O.
2010-05-01
Full Text Available This paper presents a new approach with cellular multigrid genetic algorithms for the "I"-shaped and "U"-shaped assembly line balancing problems, including parallel workstations and compatibility constraints. First, a cellular hybrid genetic algorithm that uses a single grid is described. Appropriate operators for mutation, hypermutation, and crossover and two devoration techniques are proposed for creating and maintaining groups based on similarity. This monogrid algorithm is extended for handling many populations placed on different grids. In the multigrid version, the population of each grid is organized in clusters using the positional information of the chromosomes. A similarity preserving communication protocol between the clusters placed on different grids is introduced. The experimental evaluation shows that the multigrid cellular genetic algorithm with communicating grids is better than the hybrid genetic algorithm used for building it, whereas it dominates the monogrid version in all cases. Absolute performance is evaluated using classical benchmarks. The role of certain components of the cellular algorithm is explained and the effect of some parameters is evaluated.
Experimental Performance of a Genetic Algorithm for Airborne Strategic Conflict Resolution
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.
Solving the Dial-a-Ride Problem using Genetic algorithms
DEFF Research Database (Denmark)
Bergvinsdottir, Kristin Berg; Larsen, Jesper; Jørgensen, Rene Munk
In the Dial-a-Ride problem (DARP) customers send transportation requests to an operator. A request consists of a specified pickup location and destination location along with a desired departure or arrival time and demand. The aim of DARP is to minimize transportation cost while satisfying custom...... routing problems for the vehicles using a routing heuristic. The algorithm is implemented in Java and tested on publicly available data sets....
A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case
Directory of Open Access Journals (Sweden)
Chun-Wei Tsai
2014-01-01
Full Text Available 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.
Clustering for Binary Data Sets by Using Genetic Algorithm-Incremental K-means
Saharan, S.; Baragona, R.; Nor, M. E.; Salleh, R. M.; Asrah, N. M.
2018-04-01
This research was initially driven by the lack of clustering algorithms that specifically focus in binary data. To overcome this gap in knowledge, a promising technique for analysing this type of data became the main subject in this research, namely Genetic Algorithms (GA). For the purpose of this research, GA was combined with the Incremental K-means (IKM) algorithm to cluster the binary data streams. In GAIKM, the objective function was based on a few sufficient statistics that may be easily and quickly calculated on binary numbers. The implementation of IKM will give an advantage in terms of fast convergence. The results show that GAIKM is an efficient and effective new clustering algorithm compared to the clustering algorithms and to the IKM itself. In conclusion, the GAIKM outperformed other clustering algorithms such as GCUK, IKM, Scalable K-means (SKM) and K-means clustering and paves the way for future research involving missing data and outliers.
Geometric Semantic Genetic Programming Algorithm and Slump Prediction
Xu, Juncai; Shen, Zhenzhong; Ren, Qingwen; Xie, Xin; Yang, Zhengyu
2017-01-01
Research on the performance of recycled concrete as building material in the current world is an important subject. Given the complex composition of recycled concrete, conventional methods for forecasting slump scarcely obtain satisfactory results. Based on theory of nonlinear prediction method, we propose a recycled concrete slump prediction model based on geometric semantic genetic programming (GSGP) and combined it with recycled concrete features. Tests show that the model can accurately p...
Application of the genetic algorithm to blume-emery-griffiths model: Test Cases
International Nuclear Information System (INIS)
Erdinc, A.
2004-01-01
The equilibrium properties of the Blume-Emery-Griffiths (BEO) model Hamiltonian with the arbitrary bilinear (1), biquadratic (K) and crystal field interaction (D) are studied using the genetic algorithm technique. Results are compared with lowest approximation of the cluster variation method (CVM), which is identical to the mean field approximation. We found that the genetic algorithm to be very efficient for fast search at the average fraction of the spins, especially in the early stages as the system is far from the equilibrium state. A combination of the genetic algorithm followed by one of the well-tested simulation techniques seems to be an optimal approach. The curvature of the inverse magnetic susceptibility is also presented for the stable state of the BEG model
High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm
Directory of Open Access Journals (Sweden)
Dieter Hendricks
2016-02-01
Full Text Available We implement a master-slave parallel genetic algorithm with a bespoke log-likelihood fitness function to identify emergent clusters within price evolutions. We use graphics processing units (GPUs to implement a parallel genetic algorithm and visualise the results using disjoint minimal spanning trees. We demonstrate that our GPU parallel genetic algorithm, implemented on a commercially available general purpose GPU, is able to recover stock clusters in sub-second speed, based on a subset of stocks in the South African market. This approach represents a pragmatic choice for low-cost, scalable parallel computing and is significantly faster than a prototype serial implementation in an optimised C-based fourth-generation programming language, although the results are not directly comparable because of compiler differences. Combined with fast online intraday correlation matrix estimation from high frequency data for cluster identification, the proposed implementation offers cost-effective, near-real-time risk assessment for financial practitioners.
BONDI-97 A novel neutron energy spectrum unfolding tool using a genetic algorithm
Mukherjee, B
1999-01-01
The neutron spectrum unfolding procedure using the count rate data obtained from a set of Bonner sphere neutron detectors requires the solution of the Fredholm integral equation of the first kind by using complex mathematical methods. This paper reports a new approach for the unfolding of neutron spectra using the Genetic Algorithm tool BONDI-97 (BOnner sphere Neutron DIfferentiation). The BONDI-97 was used as the input for Genetic Algorithm engine EVOLVER to search for a globally optimised solution vector from a population of randomly generated solutions. This solution vector corresponds to the unfolded neutron energy spectrum. The Genetic Algorithm engine emulates the Darwinian 'Survival of the Fittest' strategy, the key ingredient of the 'Theory of Evolution'. The spectra of sup 2 sup 4 sup 1 Am/Be (alpha,n) and sup 2 sup 3 sup 9 Pu/Be (alpha,n) neutron sources were unfolded using the BONDI-97 tool. (author)
An Agent-Based Framework for E-Commerce Information Retrieval Management Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Floarea NASTASE
2009-01-01
Full Text Available The paper addresses the issue of improving retrieval performance management for retrieval from document collections that exist on the Internet. It also comes with a solution that uses the benefits of the agent technology and genetic algorithms in the process of the information retrieving management. The most important paradigms of information retrieval are mentioned having the goal to make more evident the advantages of using the genetic algorithms based one. Within the paper, also a genetic algorithm that can be use for the proposed solution is detailed and a comparative description between the dynamic and static proposed solution is made. In the end, new future directions are shown based on elements presented in this paper. The future results look very encouraging.
Nuclear reactors project optimization based on neural network and genetic algorithm
International Nuclear Information System (INIS)
Pereira, Claudio M.N.A.; Schirru, Roberto; Martinez, Aquilino S.
1997-01-01
This work presents a prototype of a system for nuclear reactor core design optimization based on genetic algorithms and artificial neural networks. A neural network is modeled and trained in order to predict the flux and the neutron multiplication factor values based in the enrichment, network pitch and cladding thickness, with average error less than 2%. The values predicted by the neural network are used by a genetic algorithm in this heuristic search, guided by an objective function that rewards the high flux values and penalizes multiplication factors far from the required value. Associating the quick prediction - that may substitute the reactor physics calculation code - with the global optimization capacity of the genetic algorithm, it was obtained a quick and effective system for nuclear reactor core design optimization. (author). 11 refs., 8 figs., 3 tabs
Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.
Directory of Open Access Journals (Sweden)
Zengliang Han
Full Text Available This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm.
Parallel Genetic Algorithms for calibrating Cellular Automata models: Application to lava flows
International Nuclear Information System (INIS)
D'Ambrosio, D.; Spataro, W.; Di Gregorio, S.; Calabria Univ., Cosenza; Crisci, G.M.; Rongo, R.; Calabria Univ., Cosenza
2005-01-01
Cellular Automata are highly nonlinear dynamical systems which are suitable far simulating natural phenomena whose behaviour may be specified in terms of local interactions. The Cellular Automata model SCIARA, developed far the simulation of lava flows, demonstrated to be able to reproduce the behaviour of Etnean events. However, in order to apply the model far the prediction of future scenarios, a thorough calibrating phase is required. This work presents the application of Genetic Algorithms, general-purpose search algorithms inspired to natural selection and genetics, far the parameters optimisation of the model SCIARA. Difficulties due to the elevated computational time suggested the adoption a Master-Slave Parallel Genetic Algorithm far the calibration of the model with respect to the 2001 Mt. Etna eruption. Results demonstrated the usefulness of the approach, both in terms of computing time and quality of performed simulations
A Genetic Algorithm Approach to the Optimization of a Radioactive Waste Treatment System
International Nuclear Information System (INIS)
Yang, Yeongjin; Lee, Kunjai; Koh, Y.; Mun, J.H.; Kim, H.S.
1998-01-01
This study is concerned with the applications of goal programming and genetic algorithm techniques to the analysis of management and operational problems in the radioactive waste treatment system (RWTS). A typical RWTS is modeled and solved by goal program and genetic algorithm to study and resolve the effects of conflicting objectives such as cost, limitation of released radioactivity to the environment, equipment utilization and total treatable radioactive waste volume before discharge and disposal. The developed model is validated and verified using actual data obtained from the RWTS at Kyoto University in Japan. The solution by goal programming and genetic algorithm would show the optimal operation point which is to maximize the total treatable radioactive waste volume and minimize the released radioactivity of liquid waste even under the restricted resources. The comparison of two methods shows very similar results. (author)
Cause and effect analysis by fuzzy relational equations and a genetic algorithm
International Nuclear Information System (INIS)
Rotshtein, Alexander P.; Posner, Morton; Rakytyanska, Hanna B.
2006-01-01
This paper proposes using a genetic algorithm as a tool to solve the fault diagnosis problem. The fault diagnosis problem is based on a cause and effect analysis which is formally described by fuzzy relations. Fuzzy relations are formed on the basis of expert assessments. Application of expert fuzzy relations to restore and identify the causes through the observed effects requires the solution to a system of fuzzy relational equations. In this study this search for a solution amounts to solving a corresponding optimization problem. An optimization algorithm is based on the application of genetic operations of crossover, mutation and selection. The genetic algorithm suggested here represents an application in expert systems of fault diagnosis and quality control
A Hybrid Neural Network-Genetic Algorithm Technique for Aircraft Engine Performance Diagnostics
Kobayashi, Takahisa; Simon, Donald L.
2001-01-01
In this paper, a model-based diagnostic method, which utilizes Neural Networks and Genetic Algorithms, is investigated. Neural networks are applied to estimate the engine internal health, and Genetic Algorithms are applied for sensor bias detection and estimation. This hybrid approach takes advantage of the nonlinear estimation capability provided by neural networks while improving the robustness to measurement uncertainty through the application of Genetic Algorithms. The hybrid diagnostic technique also has the ability to rank multiple potential solutions for a given set of anomalous sensor measurements in order to reduce false alarms and missed detections. The performance of the hybrid diagnostic technique is evaluated through some case studies derived from a turbofan engine simulation. The results show this approach is promising for reliable diagnostics of aircraft engines.
Directory of Open Access Journals (Sweden)
Jinwei Gu
2015-01-01
Full Text Available A mutualism quantum genetic algorithm (MQGA is proposed for an integrated supply chain scheduling with the materials pickup, flow shop scheduling, and the finished products delivery. The objective is to minimize the makespan, that is, the arrival time of the last finished product to the customer. In MQGA, a new symbiosis strategy named mutualism is proposed to adjust the size of each population dynamically by regarding the mutual influence relation of the two subpopulations. A hybrid Q-bit coding method and a local speeding-up method are designed to increase the diversity of genes, and a checking routine is carried out to ensure the feasibility of each solution; that is, the total physical space of each delivery batch could not exceed the capacity of the vehicle. Compared with the modified genetic algorithm (MGA and the quantum-inspired genetic algorithm (QGA, the effectiveness and efficiency of the MQGA are validated by numerical experiments.
Solving the Dial-a-Ride Problem using Genetic Algorithms
DEFF Research Database (Denmark)
Jørgensen, Rene Munk; Larsen, Jesper; Bergvinsdottir, Kristin Berg
2007-01-01
In the Dial-a-Ride problem (DARP), customers request transportation from an operator. A request consists of a specified pickup location and destination location along with a desired departure or arrival time and capacity demand. The aim of DARP is to minimize transportation cost while satisfying ...... routing problems for the vehicles using a routing heuristic. The algorithm is implemented in Java and tested on publicly available data sets. The new solution method has achieved solutions comparable with the current state-of-the-art methods....
Characterization of uncertainty and sensitivity of model parameters is an essential and often overlooked facet of hydrological modeling. This paper introduces an algorithm called MOESHA that combines input parameter sensitivity analyses with a genetic algorithm calibration routin...
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...
Determination of Optimal Double Sampling Plan using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Sampath Sundaram
2012-03-01
Full Text Available Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4 Designing double sampling plan requires identification of sample sizes and acceptance numbers. In this paper a genetic algorithm has been designed for the selection of optimal acceptance numbers and sample sizes for the specified producer’s risk and consumer’s risk. Implementation of the algorithm has been illustrated numerically for different choices of quantities involved in a double sampling plan