Abstract
Path skyline query is a fundamental problem in bicriteria network analysis and is widely applied in a variety of applications. Given a source s and a destination t in a bicriteria network G, path skyline query aims to identify all the skyline paths from s to t in G. In the literature, \(\mathsf {PSQ}\) is a fundamental algorithm for path skyline query and is also used as a building block for the afterwards proposed algorithms. In \(\mathsf {PSQ}\), a key operation is to record the skyline paths from s to v for each node v that is possible on the skyline paths from s to t. However, to obtain the skyline paths for v, \(\mathsf {PSQ}\) has to maintain other paths that are not skyline paths for v, which makes \(\mathsf {PSQ}\) inefficient. Motivated by this, in this paper, we propose a new algorithm \(\mathsf {PSQ^+}\) for the path skyline query. By adopting an ordered path exploring strategy, our algorithm can totally avoid the fruitless path maintenance problem in \(\mathsf {PSQ}\). We evaluate our proposed algorithm on real networks and the experimental results demonstrate the efficiency of our proposed algorithm. Besides, the experimental results also demonstrate the algorithm that uses \(\mathsf {PSQ}\) as a building block for the path skyline query can achieve a significant performance improvement after we substitute \(\mathsf {PSQ^+}\) for \(\mathsf {PSQ}\).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Brumbaugh-Smith, J., Shier, D.: An empirical investigation of some bicriterion shortest path algorithms. Eur. J. Oper. Res. 43(2), 216–224 (1989)
Clímaco, J.C., Pascoal, M.: Multicriteria path and tree problems: discussion on exact algorithms and applications. Int. Trans. Oper. Res. 19(1–2), 63–98 (2012)
Climaco, J.C.N., Martins, E.Q.V.: A bicriterion shortest path algorithm. Eur. J. Oper. Res. 11(4), 399–404 (1982)
Delling, D., Wagner, D.: Pareto paths with SHARC. In: Proceedings of the SEA, pp. 125–136 (2009)
Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr. 22(4), 425–460 (2000)
Gabrel, V., Vanderpooten, D.: Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. Eur. J. Oper. Res. 139(3), 533–542 (2002)
Garroppo, R.G., Giordano, S., Tavanti, L.: A survey on multi-constrained optimal path computation: exact and approximate algorithms. Comput. Netw. 54(17), 3081–3107 (2010)
Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Application, pp. 109–127. Springer, Berlin (1980). https://doi.org/10.1007/978-3-642-48782-8_9
Jang, S., Yoo, J.: Processing continuous skyline queries in road networks. In: Computer Science and Its Applications, pp. 353–356 (2008)
Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: Proceedings of the ICDE, pp. 261–272 (2010)
Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236–245 (1984)
Mote, J., Murthy, I., Olson, D.L.: A parametric approach to solving bicriterion shortest path problems. Eur. J. Oper. Res. 53(1), 81–92 (1991)
Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: Proceedings of the ICDE, pp. 533–544 (2010)
Müller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1), 269–286 (2006)
Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299–1331 (2009)
Sacharidis, D., Bouros, P., Chondrogiannis, T.: Finding the most preferred path. In: Proceedings of the SIGSPATIAL (2017)
Serafini, P.: Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn, J., Krabs, W. (eds.) Recent Advances and Historical Development of Vector Optimization, pp. 222–232. Springer, Berlin (1987). https://doi.org/10.1007/978-3-642-46618-2_15
Shekelyan, M., Jossé, G., Schubert, M.: Linear path skylines in multicriteria networks. In: Proceedings of the ICDE, pp. 459–470 (2015)
Skriver, A.J.: A classification of bicriterion shortest path (BSP) algorithms. Asia-Pac. J. Oper. Res. 17(2), 199 (2000)
Skriver, A.J., Andersen, K.A.: A label correcting approach for solving bicriterion shortest-path problems. Comput. Oper. Res. 27(6), 507–524 (2000)
Storandt, S.: Route planning for bicycles-exact constrained shortest paths made practical via contraction hierarchy. In: ICAPS, vol. 4, p. 46 (2012)
Tarapata, Z.: Selected multicriteria shortest path problems: an analysis of complexity, models and adaptation of standard algorithms. Int. J. Appl. Math. Comput. Sci. 17(2), 269–287 (2007)
Ulungu, E., Teghem, J., Fortemps, P., Tuyttens, D.: MOSA method: a tool for solving multiobjective combinatorial optimization problems. J. Multicriteria Decis. Anal. 8(4), 221 (1999)
Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Multi-cost optimal route planning under time-varying uncertainty. In: Proceedings of the ICDE (2014)
Acknowledgments
Long Yuan is supported by Huawei YBN2017100007. Fan Zhang is supported by Huawei YBN2017100007. Lu Qin is supported by ARC DP160101513. Xuemin Lin is supported by NSFC 61672235, ARC DP170101628, DP180103096 and Huawei YBN2017100007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Ouyang, D., Yuan, L., Zhang, F., Qin, L., Lin, X. (2018). Towards Efficient Path Skyline Computation in Bicriteria Networks. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10827. Springer, Cham. https://doi.org/10.1007/978-3-319-91452-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-91452-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91451-0
Online ISBN: 978-3-319-91452-7
eBook Packages: Computer ScienceComputer Science (R0)