Advertisement

© 2007

Linear Genetic Programming

Benefits

  • One of the few books that deals solely with linear GP and contains a number of concrete, experimental results

  • Methods and analysis techniques are specifically adapted to the LGP approach, analyzing LGP in more detail while concentrating on principle characteristics of an imperative program structure in comparison to a tree representation

Book

Part of the Genetic and Evolutionary Computation book series (GEVO)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Introduction

    1. Pages 1-9
  3. Fundamental Analysis

  4. Method Design

  5. Advanced Techniques and Phenomena

    1. Front Matter
      Pages 193-193
    2. Pages 289-290
  6. Back Matter
    Pages 291-320

About this book

Introduction

Linear Genetic Programming examines the evolution of imperative computer programs written as linear sequences of instructions. In contrast to functional expressions or syntax trees used in traditional Genetic Programming (GP), Linear Genetic Programming (LGP) employs a linear program structure as genetic material whose primary characteristics are exploited to achieve acceleration of both execution time and evolutionary progress. Online analysis and optimization of program code lead to more efficient techniques and contribute to a better understanding of the method and its parameters. In particular, the reduction of structural variation step size and non-effective variations play a key role in finding higher quality and less complex solutions. This volume investigates typical GP phenomena such as non-effective code, neutral variations and code growth from the perspective of linear GP.

The text is divided into three parts, each of which details methodologies and illustrates applications. Part I introduces basic concepts of linear GP and presents efficient algorithms for analyzing and optimizing linear genetic programs during runtime. Part II explores the design of efficient LGP methods and genetic operators inspired by the results achieved in Part I. Part III investigates more advanced techniques and phenomena, including effective step size control, diversity control, code growth, and neutral variations.

The book provides a solid introduction to the field of linear GP, as well as a more detailed, comprehensive examination of its principles and techniques. Researchers and students alike are certain to regard this text as an indispensable resource.

Keywords

Step Size Control Syntax algorithms code growth diversity control evolutionary algorithm genetic algorithms genetic operators genetic programming learning linear genetic programming machine learning neutral variations optimization programming

Authors and affiliations

  1. 1.Bioinformatics Research Center (BiRC)University of AarhusDenmark
  2. 2.Department of Computer ScienceMemorial University of NewfoundlandSt. John’sCanada

About the authors

Markus Brameier received a PhD degree in Computer Science from the Department of Computer Science at University of Dortmund, Germany,in 2004.  From 2003 to 2004 he was a postdoctoral fellow at the Stockholm Bioinformatics Center (SBC), a collaboration between Stockholm University, the Royal Institute of Technology, and Karolinska Institute, in Sweden.  Currently he is Assistant Professor at the Bioinformatics Research Center (BiRC) of the University of Aarhus in Denmark.  His primary research interests are in bioinformatics and genetic programming.

Wolfgang Banzhaf is a professor of Computer Science at the Department of Computer Science of Memorial University of Newfoundland, Canada, and head of the department since 2003. Prior to that, he served for 10 years as Associate Professor for Applied Computer Science in the Department of Computer Science at University of Dortmund, Germany. From 1989 to 1993 he was a researcher with Mitsubishi Electric Corp., first in MELCO’s Central Research Lab in Japan, then in the United States at Mitsubishi Electric Research Labs Inc., Cambridge, MA. Between 1985 and 1989 he was a postdoc in the Department of Physics, University of Stuttgart, Germany. He holds a PhD in Physics from the University of Karlruhe in Germany. His research interests are in the field of artificial evolution and self-organization studies. He has recently become more involved with bioinformatics.

Bibliographic information

Industry Sectors
Automotive
Chemical Manufacturing
Biotechnology
IT & Software
Telecommunications
Law
Consumer Packaged Goods
Pharma
Materials & Steel
Finance, Business & Banking
Electronics
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering

Reviews

From the reviews:

"This is a very good book. It provides a well organized description of linear genetic programming (LGP). Much material, previously only available in research papers, has been consolidated, reorganized and extended for this book. … This book is primarily for the evolutionary computing researcher … . Post graduate students in genetic programming should read this book … . The book should be in university libraries. Considering the cost of many books these days this one is very well priced for its size and content." (Vic Ciesielski, Genetic Programming and Evolvable Machines, Vol. 9, 2008)

"This book addresses a subfield of genetic programming, where solutions are represented by a sequence of instructions in an imperative programming language, such as C. Genetic programming is an iterative search algorithm based loosely on the concepts of biological evolution. … Brameier and Banzhaf present a thorough overview that will serve as an excellent resource for graduate students, academics, and practitioners, who choose to work with linear genetic programming." (Steven Gustafson, ACM Computing Reviews, Vol. 49 (8), August, 2008)