Abstract 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 Decomp...Abstract 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.展开更多
文摘Abstract 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.
