Relationship Analysis Between Optimal Solutions of TSPs

Traveling Salesman Problem is one of the typical NP-hard problems in the field of combinatorial optimization.Academe commits himself to finding new algorithms for solving exactly or approximately TSP in reasonable computing time for a long time.The fact,which the intersection between high-quality optimal solutions found by approximate algorithm and global optimal solutions,establishes two kind of special relationships,the one is between them,and the other one is among high-quality optimal solutions.The quantizing relationship model can be set up through mathematic analysis,and the prior probability of correlative parameters in the model is computed in virtue of experiment.By utilizing it,the stochastic TSP cutting procedure cuts sharply down problem solving scale.The edges can be identified in high probability whether or not they belong to the edge set of global optimal solutions so that the solving efficiency and quality is improved effectively.