Study on minimum completion time multiple travelingsalesman problem based on genetic algorithm
基于GA的最小旅行时间的多旅行商问题研究*

Previous research on multiple traveling salesman problems is 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-time-shortest as the evaluating rule. In order to solve this problem,used genetic algorithm to optimize it and proposed decoding method with matrix. This paper simulated symmetric and asymmetric multiple traveling salesman problems and compared different crossover operators. It is fit for solving symmetric...