A Sketch-First Approach for Finding TSP

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9877)

Abstract

Travel planning is one of the most important issues in location-based services (LBS), and TSP (traveling salesman problem) is to find the shortest tour that traverses all the given points exactly once. Given the hardness of TSP as an NP-hard problem, a large number of heuristic methods are proposed to find a tour efficiently. Here, the heuristics proposed are based on a similar idea that is to expand a partial tour by adding points one by one in different ways until all points are visited. In this paper, we study TSP query with a given set of points \(Q\). We propose a new heuristic called Sketch-First, which is different from the existing approaches. By Sketch-First, we select a set of points out of \(Q\), forming a sketch of \(Q\), and add the points that are not in the sketch back to the sketch to obtain the answer for \(Q\). The sketch gives a global picture on the points, and can be used to guide to add the other points back effectively. We discuss the heuristics to find a sketch for \(Q\). Our approach is based on the observation that a better sketch with the same number of points is the sketch over which its optimal tour is larger in length. In addition, as the number of such points is to be small, we can find the optimal tour for the sketch. We discuss our methods, and conduct extensive experiments to show the effectiveness and efficiency of our methods.

References

  1. 1.
    Zhu, A.D., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path, distance queries on road networks: towards bridging theory and practice. In: SIGMOD, pp. 857–868 (2013)Google Scholar
  2. 2.
    Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. 46(4), 1–31 (2014)CrossRefMATHGoogle Scholar
  3. 3.
    Xu, Z., Jacobsen, H.: Processing proximity relations in road networks. In: SIGMOD, pp. 243–254 (2010)Google Scholar
  4. 4.
    Yan, D., Zhao, Z., Ng, W.: Efficient algorithms for finding optimal meeting point on road networks. PVLDB 4(11), 968–979 (2011)Google Scholar
  5. 5.
    Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Sharifzadeh, M., Kolahdouzan, M.R., Shahabi, C.: The optimal sequenced route query. VLDB J. 17(4), 765–787 (2008)CrossRefGoogle Scholar
  7. 7.
    Cao, X., Chen, L., Cong, G., Xiao, X.: Keyword-aware optimal route search. PVLDB 5(11), 1136–1147 (2012)Google Scholar
  8. 8.
    Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Deineko, V.G., van Dal, R., Rote, G.: The convex-hull-and-line traveling salesman problem: a solvable case. Inf. Process. Lett. 51(3), 141–148 (1994)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Böckenhauer, H.-J., Hromkovič, J., Sprock, A.: Knowing all optimal solutions does not help for TSP reoptimization. In: Kelemen, J., Kelemenová, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 7–15. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16(3), 538–558 (1968)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Nicholson, T.: A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three machine scheduling problems. IMA J. Appl. Math. 3(4), 362–375 (1967)CrossRefMATHGoogle Scholar
  13. 13.
    Bentley, J.L.: Fast algorithms for geometric traveling salesman problems. Informs J. Comput. 4(4), 387–411 (1992)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    MacGregor, J.N., Ormerod, T.: Human performance on the traveling salesman problem. Percept. Psychophysics 58(4), 527–539 (1996)CrossRefGoogle Scholar
  15. 15.
    Macgregor, J.N., Ormerod, T.C.: Evaluating the importance of the convex hull in solving the euclidean version of the traveling salesperson problem: reply to lee and vickers. Percept. Psychophysics 62(7), 1501–1503 (2000)CrossRefGoogle Scholar
  16. 16.
    Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer Science & Business Media, New York (2002)MATHGoogle Scholar
  17. 17.
    Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.The Chinese University of Hong KongHong KongChina

Personalised recommendations