Performance tuning of genetic algorithms with reserve selection

This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve optimization problems more efficiently. First of all, we briefly present GARS, an improved genetic algorithm with a reserve selection mechanism which helps to avoid premature convergence. The comparable results to state-of-the-art techniques such as fitness scaling and sharing demonstrate both the effectiveness and the robustness of GARS in global optimization. Next, two strategies named static RS and dynamic RS are proposed for tuning the parameter reserve size to optimize the performance of GARS. Empirical studies conducted in several cases indicate that the optimal reserve size is problem dependent.