Traveling Salesman Problem is one of typical problems of combinatorial optimization. It is because of complexity of TSP that accurate computing couldn't find a global optimal solution in more short time or all. By...
详细信息
ISBN:
(纸本)9781424409723
Traveling Salesman Problem is one of typical problems of combinatorial optimization. It is because of complexity of TSP that accurate computing couldn't find a global optimal solution in more short time or all. By analyzing the relationship between global solutions and local optimal solutions computed using algorithms for TSP, it is found that union set of edge sets multi high-qualify local optimal solutions can include all edges of a,global optimal solution. The method, initial edge set for TSP, is put forward based on statistic principle. The search space of original problem is down greatly by utilizing new method;the quantity of initial edge set is about double times of problem scale. Accurate computing algorithms can find global optimal solution for small scale TSP based on new edge sets, and efficiency of stochastic search algorithms is improved greatly.
暂无评论