DOCSLIB.ORG

C3.7 Multi-Parent Recombination

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
C3.7 Multi-Parent Recombination C Multiparent Recombination AE Eiben Leiden University Abstract In this section we survey recombination op erators that can utilize more than two parents to create ospring Some multiparent recombination op erators are dened for a xed number of parents eg havearity three while in some op erators the number of parents is a random number that might b e greater than two and in yet other op erators the arity is a parameter that can b e set to an arbitrary integer We pay sp ecial attention to this latter typ e of op erators and summarize results on the eect of op erator arityonevolutionary algorithm p erformance C Intro duction To make the coming survey unambiguous we have to start with setting some conventions on terminology The term population will b e used for a multiset of individuals that undergo es selection and repro duction This terminology is maintained in genetic algorithms ev olutionary programming and genetic programming but in evolution strategies all individuals in a or strategy are called parents We however use the term parents only for those individuals that are selected to undergo recombination In other words parents are those individuals that are actually used as inputs for a recombination op erator the arity of a recombination operator is the numb er of parents it uses The next notion is that of a donor b eing a parent that actually contributes to at least one of the alleles of the children created by the recombination op erator This contribution can be for instance the delivery of an allele as in uniform crossover in canonical GAs or the participation in an averaging op eration as in intermediate recombination in ES As an illustration consider a steadystate GA where individuals form the p opulation and two of them are chosen as parents to undergo uniform crossover to create one single ospring If bypurechance the ospring only inherits alleles from parent then parent is a donor and parent is not C Miscellaneous op erators We b egin this survey with pap ers where the multiparent asp ect has an incidental character By an incidental character we mean that the op erator is dened and used in a sp ecic application and has for instance a certain xed arityoreven if the denition is general and would allow comparison between dierentnumb er of parents this asp ect is not given attention The recombination mechanism of Kaufman is applied for evolving mo dels for agiven pro cess where a mo del is an arrayofa numberofblocks and mo dels may dier in the numbers of blo cks they contain Recombination of four mo dels to create one new mo del is dened as follows The size of the child the numb er of blo cks equals the size of eachofitsparents with probability The ith blo ck of the child is chosen with equal probability from those parents that have there is an exception of this latter rule of cho osing one of the at least i blo cks Let us note that parents blo cks but that exception has a very problemsp ecic reason therefore we rather present the general idea here In an extensive study on bit vector function optimization sto chastic iterated genetic hill climbing SIGH is studied and compared with other techniques such as GAs iterated hillclimbing and simulated annealing Ackley SIGH applies a sophisticated probabilistic voting mechanism c IOP Publishing Ltd and Oxford UniversityPress Handbook of Evolutionary Computation C with timedep endent probability distributions co oling where m voters m b eing the size of the p opulation determine the values of a new bitstring SIGH is shown to b e b etter than a GA with p oint and uniform crossover on four out of the six test functions and the overall conclusion is that it is comp etitive in sp eed with a variety of existing algorithms In the intro ductory pap er on the parallel genetic algorithm ASPARAGOS Muhlen b ein psexual voting recombination is applied for the quadratic assignment problem Let us remark that the name psexual is somewhat misleading as there are no dierent genders and no restriction on having one representative of each gender for recombination The voting recombination pro duces one child of p parents based on a threshold value v It determines the ith allele of the child by comparing the ith alleles of the selected parent individuals If the same allele is found more often than the threshold v this allele is included in the child other bits are lled in randomly In the exp eriments the values p and v are used and it worked surprisingly well but comparison between this scheme and usual twoparent recombination was not p erformed An interesting attempt to combine genetic algorithms with the Simplex Metho d resulted in the ternary simplex crossover Bersini and Seront If x x x are the three parents sorted in decreasing order of tness then the simplex crossover generates one child x by the following two rules i If x x then x x i i i i ii if x x then x x with probability p and x x with probability p i i i i i i Using the value p the simplex GA p erformed b etter than the standard GA on the DeJong functions The authors remark that applying a mo died crossover on more than three parents is worth to try The problem of placing actuators on space structures is addressed byFuruya and Haftka The authors compare dierent crossovers among others they use uniform crossover with twoaswell as with three parents in a GA using integer representation Based on the exp erimental results they conclude that the use of three parents did not improve the p erformance This might b e related to another conclusion indicating that for this problem mutation is an ecient op erator and crossover might not be imp ortant Uniform crossover with an arbitrary number of parents is also used by Aizawa as part of a sp ecial schema sampling pro cedure in a GA but the multiparent feature is only a sideeect and is not investigated y Pal for a multimo dal spin A socalled triadic crossover is intro duced and tested b lattice problem The triadic crossover is dened in terms of two parents and one extra individual chosen randomly from the p opulation The op erator creates one child it takes the bits in p ositions where the rst parent and the third individual have identical bits from this parent and the rest of the bits from the other parent Clearly the result is identical to the outcome of a voting crossover on these three individuals as parents Although the pap er is primarily concerned with dierent selection schemes a comparison between triadic p oint and uniform crossover is made where triadic crossover turned out to deliver the b est results C Op erators with undened arity In the intro duction to this section we dened the arity of a recombination op erator as the number drawings the parents it uses In some cases this number dep ends on the outcomes of random op erator is called without knowing in advance how manyparents would b e applied In this section we treat three mechanisms of this kind Global recombination in evolution strategies allows the use of more than tworecombinants Back Schwefel In ES there are two basic typ es of recombination intermediate and discrete recombination b oth having a standard twoparentvariant and a global variant Given a p opulation of individuals global recombination creates one ospring x by the following mechanism S T i i x or x global discrete recombination i i x i S T S i i i combination x x x global intermediate re i i i i S T i i where the two parents x x S T fg are redrawn for each i anew and so is the i i contraction factor The ab ove denition applies to the ob ject variables as well as the strategy i parameter part ie for the mutation stepsizes s and the rotation angles s Observe that c C Handbook of Evolutionary Computation IOP Publishing Ltd and Oxford University Press the multiparent character of global recombination is the consequence of redrawing the parents S T i i x x for each co ordinate i Therefore probably more than two individuals contribute to the ospring x but their number is not dened in advance It is clear that investigations on the eects of dierent numb ers of parents on algorithm p erformance could not be p erformed in the traditional ES framework The option of using multiple parents can be turned on or o that is global recombination can be used or not but the arity of the recombination op erator is not tunable Exp erimental studies on global versus twoparent recombination are p ossible but so far there are almost no exp erimental results available on this sub ject In Schwefel it is noted that appreciable acceleration is obtained by changing to bisexual from asexual scheme ie adding recombination using two parents to the mutationonly algorithm but only slight further increase is obtained when changing from bisexual to multisexual recombination ie using global recombination instead of the twoparentvariant Recall the remark on the name psexual voting The terms bisexual and multisexual are not appropriate either for the same reason individuals have no gender or sex and recombination can be applied to any combination of individuals Genepool recombination GPR was intro duced byMuhlenbein and Voigt as a multi parent recombination mechanism for discrete domains It is dened as a generalization of twoparent recombination TPR Applying GPR is preceded by selecting a genep o ol consisting of wouldb e parents Applying GPR the twoparent alleles of an ospring are randomly chosen for each lo cus with replacement from the genep o ol and the ospring allele is computed using any of the standard recombination schemes for TPR Theoretical
Load more

