A Mixed Genetic Algorithm Based on Simulated Annealing with Sharpening Solution Space

GA(genetic algorithm) is a kind of optimization algorithms simulating the mechanism of biological individual evolution in nature and it is widely utilized recently. But SA(Simulated Annealing) is another kind of optimization algorithms simulating the theory of solid annealing. In this paper, firstly the advantage and the disadvantage of the two kinds of algorithms are analyzed, and in order to avoid their disadvantage a mixed genetic algorithm based on simulated annealing through their mixture is proposed and a method of sharpening solution space is introduced . The theoretic analysis and the simulation results show that the scheme is feasible and effective.