Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
基于递阶遗传算法的多旅行商问题优化*

Traveling salesman problem is a classical nondeterministic polynomial problem. It is significance to solve multiple traveling salesman problems (MTSP). In order to solve MTSP that employed total-path-shortest as the evaluating rule, this paper proposed a hierarchical genetic algorithm and decoding method with matrix. Its coding method is simple and can effectively reflect the traveling policy, and the methods of crossover and mutation are not special to design. By this method, symmetric and asymmetric multiple traveling salesman problems can be easily solved. The computational results suggest that the hierarchical genetic algorithm is efficient and fit for multiple traveling salesman problems.