2[4]Golden B L,Assad A A.Vehicle Routing:Methods and Studies[M].Amsterdam:North-Holland,1988.
3[5]Lenstra J K,Nemhauser G L.Handbooks in Operations Research and Management Science[M].Amsterdam:Elsevier,1995.
4[8]Lawler E L,Lenstra J K,Rinnooy Kan A H G,et al.The Traveling Salesman Problem[M].New York:John Wiley & Sons,1985.
5[9]Clarke G,Wright J W.Scheduling of vehicles from a central depot in a number of delivery points[J].Operations Research,1964,12(4):568-581.
6[10]Ronald H B,Yogesh K A.A performance comparison of several popular algorithms for vehicle routing and scheduling[J].Journal of Business Logistics,1988,9(1):51-65.
7[11]Davis L.Genetic Algorithms and Simulated Annealing[M].Los Altos:Morgan Kaufmann Publishers,1987.
8[12]Tokuda I,Nagashima T,Aihara K.Global bifurcation structure of chaotic neural networks and its application to traveling salesman problem[J].Neural Networks,1997,10(9):1675-1690.
9[13]Norback J P,Love R F.Geometric approaches to solving the traveling salesman problem[J].Management Science,1977,23(11):1208-1223.
