Gene-orientation operator for genetic algorithm
遗传算法的基因定位算子

A gene-orientation operator is proposed to solve the problem of weak ability and low precision in local searching in genetic algorithm.The operator makes a comparison among the several best (N) chromosomes from the high position to the low position after several generations (L).If all the genes on the current position happen to be the same,this gene is locked and not allowed to take part in the genetic operations such as crossover and mutation.In the process of algorithm,every gene of the chromosome will be determined gradually from the high position to the low position.Some algorithms with strong ability in local searching such as the Simulating Anneal and the Niche technology in the process of gene orientation are also used to improve the global optimizing ability of the operator.Finally,several test functions which are easy to fall into the local optimization are implemented to show that almost all the extremes reach their theoretical values.