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

第 26 卷第 10期 计 算 机 应 用 研 究 Vo.l 26 No. 10 2009年 10月 Application Research of Computers Oct. 2009 * 1, 2 1 1, 2 , , ( 1. 天津大学系统工程研究所, 天津 300072; 2. 山东建筑大学 管理工程学院, 济南 250101) : 旅行商问题是一 个经典的 N 问题, 对多人旅行商问题的求解则更具有意义为了解决所有旅行商路 径总和最小为优化标准的多旅行商一类问题, 提出了一种递阶遗传算法和矩阵解码方法该算法根据问题的特 点, 采用一种递阶编码方案, 此编码与多旅行商问题一一对应用递阶遗传算法优化多旅行商问题无须设计专 门的遗传算子, 操作简单, 并且解码方法适于求解距离对称和距离非对称的多旅行商问题计算结果表明, 递阶 遗传算法是有效的, 能适用于优化多旅行商问题 : 递阶遗传算法; 多旅行商问题; 优化; 解码方法 : T 30116; T 18 : A : 1001-3695( 2009) 10-3754-04 do:i 10. 3969/ .j issn. 1001-3695. 2009. 10. 044 Optmi ization ofmultiple traveling salesman problem based on hierarchical genetic algorithm 1, 2 1 1, 2 ZHOU Hu-i ren , TANG W an-sheng , N IU Ben ( 1. Institute of Sy stem s Engineering, Tianj in Un iversity, T ianj in 300072, China; 2. School of M anagem ent E ng ineering, Shandong ianzhu University, inan 250101, China) Abstract: Traveling salesman problem is a classicalnondeterm inistic polynom ial problem. It is significance to solve multiple traveling salesman problems (MTS ). In order to solveMTS that employed tota-lpath-shortest as the evaluating rule, thispa- per proposed a hierarchicalgenetic algorithm and decodingmethodw ithmatrix. Its codingmethod is smi ple and can effectively reflect the traveling policy, and themethods of crossover and mutation are not special to design. By thismethod, symmetric and asymmetricmultiple traveling salesman problems can be easily solved. The computational results suggest that the hierar- chical genetic algorithm is efficient and fit formultiple traveling salesman problems. K ey word s: hierarchical genetic