Support

Support Options

Submit a Support Ticket

 

This section is unavailable in an archive version of a tool. Consult the latest published version 1.2 for most current information.

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.1
Published on 10 Aug 2011
Latest version: 1.2. All versions

doi:10.4231/D3X63B522 cite this

This tool is closed source.

See also

No results found.

Category

Tools

Published on

Abstract

We present a simple genetic algorithm 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 academic questions, like how the population size, number of parents for each generation, mutation rate, and probability 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.