Solving TSP with Compression Method of the Search Space
Ning Zhiquan · Computer Programming Skills & Maintenance · 2011
The traveling salesman problem(TSP) is a well-known combinatorial optimization problem.,This paper started from the regional characteristics in TSP,came up with the pruning-table-method which combines the search-pruning algorithm and genetic algorithm.The pruning-table-method showed a good search capability and robustness in the experiment of CTSP,it's a new and feasible solution.