Recommended publications
  • Symbolic Computation Using Grammatical Evolution
    Symbolic Computation using Grammatical Evolution Alan Christianson Department of Mathematics and Computer Science South Dakota School of Mines and Technology Rapid City, SD 57701 [email protected] Jeff McGough Department of Mathematics and Computer Science South Dakota School of Mines and Technology Rapid City, SD 57701 [email protected] March 20, 2009 Abstract Evolutionary Algorithms have demonstrated results in a vast array of optimization prob- lems and are regularly employed in engineering design. However, many mathematical problems have shown traditional methods to be the more effective approach. In the case of symbolic computation, it may be difficult or not feasible to extend numerical approachs and thus leave the door open to other methods. In this paper, we study the application of a grammar-based approach in Evolutionary Com- puting known as Grammatical Evolution (GE) to a selected problem in control theory. Grammatical evolution is a variation of genetic programming. GE does not operate di- rectly on the expression but following a lead from nature indirectly through genome strings. These evolved strings are used to select production rules in a BNF grammar to generate algebraic expressions which are potential solutions to the problem at hand. Traditional approaches have been plagued by unrestrained expression growth, stagnation and lack of convergence. These are addressed by the more biologically realistic BNF representation and variations in the genetic operators. 1 Introduction Control Theory is a well established field which concerns itself with the modeling and reg- ulation of dynamical processes. The discipline brings robust mathematical tools to address many questions in process control.
    [Show full text]
  • Genetic Algorithm: Reviews, Implementations, and Applications
    Paper— Genetic Algorithm: Reviews, Implementation and Applications Genetic Algorithm: Reviews, Implementations, and Applications Tanweer Alam() Faculty of Computer and Information Systems, Islamic University of Madinah, Saudi Arabia [email protected] Shamimul Qamar Computer Engineering Department, King Khalid University, Abha, Saudi Arabia Amit Dixit Department of ECE, Quantum School of Technology, Roorkee, India Mohamed Benaida Faculty of Computer and Information Systems, Islamic University of Madinah, Saudi Arabia How to cite this article? Tanweer Alam. Shamimul Qamar. Amit Dixit. Mohamed Benaida. " Genetic Al- gorithm: Reviews, Implementations, and Applications.", International Journal of Engineering Pedagogy (iJEP). 2020. Abstract—Nowadays genetic algorithm (GA) is greatly used in engineering ped- agogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation chal- lenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural se- lection and genetics concepts. GA is an intelligent use of random search sup- ported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation pro- cess to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natu- ral selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes.
    [Show full text]
  • Accelerating Real-Valued Genetic Algorithms Using Mutation-With-Momentum
    CORE Metadata, citation and similar papers at core.ac.uk Provided by University of Tasmania Open Access Repository Accelerating Real-Valued Genetic Algorithms Using Mutation-With-Momentum Luke Temby, Peter Vamplew and Adam Berry Technical Report 2005-02 School of Computing, University of Tasmania, Private Bag 100, Hobart This report is an extended version of a paper of the same title presented at AI'05: The 18th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, 5-9 Dec 2005. Abstract: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven purely by the bias to fitter individuals in the selection process. Several authors have proposed the use of directed mutation operators as a means of improving the convergence speed of GAs on problems involving real-valued alleles. This paper proposes a new approach to directed mutation based on the momentum concept commonly used to accelerate the gradient descent training of neural networks. This mutation-with- momentum operator is compared against standard Gaussian mutation across a series of benchmark problems, and is shown to regularly result in rapid improvements in performance during the early generations of the GA. A hybrid system combining the momentum-based and standard mutation operators is shown to outperform either individual approach to mutation across all of the benchmarks. 1 Introduction In a traditional genetic algorithm (GA) using a bit-string representation, the mutation operator acts primarily to preserve diversity within the population, ensuring that alleles can not be permanently lost from the population.
    [Show full text]
  • Solving a Highly Multimodal Design Optimization Problem Using the Extended Genetic Algorithm GLEAM
    Solving a highly multimodal design optimization problem using the extended genetic algorithm GLEAM W. Jakob, M. Gorges-Schleuter, I. Sieber, W. Süß, H. Eggert Institute for Applied Computer Science, Forschungszentrum Karlsruhe, P.O. 3640, D-76021 Karlsruhe, Germany, EMail: [email protected] Abstract In the area of micro system design the usage of simulation and optimization must precede the production of specimen or test batches due to the expensive and time consuming nature of the production process itself. In this paper we report on the design optimization of a heterodyne receiver which is a detection module for opti- cal communication-systems. The collimating lens-system of the receiver is opti- mized with respect to the tolerances of the fabrication and assembly process as well as to the spherical aberrations of the lenses. It is shown that this is a highly multimodal problem which cannot be solved by traditional local hill climbing algorithms. For the applicability of more sophisticated search methods like our extended Genetic Algorithm GLEAM short runtimes for the simulation or a small amount of simulation runs is essential. Thus we tested a new approach, the so called optimization foreruns, the results of which are used for the initialization of the main optimization run. The promising results were checked by testing the approach with mathematical test functions known from literature. The surprising result was that most of these functions behave considerable different from our real world problems, which limits their usefulness drastically. 1 Introduction The production of specimen for microcomponents or microsystems is both, mate- rial and time consuming because of the sophisticated manufacturing techniques.
    [Show full text]
  • Arxiv:1606.00601V1 [Cs.NE] 2 Jun 2016 Keywords: Pr Solving Tasks
    On the performance of different mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems Chun Liua,b,∗, Andreas Krollb aSchool of Automation, Beijing University of Posts and Telecommunications No 10, Xitucheng Road, 100876, Beijing, China bDepartment of Measurement and Control, Mechanical Engineering, University of Kassel M¨onchebergstraße 7, 34125, Kassel, Germany Abstract The performance of different mutation operators is usually evaluated in conjunc- tion with specific parameter settings of genetic algorithms and target problems. Most studies focus on the classical genetic algorithm with different parameters or on solving unconstrained combinatorial optimization problems such as the traveling salesman problems. In this paper, a subpopulation-based genetic al- gorithm that uses only mutation and selection is developed to solve multi-robot task allocation problems. The target problems are constrained combinatorial optimization problems, and are more complex if cooperative tasks are involved as these introduce additional spatial and temporal constraints. The proposed genetic algorithm can obtain better solutions than classical genetic algorithms with tournament selection and partially mapped crossover. The performance of different mutation operators in solving problems without/with cooperative arXiv:1606.00601v1 [cs.NE] 2 Jun 2016 tasks is evaluated. The results imply that inversion mutation performs better than others when solving problems without cooperative tasks, and the swap- inversion combination performs better than others when solving problems with cooperative tasks. Keywords: constrained combinatorial optimization, genetic algorithm, ∗Corresponding author. Email addresses: [email protected] (Chun Liu), [email protected] (Andreas Kroll) August 13, 2018 mutation operators, subpopulation, multi-robot task allocation, inspection problems 1.
    [Show full text]
  • Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem
    Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem Otman ABDOUN, Jaafar ABOUCHABAKA, Chakir TAJANI LaRIT Laboratory, Faculty of sciences, Ibn Tofail University, Kenitra, Morocco [email protected], [email protected], [email protected] Abstract. The genetic algorithm includes some parameters that should be adjusted, so as to get reliable results. Choosing a representation of the problem addressed, an initial population, a method of selection, a crossover operator, mutation operator, the probabilities of crossover and mutation, and the insertion method creates a variant of genetic algorithms. Our work is part of the answer to this perspective to find a solution for this combinatorial problem. What are the best parameters to select for a genetic algorithm that creates a variety efficient to solve the Travelling Salesman Problem (TSP)? In this paper, we present a comparative analysis of different mutation operators, surrounded by a dilated discussion that justifying the relevance of genetic operators chosen to solving the TSP problem. Keywords: Genetic Algorithm, TSP, Mutation Operator, Probability of mutation. 1 INTRODUCTION Nature uses several mechanisms which have led to the emergence of new species and still better adapted to their environments. The laws which react to species evolution have been known by the research of Charles Darwin in the last century[1]. We know that Darwin was the founder of the theory of evolution however John Henry Holland team's had the initiative in developing the canonical genetic algorithm, (CGA) to solve an optimization problem. Thereafter, the Goldberg work [2] is more used in a lot of applications domain.
    [Show full text]
  • Genetic Programming –
    Genetic Programming { Computers using \Natural Selection" to generate programs William B. Langdon, Adil Qureshi Dept of Computer Science, University College London. ABSTRACT Computers that \program themselves"; science fact or fiction? Genetic Programming uses novel optimisation techniques to \evolve" simple programs; mimicking the way humans construct programs by progressively re-writing them. Trial programs are repeatedly modified in the search for \better/fitter” solutions. The underlying basis is Genetic Algorithms (GAs). Genetic Algorithms, pioneered by Holland [Hol92], Goldberg [Gol89] and others, are evolu- tionary search techniques inspired by natural selection (i.e survival of the fittest). GAs work with a \population" of trial solutions to a problem, frequently encoded as strings, and repeat- edly select the “fitter” solutions, attempting to evolve better ones. The power of GAs is being demonstrated for an increasing range of applications; financial, imaging, VLSI circuit layout, gas pipeline control and production scheduling [Dav91]. But one of the most intriguing uses of GAs - driven by Koza [Koz92] - is automatic program generation. Genetic Programming applies GAs to a \population" of programs - typically encoded as tree-structures. Trial programs are evaluated against a “fitness function" and the best solu- tions selected for modification and re-evaluation. This modification-evaluation cycle is repeated until a \correct" program is produced. GP has demonstrated its potential by evolving simple programs for medical signal filters, classifying news stories, performing optical character recog- nition, and for target identification. This paper surveys the exciting field of Genetic Programming. As a basis it reviews Ge- netic Algorithms and automatic program generation. Next it introduces Genetic Programming, describing its history and describing the technique via a worked example in C.
    [Show full text]
  • Module VI Introduction to Genetic Algorithm, Operators in Genetic
    Module VI Introduction to genetic algorithm, operators in genetic algorithm - coding - selection - cross over – mutation, Stopping condition for genetic algorithm flow,Genetic neuro hybrid systems, Genetic-Fuzzy rule based system. 1 Genetic Algorithmsare adaptive heuristic search algorithms based on the evolutionary ideas of natural selection and generics. As such they represent an intelligent exploitation of a random search used to solve Ahhough randomized, GAs are by no means random; instead iliey exploit historical information to direct the search imo the region of better performance within the search space. The basic techniques of the GAs are designed to simulate processes in natural systems necessary for evolution, especially those that follow the principles first laid down by Charles Darwin, "survival of the fittest," because in narure, competition among individuals for seamy resources results in the fittest individuals dominating over the weaker ones. OPERATORS IN GENETIC ALGORITHM 1) Encoding Encoding is a process of representing individual genes. The process can be performed using bits, numbers,trees, arrays, lists or any other objects. The encoding depends mainly on solving the problem. For example, one can encode directly real or integer numbers. Binary Encoding The most common way of encoding is a binary string, which would be represented as in Figure below. Each chromosome encodes a binary (bit) string. Each bit in the string can represent some characteristics ofthe solution. Every bit string therefore is a solution but not necessarily the best solution. Another possibility isthat the whole string can represent a number. The way bit strings can code differs from problem to problem. 2 Binary encoding gives many possible chromosomes with a smaller number of alleles.
    [Show full text]
  • Optimizing Bioengineered Vascular Systems: a Genetic Algorithm Approach
    Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 12-2017 Optimizing Bioengineered Vascular Systems: A Genetic Algorithm Approach Sima Mehri Kochaki Utah State University Follow this and additional works at: https://digitalcommons.usu.edu/etd Part of the Computer Sciences Commons Recommended Citation Kochaki, Sima Mehri, "Optimizing Bioengineered Vascular Systems: A Genetic Algorithm Approach" (2017). All Graduate Theses and Dissertations. 6693. https://digitalcommons.usu.edu/etd/6693 This Thesis is brought to you for free and open access by the Graduate Studies at DigitalCommons@USU. It has been accepted for inclusion in All Graduate Theses and Dissertations by an authorized administrator of DigitalCommons@USU. For more information, please contact [email protected]. OPTIMIZING BIOENGINEERED VASCULAR SYSTEMS: A GENETIC ALGORITHM APPROACH by Sima Mehri Kolchaki A thesis submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE in Computer Science Approved: Nicholas S. Flann, Ph.D. Vicki Allan, Ph.D. Major Professor Committee Member Vladimir Kulyukin, Ph.D. Mark R. McLellan, Ph.D. Committee Member Vice President for Research and Dean of the School of Graduate Studies UTAH STATE UNIVERSITY Logan, Utah 2017 ii Copyright c Sima Mehri Kolchaki 2017 All Rights Reserved iii ABSTRACT Optimizing Bioengineered Vascular Systems: A Genetic Algorithm Approach by Sima Mehri Kolchaki, Master of Science Utah State University, 2017 Major Professor: Nicholas S. Flann, Ph.D. Department: Computer Science Efficient metabolism in bioengineered tissues requires a robust vascular system to pro- vide healthy microenvironments to the cells and stroma. Such networks form spontaneously during embryogenesis from randomly distributed endothelial cells.
    [Show full text]
  • Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 2, No. 12, 2011 Solving the MDBCS Problem Using the Metaheuric– Genetic Algorithm Genetic algorithm for the MDBCS problem Milena Bogdanović University of Niš Teacher Training Faculty Partizanska 14, Vranje, Serbia Abstract— The problems degree-limited graph of nodes solved by nondeterministic Turing machine. The importance of considering the weight of the vertex or weight of the edges, with this class of decision problems is that it contains many the aim to find the optimal weighted graph in terms of certain interesting problems of search and optimization, where we restrictions on the degree of the vertices in the subgraph. This want to determine whether there is some solution to the class of combinatorial problems was extensively studied because problem, but whether this is the optimal solution. Therefore, of the implementation and application in network design, the challenge with NP problem is to find the answer in an connection of networks and routing algorithms. It is likely that efficient manner, as an effective way to verify the response, ie. solution of MDBCS problem will find its place and application in solution already exists. Since many important problems in this these areas. The paper is given an ILP model to solve the class, intensive efforts were invested to find in polynomial time problem MDBCS, as well as the genetic algorithm, which algorithms for solving problems in class NP. However, a large calculates a good enough solution for the input graph with a number of NP problems has resisted these efforts, and greater number of nodes.
    [Show full text]
  • A Genetic Algorithm Approach to Measurement Prescription in Fault Diagnosis Q
    Information Sciences 120 (1999) 223±237 www.elsevier.com/locate/ins A genetic algorithm approach to measurement prescription in fault diagnosis q Benjamin Han, Shie-Jue Lee * Department of Electrical Engineering, National Sun Yat-Sen University, Kaohsiung 80424, Taiwan, ROC Received 3 April 1998; received in revised form 11 June 1999; accepted 11 September 1999 Abstract To fully discriminate among all possible diagnoses in a fault diagnosis task, one needs to take measurements from the system being diagnosed. The primary eects of taking one measurement in diagnosis based on ®rst principles were presented in A. Reiter [Arti®cial Intelligence (32) (1987) 57±95] and a more detailed, formal account was given in A. Hou [Arti®cial Intelligence (65) (1994) 281±328]. However, the order in which measurements are to be taken is an issue. We propose a genetic algorithm to determine a good measurement order for a diagnosis task. The method applies operators such as selection, crossover, and mutation to evolve an initial population of measurement se- quences. The quality of a measurement sequence is evaluated based on the cost taken for the measurement sequence to ®nd the ®nal diagnosis. Experiments on testing circuits have shown that the quality of measurement sequences is greatly improved after evo- lution. Ó 1999 Elsevier Science Inc. All rights reserved. Keywords: Model-based diagnosis; First principles; Measurements; Measurement ordering; Genetic operators 1. Introduction In a nontrivial fault diagnosis task using model-based approaches, such as Reiter's theory of diagnosis from ®rst principles [12,16], one is always q Partially supported by National Science Council under grant NSC-83-0408-E-110-004.
    [Show full text]
  • A New Strategy for Adapting the Mutation Probability in Genetic Algorithms
    CORE Metadata, citation and similar papers at core.ac.uk Provided by SEDICI - Repositorio de la UNLP A New Strategy for Adapting the Mutation Probability in Genetic Algorithms Natalia Stark, Gabriela Minetti, Carolina Salto Laboratorio de Investigación en Sistemas Inteligentes Facultad de Ingeniería – UNLPam Calle 110 N°390 – General Pico – La Pampa Email: {nstark,minettig,saltoc}@ing.unlpam.edu.ar Abstract. Traditionally in Genetic Algorithms, the mutation probability parameter maintains a constant value during the search. However, an important difficulty is to determine a priori which probability value is the best suited for a given problem. Besides, there is a growing demand for up-to-date optimization software, applicable by a non-specialist within an industrial development environment. These issues encourage us to propose an adaptive evolutionary algorithm that includes a mechanism to modify the mutation probability without external control. This process of dynamic adaptation happens while the algorithm is searching for the problem solution. This eliminates a very expensive computational phase related to the pre-tuning of the algorithmic parameters. We compare the performance of our adaptive proposal against traditional genetic algorithms with fixed parameter values in a numerical way. The empirical comparisons, over a range of NK-Landscapes instances, show that a genetic algorithm incorporating a strategy for adapting the mutation probability outperforms the same algorithm using fixed mutation rates. 1. Introduction During the design process of a Genetic Algorithm (GA), we need to instantiate several parameters to specific values before the run of the algorithm, in order to obtain a robust search technique. This task is also known as pre-tuning of algorithmic parameters.
    [Show full text]