Abstract
Traveling salesman problem (TSP) is extensively studied in combinatorial optimization and computer science. This paper gives a quick method to compute the sparse graphs for TSP based on the random frequency quadrilaterals so as to reduce the TSP on the complete graph to the TSP on the sparse graphs. When we choose N frequency quadrilaterals containing an edge e to compute its total frequency, the frequency of e in the optimal Hamiltonian cycle will be bigger than that of most of the other edges. We fix N to compute the frequency of each edge and the computation time of the quick method is O(n2). We suggest two frequency thresholds to trim the edges with the frequency below the two frequency thresholds and generate the sparse graphs for TSP. The experimental results show we compute the sparse graphs for these TSP instances in the TSPLIB.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
