Design Philosophy for Optimizing Genetic Algorithms Through Embedded Intelligence

Traditionally Genetic algorithms are thought of as brute force approaches, aimed to arrive at solutions to problems which do not have a specific answer. In problems where the data is not structured for the general implementation of a specific idea, genetic algorithms are most useful. This paper proposes to mitigate the above problem of brute force approaches through elucidation of procedures ranging from exploratory analysis, followed by pattern analysis and classification. This novel conceptualization of the scheme and design will help in arriving at solutions through reduced iterations. Research conducted involves dropping of poorly performing hypotheses, controlled mutation, thereby adding a dimension of intelligence to evolutionary algorithms. The following paper describes the methodology used to solve the problem of addition of numbers using evolutionary algorithms of Neural Networks, whilst building intelligence into the system. The specific problem of addition has been dealt with in the following paper, however the same design philosophy can be extended for a paraphernalia of problems. The end goal is to obtain a generation of adroit and capable hypotheses to solve the problem in reduced number of iterations. The solution provided is generic and can be reused, it has been applied to a specific problem in the following paper.