Study on multiple traveling salesman problem based on genetic algorithm
基于遗传算法的一类多旅行商问题研究

Traveling salesman problem is a classical complete nondeterministic polynomial problem. It is significant to solve Multiple Traveling Salesman Problems (MTSP). Previous researches on multiple traveling salesman problem are mostly limited to the kind that employed total-path-shortest as the evaluating rule, but little notice is made on the kind that employed longest-path-shortest as the evaluating rule. In order to solve this problem, genetic algorithm was used to optimize it and decoding method with matrix was proposed. It is fit for solving symmetric and asymmetric MTSP. Symmetric and asymmetric multiple traveling salesman problems were simulated and different crossover operators were compared.