genetic algorithms with python ?· a brief introduction to genetic algorithms genetic algorithms...

Download Genetic Algorithms with Python ?· A brief introduction to genetic algorithms Genetic algorithms are…

Post on 03-Sep-2018

215 views

Category:

Documents

0 download

Embed Size (px)

TRANSCRIPT

  • Genetic Algorithms with PythonClinton Sheppard

    2016-06-11

  • This book is available for purchase at

    http://leanpub.com/genetic_algorithms_with_python

    This version was published on 2016-06-11.

    Follow @gar3t on Twitter for update announcements.

    Copyright 2016 Clinton Sheppard . All rights

    reserved. No part of this e-book may be reproduced or transmitted in any form

    or by any electronic or mechanical means including information storage and

    retrieval systems without permission in writing from the author.

    The code in this book is open source, licensed under the Apache License,

    Version 2.0. The final code from each chapter is available for download using a

    link at the end of the chapter.

    The text of this book was written in AsciiDoc using Atom and AsciiDoc-

    Preview for editing and converted to PDF using AsciiDoctor 1.5.4. The code

    was written and tested using JetBrains' PyCharm IDE for Python. Some

    images were produced using GraphViz and Paint.Net. The font is Liberation

    Serif.

    https://leanpub.com/genetic_algorithms_with_python?utm_source=leanpub_pdf&utm_medium=pdf&utm_campaign=geneticpyhttps://twitter.com/gar3tmailto:fluentcoder@gmail.comhttps://www.apache.org/licenses/LICENSE-2.0https://www.apache.org/licenses/LICENSE-2.0http://asciidoc.org/https://atom.io/https://atom.io/packages/asciidoc-previewhttps://atom.io/packages/asciidoc-previewhttp://asciidoctor.org/https://www.jetbrains.com/pycharm/http://www.graphviz.orghttp://www.getpaint.net/index.htmlhttps://en.wikipedia.org/wiki/Liberation_fontshttps://en.wikipedia.org/wiki/Liberation_fonts

  • Dear reader,

    This PDF contains the preface and chapter 1 of Genetic Algorithms with Python in their entirety sothat you can get an introduction to both the topic of genetic algorithms and my writing style.

    I have been working with genetic algorithms since 2011. Ive have completed a first draft withworking code through chapter 16. The first 5 chapters were published in late April 2016 and I amnow engaged in getting the remaining draft chapters edited and polished while play testing thecode to make sure everything in my source files is also in the text. I am publishing each chapter asit is completed. You can on follow me on Twitter as @gar3t for update announcements.

    Clinton Sheppard

    Genetic Algorithms with Python | 1

    https://twitter.com/gar3t

  • A brief introduction to genetic algorithmsGenetic algorithms are one of the tools we can use to apply machine learning to finding good, sometimes even optimal,solutions to problems that have billions of potential solutions. They use biological processes in software to find answersto problems that have really large search spaces by continuously generating candidate solutions, evaluating how well thesolutions fit the desired outcome, and refining the best solutions.

    When solving a problem with a genetic algorithm, instead of asking for a specific solution, you provide characteristics thatthe solution must have or rules its solution must pass to be accepted. For example, when filling a moving truck youprovide a set of rules like: load big things first, distribute the weight to both sides, put light things on top but not loose,interlock things with odd shapes so they dont move around. The more constraints you add the more potential solutionsare blocked. Suppose you say: put the refrigerator, washer and dryer along the front left wall, load boxes of books alongthe front right wall, mattresses down the middle, and clothes on top of the mattresses. These more specific rules do notwork if you are loading packages, or Christmas trees, but the previous goal oriented ones still do.

    Goal oriented problem solvingImagine you are given 10 chances to guess a number between 1 and 1000 and the only feedback you get is whether yourguess is right or wrong. Could you reliably guess the number? With only right or wrong as feedback, you have no way toimprove your guesses so you have at best a 1 in 100 chance of guessing the number. A fundamental aspect of solvingproblems using genetic algorithms is that they must provide feedback that helps the engine select the better of twoguesses. That feedback is called the fitness, for how closely the guess fits the desired result. More importantly it impliesa general progression.

    If instead of right or wrong as feedback you receive higher or lower indicating that the number is higher or lower thanyour guess, you can always find the number because 10 guesses are sufficient to binary search your way to any number inthe 1 to 1000 range.

    Now imagine multiplying the size of this problem so that instead of trying to find 1 number you are simultaneously tryingto find a set of 100 numbers, all in the range 1 to 1000, your only receive back a fitness value indicating how closely thatset of numbers matches the desired outcome. Your goal would be to maximize or minimize that fitness. Could you findthe right set of 100 numbers? You might be able to do better than random guessing if you have problem specificknowledge that helps you eliminate certain number combinations. Using problem specific knowledge to guide the geneticalgorithms creation and modification of potential solutions can help them find a solution orders of magnitude faster.

    Genetic algorithms and genetic programming are very good at finding solutions to very large problems. They do it bytaking millions of samples from the search space, making small changes, possibly recombining parts of the best solutions,comparing the resultant fitness against that of the current best solution, and keeping the better of the two. This processrepeats until a stop condition like one of the following occurs: the known solution is found, a solution meeting allrequirements is found, a certain number of generations has passed, a specific amount of time has passed, etc.

    First problemImagine you are asked to guess a 3-letter password; what kind of feedback would you want? If the password is 'aaa' andyou guess 'abc' what should the fitness value be? Would something simple like how many of the letters in your guess arecorrect be sufficient? Should 'bab', which has one correct letter, get a better fitness value than 'zap', also one correct letterbut the wrong letters are alphabetically farther away, or should the fitness be the same? These are some of the firstdecisions you have to make when planning to implement a genetic algorithm to find a solution to your problem. Geneticalgorithms are good at finding good solutions to problems with large search spaces because they can quickly find the partsof the guesses that improve fitness values or lead to better solutions.

    In the problem above, lets say the fitness function returns a count of the number of letters that match the password. Thatmeans 'abc', 'bab' and 'zba' all get a fitness value of one, because they each have one letter correct. The genetic algorithmmight then combine the first two letters of 'abc' with the last letter of 'zba' through crossover, to create the guess 'aba'.

    2 | A brief introduction to genetic algorithms

  • The fitness for that guess would be two because two letters match the password. The algorithm might also mutate the lastletter of 'zba' to get 'zbc' and a fitness value of zero. Depending on how the engine is configured it might throw out 'zbc'immediately, it might keep it in order to maintain genetic diversity, or perhaps it would only keep it if it is better thansome cutoff fitness value when compared with all the other guesses tried by the engine.

    We will look more at the password problem in the first chapter, and go on to explore a variety of problems to learndifferent ways of solving problems with genetic algorithms. However, this book is not about showing you a hand-pickedset of problems you can solve with genetic algorithms. It is about giving you experience making genetic algorithms workfor you using sample problems that you understand and can fall back upon when learning to use other machine learningtools and techniques, or applying genetic algorithms in your own field of expertise.

    Genetic programming with PythonThis book uses the Python programming language to explore genetic algorithms. Why Python? Because Python is a lowceremony, powerful and easy-to-read language whose code can be understood by entry-level programmers. I explain theoccasional Python feature but should you encounter a programming construct youve never seen before and cant intuit,Python.org and StackOverflow.com are great places to find explanations. If you have experience with anotherprogramming language then you should have no difficulty learning Python by induction while also exploring geneticalgorithms.

    example python syntax

    # this is a commentimport math # imports make code from other modules available

    # code blocks are initiated by a trailing colon followed by indented linesclass Circle: # define a class def __init__(self, radius): # constructor with parameter radius self.radius = radius # store the parameter in a class variable

    def get_area(self): # define a function that belongs to the class return math.pi \ * self.radius \ * self.radius # trailing \ continues the expression on the next line

    # code that is not in a class is executed immediatelyfor i in range(1, 10): if (i & 1) == 0: continue circle = Circle(i) # create an instance print("A circle with radius {0} has area {1:0.2f}".format( i, circle.get_area() # `print` writes output to the console ))

    You can run the code above in your browser at https://repl.it/C0uK.

    Like blacksmiths, programmers create their own tools. We freq