A Genetic Algorithm Based on Gene Bank and Multiple-Searching Method for TSP
一种基于基因库和多重搜索策略求解TSP的遗传算法

Traveling salesman problem is a typical representative of combinatorial optimization problems. After analyzing the characteristic of genetic algorithm, a new genetic algorithm named GB-MGA is designed in this article. It combines gene bank and multiple-searching method, gene bank directs the slngle-parent evolution and enhances the evolutionary speed. Based on multiple-searching method, GB_ MGA aims on enhancing the ability of global search by using improved cross operator. The test results of some instances in TSP library show that proposed algorithm increases the convergence speed, and improves the chance of finding optimal solution.