Study on the recognition and utilization of building block in the iterations of genetic algorithm

A genetic algorithm (GA) based on building block recognition was proposed, in which building block candidates were recognized in evolving process to speed up the search so as to avoid the blindness of GA random searching. The typical symmetric TSP (traveling salesman problem) solving process was used to test various recognition methods, and then the test results were used to improve the traditional GA, including improving the recognition rate of building blocks and mutation and crossover operators based on building block. Compared with the computational result of traditional GA, it shows that the searching efficiency of GA can be improved remarkably and the fluctuation of random searching can be reduced by recognizing building block.