%0 Journal Article
%T Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm<br>基于递阶遗传算法的多旅行商问题优化*
%A ZHOU Hui-ren
%A TANG Wan-sheng
%A NIU Ben
%A <br>周辉仁
%A 唐万生
%A 牛犇
%J 计算机应用研究
%D 2009
%I 
%X Traveling salesman problem is a classical nondeterministic polynomial problem. It is significance to solve multiple traveling salesman problems (MTSP). In order to solve MTSP that employed total-path-shortest as the evaluating rule, this paper proposed a hierarchical genetic algorithm and decoding method with matrix. 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 suggest that the hierarchical genetic algorithm is efficient and fit for multiple traveling salesman problems.
%K hierarchical genetic algorithm
%K multiple traveling salesman problem
%K optimization
%K decoding method<br>递阶遗传算法
%K 多旅行商问题
%K 优化
%K 解码方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F7196DF697ADE62F5C21D5D5590145D4&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=F3090AE9B60B7ED1&sid=F1D1D6157AB29325&eid=2D7D9294F5B03816&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=16