%0 Journal Article
%T Study on minimum completion time multiple travelingsalesman problem based on genetic algorithm<br>基于GA的最小旅行时间的多旅行商问题研究*
%A ZHOU Hui-ren
%A TANG Wan-sheng
%A WEI Ying-hui
%A <br>周辉仁
%A 唐万生
%A 魏颖辉
%J 计算机应用研究
%D 2009
%I 
%X 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...
%K 遗传算法
%K 多旅行商问题
%K 最小完成时间
%K 解码方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=DB29BB494740CBC48CB19B213765927D&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=DF92D298D3FF1E6E&sid=22C7E80B7D54E233&eid=20481FD9F9546A61&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=9