Support

Support Options

Submit a Support Ticket

 

Illustration of the genetic algorithm

By Yongxin Yao

Iowa State University

A simple cut-paste-mutation genetic evolution method

Launch Tool

This tool version is unpublished and cannot be run. If you would like to have this version staged, you can put a request through HUB Support.

Archive Version 1.0
Published on 09 Aug 2011
Latest version: 1.2. All versions

doi:10.4231/D31Z41S7Q cite this

This tool is closed source.

Category

Tools

Published on

Abstract

We present a simple genetic alrorithm based on cut-paste-mutation operations to solve problems with complexity scales as 2^N, where N is the size of the system. Entertaining examples of evolving to nice 2D pictures are chosen for illustration, where the complexity increases exponentially with the number of pixels. Interesting adademic questions, like how the population size, number of parents for each generation, mutation rate, and probabily the fitness criteria will affect the efficiency of evolution,can be studied.

Tags

nanoHUB.org, a resource for nanoscience and nanotechnology, is supported by the National Science Foundation and other funding agencies. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.