New crossover operators for real coded genetic algorithm (RCGA)

This paper aims at achieving global optimal solution of complex problems, such as traveling salesman problem (TSP), using extended version of real coded genetic algorithms (RCGA). Since genetic algorithm (GA) consists of several genetic operators, namely selection procedure, crossover, and mutation operators, that offers the choice to be modified in order to improve the performance for particular implementation, we propose three new crossover techniques for Real Coded Genetic Algorithms, which will improve the quality of solution as well as the rate of convergence to the optimum solution. Methods proposed for crossover operators are inspired by asexual reproduction commonly observed in nature. In this regard, new crossover techniques proposed incorporates the concept of Boltzmann´s distribution (BD) for escaping local optima by allowing hill-climbing moves and Metropolis Algorithm (MPA), where, survival of offspring is tested before transit to new generation. Finally, these three methods are compared on various aspects like rate of convergence and quality of final solution among each other and against other randomized algorithms.