{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:33Z","timestamp":1740123813986,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972275"],"award-info":[{"award-number":["61972275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11280-021-00871-w","type":"journal-article","created":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T12:02:49Z","timestamp":1615464169000},"page":"697-719","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An efficient index method for the optimal path query over multi-cost networks"],"prefix":"10.1007","volume":"24","author":[{"given":"Yajun","family":"Yang","sequence":"first","affiliation":[]},{"given":"Hang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9651-0651","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,11]]},"reference":[{"key":"871_CR1","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: IPDPS (2006)","DOI":"10.21236\/ADA439402"},{"key":"871_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD Conference, pp 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"3","key":"871_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0165-0114(95)00278-2","volume":"82","author":"S Chanas","year":"1996","unstructured":"Chanas, S., Kuchta, D.: A concept of the optimal solution of the transportation problem with fuzzy cost coefficients. Fuzzy Sets Syst. 82(3), 299\u2013305 (1996)","journal-title":"Fuzzy Sets Syst."},{"key":"871_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., Cheng, C.: Efficient processing of distance queries in large graphs: A vertex cover approach. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213888"},{"key":"871_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013136 (2015)","DOI":"10.1007\/978-3-319-28567-2_11"},{"key":"871_CR6","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Pareto paths with sharc. In: Proceedings of the 8th international symposium on experimental algorithms (SEA\u201909), Dortmund, Germany, pp 125\u2013136. Springer (2009)","DOI":"10.1007\/978-3-642-02011-7_13"},{"key":"871_CR7","doi-asserted-by":"crossref","unstructured":"Florian, M.: Nonlinear cost network models in transportation analysis. vol. 26 167\u2013196. 08 (2009)","DOI":"10.1007\/BFb0121092"},{"key":"871_CR8","unstructured":"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\u00f6ger, G. (eds.) , p 2013 (2013)"},{"key":"871_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-completeness. W.H. Freeman (1979)"},{"key":"871_CR10","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp 156\u2013165 (2005)"},{"key":"871_CR11","unstructured":"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\u2013937. IEEE (2019)"},{"key":"871_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"871_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1009609820093","volume":"7","author":"N Ilich","year":"2001","unstructured":"Ilich, N., Simonovic, S.P.: An evolution program for non-linear transportation problems. J. Heuristics 7, 145\u2013168 (2001)","journal-title":"J. Heuristics"},{"issue":"2","key":"871_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1009609820093","volume":"7","author":"N Ilich","year":"2001","unstructured":"Ilich, N., Simonovic, S.P.: An evolution program for non-linear transportation problems. J Heuristics 7(2), 145\u2013168 (2001)","journal-title":"J Heuristics"},{"key":"871_CR15","unstructured":"Mandow, L., Perez, D.J.: A new approach to multiobjective a* search. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI\u201905), pp 218\u2013223. Morgan Kaufmann Publishers, Scotland (2005)"},{"issue":"5","key":"871_CR16","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1754399.1754400","volume":"57","author":"L Mandow","year":"2010","unstructured":"Mandow, L., P\u0117,rez-de-la-Cruz, J.: Multiobjective a\u2217 search with consistent heuristics. J ACM 57(5), 27:1\u201327:25 (2010)","journal-title":"J ACM"},{"issue":"2","key":"871_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"871_CR18","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: ICDE, pp 533\u2013544 (2010)","DOI":"10.1109\/ICDE.2010.5447851"},{"issue":"1","key":"871_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2014.05.008","volume":"239","author":"FJ Pulido","year":"2014","unstructured":"Pulido, F.J., Mandow, L., P\u0117rez-de-la-cruz, J.: Multiobjective shortest path problems with lexicographic goal-based preferences. European J. Operat. Res. 239(1), 89\u2013101 (2014)","journal-title":"European J. Operat. Res."},{"key":"871_CR20","unstructured":"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\u2013473. IEEE Computer Society (2012)"},{"key":"871_CR21","doi-asserted-by":"crossref","unstructured":"Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: A query-dependent local landmark scheme. In: ICDE (2012)","DOI":"10.1109\/ICDE.2012.53"},{"issue":"2","key":"871_CR22","first-page":"69","volume":"4","author":"MN Rice","year":"2010","unstructured":"Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. PVLDB 4(2), 69\u201380 (2010)","journal-title":"PVLDB"},{"key":"871_CR23","doi-asserted-by":"crossref","unstructured":"Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: ICDE, pp 949\u2013960 (2013)","DOI":"10.1109\/ICDE.2013.6544888"},{"key":"871_CR24","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"871_CR25","unstructured":"Shekelyan, M., Joss\u0117, 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\u2013470 (2015)"},{"issue":"5","key":"871_CR26","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1287\/opre.7.5.571","volume":"7","author":"CM Shetty","year":"1959","unstructured":"Shetty, C.M.: A solution to the transportation problem with nonlinear costs. Oper. Res. 7(5), 571\u2013580 (1959)","journal-title":"Oper. Res."},{"key":"871_CR27","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: Efficient shortest path query answering on graphs. In: SIGMOD, pp 99\u2013110 (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"871_CR28","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT, pp 493\u2013504 (2009)","DOI":"10.1145\/1516360.1516418"},{"issue":"4","key":"871_CR29","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.cie.2012.04.016","volume":"63","author":"F Xie","year":"2012","unstructured":"Xie, F., Jia, R.: Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm. Comput. Ind. Eng. 63(4), 763\u2013778 (2012)","journal-title":"Comput. Ind. Eng."},{"key":"871_CR30","unstructured":"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\u2013147. IEEE Computer Society (2014)"},{"key":"871_CR31","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yu, J.X., Gao, H., Li, J.: Finding the optimal path over multi-cost graphs. In: CIKM, pp 2124\u20132128. ACM (2012)","DOI":"10.1145\/2396761.2398586"},{"key":"871_CR32","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K., Zhou, L.: G-tree: An efficient index for KNN search on road networks. In: CIKM, pp 39\u201348 (2013)","DOI":"10.1145\/2505515.2505749"},{"key":"871_CR33","doi-asserted-by":"crossref","unstructured":"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\u2013868 (2013)","DOI":"10.1145\/2463676.2465277"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00871-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-021-00871-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00871-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T16:44:35Z","timestamp":1616258675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-021-00871-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00871-w","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"20 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}