Method and system for conditioning of numerical algorithms for solving optimization problems within a genetic framework

摘要

A system for conditioning algorithms to achieve optimum execution time is disclosed. The system defines a computer programmable framework that can be used to efficiently find a global optimization vector. The system provides a precise execution sequencing of operations in order to achieve a speedy conclusion and a genetic receipt for finding the optimal number of siblings (cluster nodes) for the algorithm. The system defines the genetic function for generating an initial population of solution vectors, a condition number for optimal searching of a single vector, a best fit off-springs selection method, and a diversification function.