caa a22 4500 477074359 CHVBK 20180405111435.0 cr unu---uuuuu 170330e19961201xx s 000 0 eng 10.1007/BF02900870 doi (NATIONALLICENCE)springer-10.1007/BF02900870 A hybrid algorithm for TSP [Elektronische Daten] [Huang Zhangcan, Lu Kuang] In this paper, we introduce a hybrid algorithm to search the approximate solution of TSP, which contains the advantage of Lin's algorithm, simulate annealing algorithm, genetic algorithm and Domain Decomposition method. The algorithm has been successfully used in solving many TSP problems from 100 to 100000 cities. Those applications demonstrate the efficiency of the algorithm. Springer, 1996 Zhangcan Huang Wuhan University of Automobile Polytechnic, 430070, Wuhan, P. R. China aut Kuang Lu Wuhan University of Automobile Polytechnic, 430070, Wuhan, P. R. China aut Wuhan University Journal of Natural Sciences Wuhan University 1/3-4(1996-12-01), 461-464 1007-1202 1:3-4<461 1996 1 11859 https://doi.org/10.1007/BF02900870 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02900870 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Zhangcan Huang Wuhan University of Automobile Polytechnic, 430070, Wuhan, P. R. China aut NATIONALLICENCE 700 1- Kuang Lu Wuhan University of Automobile Polytechnic, 430070, Wuhan, P. R. China aut NATIONALLICENCE 773 0- Wuhan University Journal of Natural Sciences Wuhan University 1/3-4(1996-12-01), 461-464 1007-1202 1:3-4<461 1996 1 11859 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer