Accurate solving hybrid algorithm for small scale TSP
Liu Wen-jian · Systems engineering and electronics · 2008
Owing to the computation complexity of traveling salesman problems accurate algorithms couldn't find a global optimal solution in relatively short time or couldn't find a global optimal solution at all along with the enlargement of problem scale.By analyzing the relationship between global optimal solutions and local optimal solutions,the method establishing initial cutting edge set for small scale TSP is put forward based on probability statistic principle.In the meanwhile,dynamic upbound adjustment is applied into the branch and cut algorithm.The global optimal solutions can be found for all of small scale traveling salesman problems by utilizing the new hybrid branch and cut algorithm.