A dynamic fuzzy-based crossover method for genetic algorithms
Currently, Genetic Algorithms (GA) are widely used in different optimization problems. One of the problems with GAs is tuning their parameters correctly as they can have a significant effect on GA's overall performance. Till now, different methods have been proposed for fine tuning these parameters. Many of these methods use fuzzy linguistic rules in order to find the correct parameters in each stage of the GA evolution. But these methods look at each chromosome as a whole solution for a specific problem. In our contribution, a new method has been proposed which breaks each chromosome into sub parts and uses the better sub-solutions as the building blocks of the next generation using a fuzzy-based approach. The performance of this algorithm has been shown on the Traveling Salesman Problem (TSP) with comparison to Simple GA and Adaptive GA.