A mixed genetic algorithm applied to the travelling salesman problem

In order to solve travelling salesman problem more satisfactorily, a mixed genetic algorithm is put forward in this paper. Genetic algorithm and tabu search algorithm are effective method to solve large-scale random target function optimizing problem. Both genetic algorithm and tabu search have advantages and disadvantages. On the basis of analyzing the characteristics of genetic algorithm and tabu search, a mixed method is founded. This mixed algorithm is based on genetic algorithm, using genetic algorithm for a large-scale search and tabu search for a local search to improve the calculation of genetic algorithm. At the same time, the algorithm is used in an example of travelling salesman problem. The calculation result indicates that the mixed algorithm genetic algorithm and tabu search is more effective than the single genetic algorithm.