[1] TSAI C F,TSAI C W,YANG T. A modified multiple-searching method to genetic algorithms for solving traveling salesman problem[C]// IEEE International Conference on Systems, Man and Cybernetics. Piscataway:IEEE,2002:6-12.[2] KIRKPATRICK S, GELATF C D,VECCHI M P. Optimization by simulated annealing[J]. Science, 1983,220(4598): 671-680.[3] TSAI C F, TSAI C W, TSENG C C. A new hybrid heuristic approach for solving large traveling salesman problem[J]. Information Sciences, 2004,166(1): 67-81. [4] HE Y,QIU Y H,KIU G Y. A Parallel tabu search approach based on genetic crossover operation[C]// Proceedings of the 19th IEEE International Conference Cordon Advanced Information Networking and Applications. Washington, DC:IEEE Computer Society, 2005:1550-1553.[5] ROSENKRANTZ D J, STEARNS R E, LEWIS P M. An analysis of several heuristics for the traveling salesman problem[J].SIAM Journal of Computer, 1977,6(1): 563-581. [6] CROES G A. A method for solving traveling salesman problems[J]. Operations Research, 1958, 6(6):791-812.[7] BENTLEY J L. Fast algorithm for geometric traveling salesman problems[J]. ORSA Journal on Computing, 1992, 4(4): 387-411.[8] LIN S,KERNIGHAN B W. An effective heuristic algorithm for the traveling salesman problem[J]. Operations Research,1973,21(2): 498-516.[9] PENEV K, LITTLEFAIR G. Free search- a comparative analysis [J]. Information Sciences, 2005, 172(1/2): 173-l93.[10] 周晖, 李丹美, 邵世煌,等. 一种新的群集智能算法——自由搜索[J].东华大学学报:自然科学版,2007, 33(5): 579-583.[11] 周晖,李丹美, 邵世煌,等. 一种新的群集智能优化及其改进研究[J]. 系统工程与电子技术, 2008, 30(2):337-340.[12] 周晖, 徐晨, 邵世煌,等. 自适应搜索优化算法[J].计算机科学,2008,35(10):188-191.[13] 伍国华, 马满好. 路径交叉检测与消除方法和邻节点置换方法改进TSP的解[J]. 计算机应用研究,2011,28(2):485-487. |