Bounded, Multidimensional, Integrated Memetic Evolution for Character Recognition Based on Predictive Elimination Theory and Optimization Techniques

Abstract

This article describes how inspired by the natural process of evolution in genetic algorithms, memetic algorithms (MAs) are a category of cultural evolution phenomenon. The very concept of MA has been discussed in the last few years and is adding newer dimensions to MA and computational skills of algorithms. There are many optimization algorithms which fully exploit the problem under consideration. This article presents a heuristic approach for an improvised algorithm which takes into consideration various optimization parameters in isolation and tries to integrate the self-learning technique of MA. A general structure of MA according to this article should be perfectly in-line with brain activities which are neurotically tested and given maximum emphasis on local search and context-based predictive approaches rather than mathematically computing every event and taking or picking solutions based on results of certain formula. This article goes one step beyond the conventional set of the variety of problem domains, ranging from discrete optimization, continuous optimization, constrained optimization and multi objective optimization in which MAs have been successfully implemented. These optimization techniques must be processed using outcomes of predictive optimization and using a method of elimination to make the search set smaller and smaller as we progress deeper into the search. There is a scarcity of literature and also lack of availability of comprehensive reviews on MAs. The proposed technique is a better approach for solving combinatorial optimization problems. This article gives an overview of various domains and problem types in which MA can be used. Apart from this, the problem of character recognition using predictive optimization and implementation of elimination theory MA is discussed.