基于递阶遗传算法的一类多旅行商问题优化

针对最小化单个旅行商路程的多旅行商问题，提出了一种递阶遗传算法和矩阵解码方法。该算法根据问题的特点，采用一种递阶编码方案，此编码与多旅行商问题一一对应。用递阶遗传算法优化多旅行商问题不需设计专门的遗传算子，操作简单，并且解码方法适于求解距离对称和距离非对称的多旅行商问题。计算结果表明，递阶遗传算法是有效的，能适用于优化多旅行商问题。

Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm

In order to solve a kind of longest-path-shortest multiple traveling salesman problem, a hierarchi-cal genetic algorithm and decoding method with matrix is proposed. Its coding method is simple and can effec-tively 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 computa-tional results show that the hierarchical genetic algorithm is efficient and fits for multiple traveling salesman problems.