%0 Journal Article
%T Study on multiple traveling salesman problem based on genetic algorithm<br>基于遗传算法的一类多旅行商问题研究
%A WANG Hai-long
%A ZHOU Hui-ren
%A WEI Ying-hui
%A <br>王海龙
%A 周辉仁
%A 魏颖辉
%J 计算机应用
%D 2009
%I 
%X Traveling salesman problem is a classical complete nondeterministic polynomial problem. It is significant to solve Multiple Traveling Salesman Problems (MTSP). Previous researches on multiple traveling salesman problem are 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-path-shortest as the evaluating rule. In order to solve this problem, genetic algorithm was used to optimize it and decoding method with matrix was proposed. It is fit for solving symmetric and asymmetric MTSP. Symmetric and asymmetric multiple traveling salesman problems were simulated and different crossover operators were compared.
%K MTSP problem
%K optimization
%K decoding method
%K genetic algorithm<br>遗传算法
%K 多旅行商问题
%K 优化
%K 解码方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=987608A0BE8C77563D2B63A3AC2D716B&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=CA4FD0336C81A37A&sid=EFD65B51496FB200&eid=B62E0EEFE746E568&journal_id=1001-9081&journal_name=计算机应用&referenced_num=2&reference_num=7