Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation

1998 ◽  
Vol 6 (3) ◽  
pp. 231-252 ◽  
Author(s):  
Riccardo Poli ◽  
William B. Langdon
Keyword(s):  
Genetic Algorithms ◽  
Genetic Programming ◽  
Point Mutation ◽  
Schema Theory ◽  
Natural Counterpart ◽  
New Form ◽  
Definition Of ◽  
Original Concept

We review the main results obtained in the theory of schemata in genetic programming (GP), emphasizing their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP, which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation, this concept of schema has been used to derive an improved schema theorem for GP that describes the propagation of schemata from one generation to the next. We discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges.

General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II

2003 ◽  
Vol 11 (2) ◽  
pp. 169-206 ◽  
Author(s):  
Riccardo Poli ◽  
Nicholas Freitag McPhee
Keyword(s):  
Genetic Programming ◽  
Schema Theory ◽  
Exact Formulation ◽  
Expected Number ◽  
Size Evolution ◽  
General Schema ◽  
Definition Of ◽  
Effective Fitness ◽  
Selection Of ◽  
Exact Definition

This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system, introduced in Part I, and on the notion of a variable-arity hyperschema, introduced here, which generalises previous definitions of a schema. The theory includes two main theorems describing the propagation of GP schemata: a microscopic and a macroscopic schema theorem. The microscopic version is applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. Therefore, this theorem is applicable to Koza's GP crossover with and without uniform selection of the crossover points, as well as one-point crossover, size-fair crossover, strongly-typed GP crossover, context-preserving crossover and many others. The macroscopic version is applicable to crossover operators in which the probability of selecting any two crossover points in the parents depends only on the parents' size and shape. In the paper we provide examples, we show how the theory can be specialised to specific crossover operators and we illustrate how it can be used to derive other general results. These include an exact definition of effective fitness and a size-evolution equation for GP with subtree-swapping crossover.

Semantic schema theory for genetic programming

2015 ◽  
Vol 44 (1) ◽  
pp. 67-87 ◽  
Author(s):  
Zahra Zojaji ◽  
Mohammad Mehdi Ebadzadeh
Keyword(s):  
Genetic Programming ◽  
Schema Theory ◽  
Semantic Schema

scholarly journals Les Audits Des Programmes ILDH : Les Balises D’une Évaluation Des Politiques Publiques Au Maroc

2017 ◽  
Vol 13 (1) ◽  
pp. 210 ◽  
Author(s):  
Mohammed Belga ◽  
Anass Kihli
Keyword(s):  
Public Policy ◽  
Public Administration ◽  
Policy Evaluation ◽  
Institutional Framework ◽  
Public Budget ◽  
Policy Assessment ◽  
Politiques Publiques ◽  
Recent Method ◽  
New Form ◽  
Definition Of

Policy assessment in Morocco is a recent method to measure the performance of public budget. It is considred as a new form of control of the effictiveness and efficiency of goverment expenditure. However, polemics have intensified about the content and the method of this new practice of control. The conception of an institutional framework of evaluation of public policy evaluation, has stood up to the multiplicity of its stakeholders. The double identity of the evaluative approach, proclaimed by public administration and parliament, made the definition of this practice problematic. Recently, The initiation of the ILDH programmes performance audit recently, has given gave a new path to follow, so as to get to the reality of the goverment evaluative action in Morocco.

scholarly journals Pojęcie niezgodności rzeczy sprzedanej z umową

2017 ◽  
Vol 15 (2) ◽  
pp. 289-299
Author(s):  
Sylwia Zemła
Keyword(s):  
European Parliament ◽  
Contractual Arrangements ◽  
Legal Statement ◽  
New Form ◽  
Polish Law ◽  
Definition Of

