Three Real-Coded Genetic Algorithms with New Mutation Operators

Local search is mainly implemented by the reproduction and crossover operation, while global search is assured by the mutation operation in conventional genetic algorithm. In order to enhance the global search ability, three new mutation operators are proposed based on the idea that big change into small and small change into big for gene bit selected at random. The experimental verification shows that the proposed new genetic algorithms with new mutation operators are effective in seeking for the global optimal solutions