论文部分内容阅读
The properties of selection operators in the genetic algorithm (GA) are studied in detail. It is indicated that the selection of operations is significant for both improving the general fitness of a population and leading to the schema deceptiveness. The stochastic searching characteristics of GA are compared with those of heuristic methods. The influence of selection operators on the GA’ s exploration and exploitation is discussed, and the performance of selection operators is evaluated with the premature convergence of the GA taken as an example based on One-Max function. In order to overcome the schema deceptiveness of the GA, a new type of fitness scaling, non-monotone scaling, is advanced to enhance the evolutionary ability of a population. The effectiveness of the new scaling method is tested by a trap function and a needle-in-haystack (NiH) function.
The properties of selection operators in the genetic algorithm (GA) are studied in detail. It is that that the selection of operations is significant for both improving the general fitness of a population and leading to the schema deceptiveness. The stochastic searching characteristics of GA are compared with those of heuristic methods. The influence of selection operators on the GA ’s exploration and exploitation is discussed, and the performance of selection operators is evaluated with the premature convergence of the GA taken as an example based on One-Max function. In order to overcome the schema deceptiveness of the GA, a new type of fitness scaling, non-monotone scaling, is advanced to enhance the evolutionary ability of a population. The effectiveness of the new scaling method is tested by a trap function and a needle- in-haystack (NiH) function.