GA: Generic genetic algorithms base implementation
| Recommend this page to a friend! |
 Author |
 |
|
Innovation award Nominee: 2x Winner: 1x | ||||||||||
This class implements base methods to apply genetic algorithms to arbitrary subjects.
Its functions can be call instantiating a class object or called static methods.
The class can perform several types of generic algorithm operations like crossover, mutation, selection and death over populations of any objects of the same class.
It can be used as a base implementation of genetic algorithms to solve many types of problems on which the best solution may be found through natural selection.
Its functions can be call instantiating a class object or called static methods.
The class can perform several types of generic algorithm operations like crossover, mutation, selection and death over populations of any objects of the same class.
It can be used as a base implementation of genetic algorithms to solve many types of problems on which the best solution may be found through natural selection.
| Classes of Rafael Pinto | > | GA | > |  Download .zip .tar.gz |
> |  Support forum (3) |
> |  Blog |
> |   Latest changes |
|
|||||||||||||||
| Groups | Applications | Related pages |  Files |
| Groups |
 Algorithms |
Numerical and statistical algorithms | View top rated classes |
| Artificial intelligence |
Automation of tasks using human-like intelligence | View top rated classes |
| Innovation Award |
 September 2005 Winner Prize: One book of choice by SAMS |
Genetic Algorithms are computing algorithms used to find approximate solutions to optimization problems. These problems consist in determining sequences of data that may provide better results depending on the order of the data elements. The genetic algorithms are inspired in the evolutionary biology theories that determine that on each generation the individuals tend to evolve and address better the problems that challenge their survival. Evolution happens after performing slight mutations to the chromosome sequence of the individuals of the current generation. The best fit individuals will survive and become the origin of the next generation. In computing genetic algorithms can be used to optimize solutions for problems like job scheduling, artificial intelligence for computer operated game characters, compact file storage, etc.. This class can be used as a framework to implement PHP applications that can benefit of the use of genetic algorithms. Manuel Lemos |
| Applications that use this package |
No pages of applications that use this class were specified.
If you know an application of this package, send a message to the author to add a link here.
| Related pages |
| Genetic Algorithms Genetic Algorithms |
| Introduction to Genetic Algorithms Introduction to Genetic Algorithms |
| The Genetic Algorithms Archive The Genetic Algorithms Archive |
| Files |
| File | Role | Description |
|---|---|---|
| ga.php |
Class | GA Class |
 gaExample1.php |
Example | GA Example 1 |
| gaExample2.php |
Example | GA Example 2 |
 Install with Composer - Download all files: ga.tar.gz ga.zipNOTICE: if you are using a download manager program like 'GetRight', please Login before trying to download this archive.
|
For more information send a message to
info at phpclasses dot org.Copyright (c) Icontem 1999-2016