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

Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (11): 2630-2633 .

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

周辉仁1,2唐万生1，牛犇1,2

1. 天津大学系统工程研究所，天津 300072； 2. 山东建筑大学管理工程学院, 山东济南 250101

出版日期:2009-11-26 发布日期:2010-01-03

Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm

ZHOU Hui-ren,TANG Wan-sheng,NIU Ben

1. Inst. of Systems Engineering, Tianjin Univ., Tianjin 300072, China; 2. School of Management and Engineering, Shandong Jianzhu Univ., Jinan 250101, China

Online:2009-11-26 Published:2010-01-03

摘要/Abstract

摘要：

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

Abstract:

In order to solve a kind of longestpathshortest multiple traveling salesman problem, a hierarchical genetic algorithm and decoding method with matrix is proposed. 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 show that the hierarchical genetic algorithm is efficient and fits for multiple traveling salesman problems.

周辉仁1,2唐万生1,牛犇. 基于递阶遗传算法的一类多旅行商问题优化[J]. Journal of Systems Engineering and Electronics, 2009, 31(11): 2630-2633 .

ZHOU Hui-ren,TANG Wan-sheng,NIU Ben. Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm[J]. Journal of Systems Engineering and Electronics, 2009, 31(11): 2630-2633 .