Evolving Near Optimal Solutions to Computationally Hard Problems Using Natural Selection
CSEF · 2017 Mathematical Sciences Second Award
Overview
Objectives/Goals Determine if processes of natural selection can be applied to non-biological or simulated entities to produce nearly optimal solutions to a variety of computationally hard problems in a reasonable amount of time. Methods/Materials Desktop computer with Processing Compiler/IDE, Processing.js extension and Chrome browser. I developed my own algorithms using research on the internet, for my 3rd problem of evolving locomotion in virtual agents, I borrowed from some open-source code published by Cary Huang and extensively modified it. Results Three different problems were easily solved using the algorithm I devised. Results show nearly optimal solution to Linear Regression Problem in as little as 5 generations and Traveling Salesman Problem of 350 cities produced near optimal results after 200 generations and evolving locomotion in virtual creatures produced good results within 300 generations of evolution. Conclusions/Discussion I developed an algorithm based on natural selection that can be used to find near optimal solutions to a variety of complex problems in a reasonable amount of time. I show that it is not only possible for simulated evolution to work with non-biological entities, but also demonstrate that evolution can produce solutions to computationally complex problems that are difficult or impossible to solve using traditional methods or exhaustive search.
Summary statement
Using simulated evolution to generate near optimal solutions for computationally complex problems
Help received
I learned about Linear Regression in my Algebra class. I researched the Traveling Salesman Problem online and the code for my locomotion of virtual creatures was based on open source code by Cary Huang and modified by myself. The simulated evolution algorithm was programmed by myself after research on
Awards (1)
Competition history
- CSEF 2017
Resources
Related projects
ISEF · 2017
Maze Solving Optimization through Genetic Programming
CSEF · 2006
Clockwork Evolution
CSEF · 2005
The Digital Life: Evolution on a Computer
CSEF · 2016
Are Genetic Algorithms Effective for Computationally Intense Problems?
CSEF · 2002
Bob's World
CSEF · 2003
Evolution of Data: The Effect of Mutation Functions on the Growth of a Computer Generated Population
CSEF · 2014
Balancing Diversity and Fitness while Evolving Neural Networks
ISEF · 2014
Artificial Intelligence: Evolution and Genetic Algorithms
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: California Science & Engineering Fair public projects