Method of generating precedence-preserving crossover and mutation operations in genetic algorithms
US8250007B2 · kind B2 · utility
9Cited by
2References
7Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 7, 2009 |
| Grant date | Aug 21, 2012 |
| Priority date | — |
| Expiry date | Mar 25, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N3/126
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for generating precedence-preserving crossover and mutations operations for genetic algorithms is provided. The method is based on the determination of activities' Forward Free Float (FFF) and Backward Free Float (BFF) values, utilizing these float values in randomly selected forward and backward paths, respectively. The method may be applied to the finance-based scheduling domain using large scale projects, with the chromosomes of the genetic algorithm encoding activities' start times in a resource-constrained scheduling problem.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.