Evolving service logic using natural selection Peter Martin

Slides:



Advertisements
Similar presentations
Tetris and Genetic Algorithms Math Club 5/30/2011.
Advertisements

Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Genetic Programming 김용덕 Page 2 Contents What is Genetic Programming? Difference between GP and GA Flowchart for GP Structures in GP.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
2 What Genetic Programming ISN'T: What Genetic Programming ISN'T: Engineering a breed of purple carrots. Engineering a breed of purple carrots. Analyzing.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Programming.
Slides are based on Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming n Evolution.
Introduction to Genetic Algorithms and Evolutionary Computation
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
1 Genetic Programming: An Introduction. 2 The Lunacy of Evolving Computer Programs Before we start, consider the general evolutionary algorithm : Randomly.
Unpublished : Copyright Marconi Communications Limited. All Rights Reserved. SERVICE CREATION USING GENETIC PROGRAMMING Evolving Service.
Sources of Inherited Variation Mutations & Sexual Reproduction.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
DYNAMIC FACILITY LAYOUT : GENETIC ALGORITHM BASED MODEL
Sexual and Asexual reproduction. A type of reproduction that involves only one parent and produces offspring that are genetically identical to the parent.
2101INT – Principles of Intelligent Systems Lecture 11.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Neural Networks And Its Applications By Dr. Surya Chitra.
 What is an inherited trait? › Give examples  What is an acquired trait? › Give examples.
TYPES OF. ASEXUAL REPRODUCTION Only one parent Offspring all look the same as the parents No variation in the offspring Not good chance of surviving.
Genetic Programming. What is Genetic Programming? GP for Symbolic Regression Other Representations for GP Example of GP for Knowledge Discovery Outline.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
Mitosis vs Meiosis 10.2 and Asexual vs. Sexual Reproduction ASEXUAL Offspring inherit all their genetic information from ONE parent (genetic clones)
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
Genetic Programming.
Introduction to Genetic Algorithms
Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.
Evolution Strategies Evolutionary Programming
TYPES OF REPRODUCTION.
Dept of ECE, Concordia University, Montreal, Canada
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Evolution strategies and genetic programming
Example: Applying EC to the TSP Problem
CSC 380: Design and Analysis of Algorithms
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
GENETIC PROGRAMMING BBB4003.

*current controlled assessment plans are unknown
Basics of Genetic Algorithms (MidTerm – only in RED material)
Artificial Intelligence Chapter 4. Machine Evolution
Example: Applying EC to the TSP Problem
GENETIC ALGORITHMS & MACHINE LEARNING
Evolving Logical-Linear Edge Detector with Evolutionary Algorithms
Meiosis.
Basics of Genetic Algorithms
Artificial Intelligence Chapter 4. Machine Evolution
Searching for solutions: Genetic Algorithms
Genetic Programming Chapter 6.
Machine Learning: UNIT-4 CHAPTER-2
Genetic Programming Chapter 6.
Populations Change Over Time through Natural Selection
Asexual vs. Sexual Reproduction
Genetic Programming Chapter 6.
SURVIVAL OF THE FITTEST
GENETIC PROGRAMMING BBB4003.
Steady state Selection
Beyond Classical Search
CSC 380: Design and Analysis of Algorithms
Coevolutionary Automated Software Correction
GA.
Presentation transcript:

Evolving service logic using natural selection Peter Martin Service Creation using Genetic Programming Evolving service logic using natural selection Peter Martin © 1999 Marconi Communications Limited. All Rights Reserved.

Genetic Programming Evolving computer programs Natural selection Fitness improves survival Genetic inheritance

Steps in Using GP Start Create Population Test for Fitness No End of Run ? Evolve Next Generation No

Creating a population Select suitable functions and data Functional considerations - Sufficiency Problem Specific! Syntactical considerations - Closure All programs must be legal! Example:- Division by zero! Randomly create programs Population size ? Program size ?

Testing for Fitness The Fitness function Execution or Interpretation Fitness is problem specific Each individual is given a score

Evolving Generations Select fittest individuals Fitness proportionate or Tournament selection Use the fittest to create next generation Reproduction operators Mutation Asexual reproduction (copy) Sexual Reproduction (crossover)

Crossover Individual A Individual C Individual B Individual D F1 F2 T1 re 6 T4 F3 T5 T6 Individual A Individual B Parents Crossover point Crossover point A 2 1 B Offspring F3 T5 T6 F1 T1 Individual C A 1 B 2 F2 T2 T3 T4 Individual D A 2

Evolving Generations Start Create Population Test for Fitness Evolve Next Generation No End of Run Yes End

An Example - Service Creation Number Translation Translate number depending on time of day Fitness derived from Message Sequence

Call Sequence for a Service Switch DataBase Logic IDP (CalledDN) DB Request( CalledDN << 1) DBResp (TAD1) DB Request(TAD1 << 1) DBResp (TAD2) Connect(TAD2 << 1) End

The Function Set for Services Building block operations START Database lookup ROUTE String manipulation END

Data Types for Services Telephony services require many data types Telephone numbers Integers Boolean Polymorphic data representation Any variable is composed of sub-variables Each variable has one of each type of sub-variable All programs are legal!

Example Service Logic

The Outcome Service Logic creation successful Great variety of programs Fitness represents testing Fitness is the specification Software Engineering Management issues Specification vs. Coding Other Issues? Any hidden surprises?

Conclusions GP shown to be a powerful technique Novel programs evolved Step towards automatic program generation Shifts focus from HOW to WHAT