Rank and proximity based crossover (RPC) to improve convergence in genetic search

A new crossover technique, we named rank and proximity based crossover (RPC), to improve the speed and quality of solutions in genetic search, is proposed. In the proposed strategy, the probability of crossover is more when the rank of two chromosomes are both high, and they are closely located in the search space. This probability is again a function of the generation number. In the early stage of genetic search the crossover is independent of the rank and proximity of the partners. Thus, crossover takes place between any two chromosomes selected for crossover, to enable exploration of diverse locations of the problem space. With advancing generations, RPC probabilistically encourages crossover between chromosomes of higher ranks which are closely located in the search space. This ensures avoidance of disruption of good chromosomes by crossover, when prospective locations are found, and thus achieves much faster convergence. Different schemes of this probability function are tried and evaluated, and convergence efficiency is compared with other competitive algorithms.