最適解の位置にロバストな実数値GAを実現するToroidal Search Space Conversionの提案

抄録

This paper presents a new method that improves robustness of real-coded Genetic Algorithm (GA) for function optimization. It is reported that most of crossover operators for real-coded GA have sampling bias, which prevents to find the optimum when it is near the boundary of search space. They like to search the center of search space much more than the other. Therefore, they will not work on functions that have their optima near the boundary of the search space. Although several methods have been proposed to relax this sampling bias, they could not cancel whole bias. In this paper, we propose a new method, Toroidal Search Space Conversion (TSC), to remove this sampling bias. TSC converts bounded search space into toroidal one without any parameter. Experimental results show that a GA with TSC has higher performance to find the optimum near the boundary of search space and the GA has more robustness concerning the relative position of the optimum.