An improved search space resizing method for model identification by Standard Genetic Algorithm

In this paper, a new improved search space boundary resizing method for an optimal model's parameter identification by Standard Genetic Algorithms (SGAs) is proposed and demonstrated. The premature convergence to local minima, as a result of search space boundary constraints, is a key consideration in the application of SGAs. The new method improves the convergence to global optima by resizing or extending the upper and lower search boundaries. The resizing of search space boundaries involves two processes, first, an identification of initial value by approximating the dynamic response period and desired settling time. Second, a boundary resizing method derived from the initial search space value. These processes brought the elite groups within feasible boundary regions by consecutive execution and enhanced the SGAs in locating the optimal model's parameters for the identified transfer function. This new method is applied and examined on two processes, a third order transfer function model with and without random disturbance and raw data of excess oxygen. The simulation results assured the new improved search space resizing method's efficiency and flexibility in assisting SGAs to locate optimal transfer function model parameters in their explorations.