[1]
Li Ying, Ma Kai, Zhang J iong. An efficient multicore based parallel computing approach for TSP problems[C]// 2013 the Ninth International Conference on Semantics, Knowledge and Grids (SKG). 2013:98104.
[2]高经纬,张煦,李峰,等. 求解TSP问题的遗传算法实现[J]. 计算机时代, 2004(2):1921.
[3]张煜东,吴乐南,韦耿. 智能算法求解TSP问题的比较[J]. 计算机工程与应用, 2009,45(11):1115.
[4]Yu Yingying, Chen Yan, Li Taoying. A new design of genetic algorithm for solving TSP[C]// Proceedings of the Fourth International Joint Conference on Computational Sciences and Optimization. 2011:309313.
[5]王斌,李元香,王治. 一种求解TSP问题的单亲遗传算法[J]. 计算机科学, 2003,30(5):7375.
[6]李茂军,朱陶业,童调生. 单亲遗传算法与传统遗传算法的比较研究[J]. 系统工程, 2001,19(1):6165.
[7]Chen Junhong, Hu Junxiang, Zhen Xunyan. Application of improved parthenogenetic algorithm in distribution network switch optimal planning[C]// 2010 International Conference on Electrical and Control Engineering (ICECE). 2010:467470.
[8]Yang Jinqiu, Yang Jiangang, Chen Genlang. Solving largescale TSP using adaptive clustering method[C]// The Second International Symposium on Computional Intelligence and Design. 2009:4951.
[9]Osaba E, Carballedo R, Diaz F, et al. On the influence of using initialization functions on genetic algorithms solving combinatorial optimization problems: A first study on the TSP[C]// 2014 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS). 2014:16.
[10]Le Ny J, Feron E, Frazzoli E. On the Dubins traveling salesman problem[J]. IEEE Transactions on Automatic Control, 2012,57(1):265270.
[11]金聪. 启发式遗传算法及其应用[J]. 数值计算与计算机应用, 2003,24(1):3035.
[12]戴文华,焦翠珍,何婷婷. 基于并行遗传算法的Kmeans聚类研究[J]. 计算机科学, 2008,36(6):171174.
[13]戚玉涛,刘芳,焦李成. 求解大规模TSP问题的自适应规约免疫算法[J]. 软件学报,2008, 19(6):12651273.
[14]赵连朋,金喜子,王娜,等. 求解超大规模旅行商问题的纵深遗传算法[J]. 计算机工程与应用, 2009,45(4):5658.
[15]左国才,杨金民. Kmeans算法在电信CRM客户分类中的应用[J]. 计算机系统应用, 2010,19(2):155159.
[16]温光辉,王明旭,郭嗣琮. 一种求解TSP问题的新型遗传编码方案[J]. 科学技术与工程, 2006,6(2):206208
[17]滕奇志,唐棠,何小海,等. 基于交换单亲遗传算法的砂岩三位显微图像重建[J]. 数据采集与处理, 2010,25(3):364368. |