This article deals with the question of the incompatibility of a sold object with the contract. Before the act of consumer’s rights of 30 May 2014 entered into force, the term in use had been warranty and responsibility on the basis of incompatibility of the consumption item. At present, the regime of responsibility has been unified. One of the main changes included in the act of consumer’s rights is indeed the new form of the hitherto used definition of a physical defect. In the present law state, the priority is given to contractual arrangements, which were made by the parties while concluding the contract. In case no as such agreements are drawn, one should be guided by the objective occurrence included in Art. 5561 §1 c.c., which enables to state if a physical defect of the sold object has occurred. In comparison with the former legal statement of Art. 5561 c.c., the amendment is far more expanded and brings out a plethora of doubts con cerning its interpretation. This article discusses particular subsections and paragraphs of Art. 5561 c.c. simultaneously including research on realistic possibilities of using the laws mentioned above. An attempt to assess the changes has been made. Doubts arise with reference to Art. 5561 §2 c.c. and 5561 §3 c.c., where one is not able to state clearly the accuracy of solutions implemented from the directive 1999/44/WE of the European Parliament and the Committee of 25 May 1999 in terms of certain aspects of consumption items of trade and connected with these, warranties of 25 May 1999 on the basis of Polish law.

scholarly journals Explorations in Parallel  Linear Genetic Programming

2021 ◽  
Author(s):  
◽  
Carlton Downey
Keyword(s):  
Genetic Programming ◽  
Convergence Time ◽  
Linear Genetic Programming ◽  
Cooperative Coevolution ◽  
Biological Inspiration ◽  
Linear Sequence ◽  
New Form ◽  
Program Output ◽  
Program Components ◽  
Crossover And Mutation

<p>Linear Genetic Programming (LGP) is a powerful problem-solving technique, but one with several significant weaknesses. LGP programs consist of a linear sequence of instructions, where each instruction may reuse previously computed results. This structure makes LGP programs compact and powerful, however it also introduces the problem of instruction dependencies. The notion of instruction dependencies expresses the concept that certain instructions rely on other instructions. Instruction dependencies are often disrupted during crossover or mutation when one or more instructions undergo modification. This disruption can cause disproportionately large changes in program output resulting in non-viable offspring and poor algorithm performance. Motivated by biological inspiration and the issue of code disruption, we develop a new form of LGP called Parallel LGP (PLGP). PLGP programs consist of n lists of instructions. These lists are executed in parallel, and the resulting vectors are summed to produce the overall program output. PLGP limits the disruptive effects of crossover and mutation, which allows PLGP to significantly outperform regular LGP. We examine the PLGP architecture and determine that large PLGP programs can be slow to converge. To improve the convergence time of large PLGP programs we develop a new form of PLGP called Cooperative Coevolution PLGP (CC PLGP). CC PLGP adapts the concept of cooperative coevolution to the PLGP architecture. CC PLGP optimizes all program components in parallel, allowing CC PLGP to converge significantly faster than conventional PLGP. We examine the CC PLGP architecture and determine that performance</p>

scholarly journals A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms

2007 ◽  
pp. 1-11 ◽  
Author(s):  
Erik Hemberg ◽  
Conor Gilligan ◽  
Michael O’Neill ◽  
Anthony Brabazon
Keyword(s):  
Genetic Algorithms ◽  
Genetic Programming ◽  
Programming Approach

Evolving Bots’ AI in Unreal™

2012 ◽  
pp. 134-157 ◽  
Author(s):  
Antonio M. Mora-García ◽  
Juan Julián Merelo-Guervós
Keyword(s):  
Artificial Intelligence ◽  
Genetic Algorithms ◽  
Genetic Programming ◽  
Evolutionary Methods ◽  
Human Player

A bot is an autonomous enemy which tries to beat the human player and/or some other bots in a game. This chapter describes the design, implementation and results of a system to evolve bots inside the PC game Unreal™. The default artificial intelligence (AI) of this bot has been improved using two different evolutionary methods: genetic algorithms (GAs) and genetic programming (GP). The first one has been applied for tuning the parameters of the hard-coded values inside the bot AI code. The second method has been used to change the default set of rules (or states) that defines its behaviour. Moreover, the first approach has been considered at two levels: individual and team, performing different studies at the latter level, looking for the best cooperation scheme. Both techniques yield very good results, evolving bots (and teams) which are capable of defeating the default ones. The best results are obtained for the GA approach, since it just performs a refinement considering the default behaviour rules, while the GP method has to redefine the whole set of rules, so it is harder to get good results. This chapter presents one possibility of AI programming: building a better model from a standard one.

Sign in / Sign up

Export Citation Format

Share Document