A Reliable Approach for Terminating the GA Optimization Method

Abstract

Genetic algorithm (GA) has been extensively used in recent decades to solve many optimization problems in various fields of science and engineering. In most cases, the number of iterations is the only criterion which is used to stop the GA. In practice, this criterion will lead to prolong execution times to ensure proper solution. A novel approach is presented in this article as the approximate number of decisive iterations (ANDI ) which can be used to successfully terminate the GA optimization method with minimum execution time. Two simple correlations are presented which relate the new parameter (ANDI ) with approximate degrees of freedom (Adf ) of the merit function at hand. For complex merit functions, a linear smoother (such as Regularization network) can be used to estimate the required Adf. Four illustrative case studies are used to successfully validate the proposed approach by effectively finding the optimum point by using to the presented correlation. The linear correlation is more preferable because it is much simpler to use and the horizontal axis represents the approximate (not exact) degrees of freedom. It was also clearly shown that the Regularization Networks can successfully filter out the noise and mimic the true hyper-surface underlying a bunch of noisy data set.