Skip to main content
SpringerLink
Log in

An efficient index method for the optimal path query over multi-cost networks

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

In the past couple of decades, graphs have been widely used to model complex relationships among various entities in real applications. Shortest path query is a fundamental problem in graphs and has been well-studied. Most existing approaches for the shortest path problem consider that there is only one kind of cost in networks. However, there always are several kinds of cost in networks and users prefer to select an optimal path under the global consideration of these kinds of cost. In this paper, we study the problem of finding the optimal path in the multi-cost networks. We prove this problem is NP-hard and the existing index techniques cannot be used to this problem. We propose a novel partition-based index with contour skyline techniques to find the optimal path. We propose a vertex-filtering algorithm to facilitate the query processing. We conduct extensive experiments on six real-life networks and the experimental results show that our method has an improvement in efficiency by an order of magnitude compared to the previous heuristic algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: IPDPS (2006)

  2. Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD Conference, pp 349–360 (2013)

  3. Chanas, S., Kuchta, D.: A concept of the optimal solution of the transportation problem with fuzzy cost coefficients. Fuzzy Sets Syst. 82(3), 299–305 (1996)

    Article  MathSciNet  Google Scholar 

  4. Cheng, J., Ke, Y., Chu, S., Cheng, C.: Efficient processing of distance queries in large graphs: A vertex cover approach. In: SIGMOD (2012)

  5. Chomatek, L.: Genetic diversity in the multiobjective optimization of paths in graphs. In: Information systems architecture and technology: Proceedings of 36th international conference on information systems architecture and technology - ISAT 2015 - Part IV, Karpacz, Poland, September 20-22, 2015, pp 123–136 (2015)

  6. Delling, D., Wagner, D.: Pareto paths with sharc. In: Proceedings of the 8th international symposium on experimental algorithms (SEA’09), Dortmund, Germany, pp 125–136. Springer (2009)

  7. Florian, M.: Nonlinear cost network models in transportation analysis. vol. 26 167–196. 08 (2009)

  8. Funke, S., Storandt, S.: Proceedings of the sixth annual symposium on combinatorial search, SOCS Leavenworth, Washington, USA, July 11-13, 2013. AAAI Press. In: Helmert, M., Röger, G. (eds.) , p 2013 (2013)

  9. Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-completeness. W.H. Freeman (1979)

  10. Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp 156–165 (2005)

  11. Gong, Q., Cao, H., Nagarkar, P.: Skyline queries constrained by multi-cost transportation networks. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019, pp 926–937. IEEE (2019)

  12. Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)

    Article  MathSciNet  Google Scholar 

  13. Ilich, N., Simonovic, S.P.: An evolution program for non-linear transportation problems. J. Heuristics 7, 145–168 (2001)

    Article  Google Scholar 

  14. Ilich, N., Simonovic, S.P.: An evolution program for non-linear transportation problems. J Heuristics 7(2), 145–168 (2001)

    Article  Google Scholar 

  15. Mandow, L., Perez, D.J.: A new approach to multiobjective a* search. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI’05), pp 218–223. Morgan Kaufmann Publishers, Scotland (2005)

  16. Mandow, L., Pė,rez-de-la-Cruz, J.: Multiobjective a∗ search with consistent heuristics. J ACM 57(5), 27:1–27:25 (2010)

    Article  MathSciNet  Google Scholar 

  17. Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236–245 (1984)

    Article  MathSciNet  Google Scholar 

  18. Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: ICDE, pp 533–544 (2010)

  19. Pulido, F.J., Mandow, L., Pėrez-de-la-cruz, J.: Multiobjective shortest path problems with lexicographic goal-based preferences. European J. Operat. Res. 239(1), 89–101 (2014)

    Article  MathSciNet  Google Scholar 

  20. Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: A query-dependent local landmark scheme. In: Kementsietsidis, A., Salles, M.A.V. (eds.) IEEE 28th International Conference On Data Engineering (ICDE 2012), Washington, DC, USA (Arlington, Virginia), 1-5 April, 2012, pp 462–473. IEEE Computer Society (2012)

  21. Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: A query-dependent local landmark scheme. In: ICDE (2012)

  22. Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. PVLDB 4(2), 69–80 (2010)

    Google Scholar 

  23. Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: ICDE, pp 949–960 (2013)

  24. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp 43–54 (2008)

  25. Shekelyan, M., Jossė, G., Schubert, M.: 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, South Korea, April 13-17, 2015. In: Gehrke, J., Lehner, W., Shim, K., Cha, S.K., Lohman, G.M. (eds.) IEEE Computer Society, pp 459–470 (2015)

  26. Shetty, C.M.: A solution to the transportation problem with nonlinear costs. Oper. Res. 7(5), 571–580 (1959)

    Article  MathSciNet  Google Scholar 

  27. Wei, F.: Tedi: Efficient shortest path query answering on graphs. In: SIGMOD, pp 99–110 (2010)

  28. Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT, pp 493–504 (2009)

  29. Xie, F., Jia, R.: Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm. Comput. Ind. Eng. 63(4), 763–778 (2012)

    Article  Google Scholar 

  30. Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: Cruz, I.F., Ferrari, E., Tao, Y., Bertino, E., Trajcevski, G. (eds.) IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014, pp 136–147. IEEE Computer Society (2014)

  31. Yang, Y., Yu, J.X., Gao, H., Li, J.: Finding the optimal path over multi-cost graphs. In: CIKM, pp 2124–2128. ACM (2012)

  32. Zhong, R., Li, G., Tan, K., Zhou, L.: G-tree: An efficient index for KNN search on road networks. In: CIKM, pp 39–48 (2013)

  33. Zhu, A.D., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path and distance queries on road networks: towards bridging theory and practice. In: SIGMOD Conference, pp 857–868 (2013)

Download references

Acknowledgements

This work is supported by the National Key Research and Development Program of China No. 2019YFB2101903, the State Key Laboratory of Communication Content Cognition Funded Project No.A32003, and the National Natural Science Foundation of China No. 61972275.

Author information

Authors and Affiliations

  1. College of Intelligence and Computing, Tianjin University, Tianjin, China

    Yajun Yang, Hang Zhang & Xin Wang

  2. State Key Laboratory of Communication Content Cognition, Beijing, China

    Yajun Yang

  3. Faculty of Computing, Harbin Institute of Technology, Harbin, China

    Hong Gao

Authors
  1. Yajun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xin Wang.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, Y., Zhang, H., Gao, H. et al. An efficient index method for the optimal path query over multi-cost networks. World Wide Web 24, 697–719 (2021). https://doi.org/10.1007/s11280-021-00871-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-021-00871-w

Keywords

Search

Navigation