TY - JFULL AU - Y. Wang PY - 2012/11/ TI - The Frequency Graph for the Traveling Salesman Problem T2 - International Journal of Electronics and Communication Engineering SP - 1188 EP - 1192 VL - 6 SN - 1307-6892 UR - https://publications.waset.org/pdf/2862 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 70, 2012 N2 - Traveling salesman problem (TSP) is hard to resolve when the number of cities and routes become large. The frequency graph is constructed to tackle the problem. A frequency graph maintains the topological relationships of the original weighted graph. The numbers on the edges are the frequencies of the edges emulated from the local optimal Hamiltonian paths. The simplest kind of local optimal Hamiltonian paths are computed based on the four vertices and three lines inequality. The search algorithm is given to find the optimal Hamiltonian circuit based on the frequency graph. The experiments show that the method can find the optimal Hamiltonian circuit within several trials. ER -