{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:47:36Z","timestamp":1648532856525},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,28]],"date-time":"2016-11-28T00:00:00Z","timestamp":1480291200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Scientific research fund for young of North China Institute of Aerospace Engineering","award":["KY201419"],"award-info":[{"award-number":["KY201419"]}]},{"name":"the Science and technology project of Hebei Province","award":["15210909"],"award-info":[{"award-number":["15210909"]}]},{"name":"the Scientific and Technical Research Foundation of Hebei Province","award":["15212113"],"award-info":[{"award-number":["15212113"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10586-016-0696-0","type":"journal-article","created":{"date-parts":[[2016,11,28]],"date-time":"2016-11-28T03:37:59Z","timestamp":1480304279000},"page":"301-309","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Applying the locality principle to improve the shortest path algorithm"],"prefix":"10.1007","volume":"20","author":[{"given":"Wang","family":"Xinghui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Jianyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xinrong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Huijuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,28]]},"reference":[{"issue":"3","key":"696_CR1","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1002\/qre.1792","volume":"32","author":"C-C Jane","year":"2016","unstructured":"Jane, C.-C., Laih, Y.-W.: System travel time reliability: a measure of the quality of service of networks. Qual. Reliab. Eng. Int. 32(3), 805\u2013815 (2016)","journal-title":"Qual. Reliab. Eng. Int."},{"issue":"2","key":"696_CR2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.3844\/jcssp.2015.330.336","volume":"11","author":"NAM Sabri","year":"2015","unstructured":"Sabri, N.A.M., Basari, A.S.H.: The utilisation of Dijkstra\u2019s algorithm to assist evacuation route in higher and close building. J. Comput. Sci. 11(2), 330\u2013336 (2015)","journal-title":"J. Comput. Sci."},{"key":"696_CR3","doi-asserted-by":"crossref","unstructured":"Hooshmand, R.-A., Fesharaki, F.H.: IEEE Trans. Smart Grid 7(1), 84\u201393 (2016)","DOI":"10.1109\/TSG.2015.2404855"},{"issue":"5","key":"696_CR4","doi-asserted-by":"crossref","first-page":"2725","DOI":"10.1007\/s11042-015-2619-0","volume":"75","author":"W Zhicheng","year":"2016","unstructured":"Zhicheng, W., Yufei, C., Zewei, Z., Weidong, Z.: An automatic panoramic image mosaic method based on graph model. Multimedia Tools Appl. 75(5), 2725\u20132740 (2016)","journal-title":"Multimedia Tools Appl."},{"issue":"1","key":"696_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s00373-015-1576-8","volume":"32","author":"C Fugang","year":"2016","unstructured":"Fugang, C., Han, R., Ni, C.: Finding shorter cycles in a weighted graph. Graphs Comb. 32(1), 65\u201377 (2016)","journal-title":"Graphs Comb."},{"key":"696_CR6","unstructured":"Bin, L., Liangshan, X.: The energy conservation optimization design of the cutting edges of the twist drill based on Dijkstra\u2019s algorithm. Int. J. Adv. Manuf. Technol. 82(5), 889\u2013900 (2016)"},{"issue":"4","key":"696_CR7","first-page":"77","volume":"34","author":"WEI Wen-hong","year":"2012","unstructured":"Wen-hong, W.E.I., Qing-xia, L.I., Zhao-quan, C.A.I.: A single-source shortest path algorithm based on the bucket structure. Comput. Eng. Sci. 34(4), 77\u201381 (2012)","journal-title":"Comput. Eng. Sci."},{"issue":"1","key":"696_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.aml.2011.06.008","volume":"25","author":"A Aini","year":"2012","unstructured":"Aini, A., Salehipour, A.: Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem. Appl. Math. Lett. 25(1), 1\u20135 (2012)","journal-title":"Appl. Math. Lett."},{"issue":"2","key":"696_CR9","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s11235-015-0088-4","volume":"62","author":"M Zhenyu","year":"2016","unstructured":"Zhenyu, M., Jeng-Shyang, P., Abdulhameed, A.: A new meta-heuristic ebb-tide-fish-inspired algorithm for traffic navigation. Telecommun. Syst. 62(2), 403\u2013415 (2016)","journal-title":"Telecommun. Syst."},{"key":"696_CR10","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.amc.2014.11.076","volume":"267","author":"JL Galan-Garcia","year":"2015","unstructured":"Galan-Garcia, J.L., Aguilera-Venegas, G., Galan-Garcia, M.A., Rodriguez-Cielos, P.: A new Probabilistic Extension of Dijkstra\u2019s Algorithm to simulate more realistic traffic flow in a smart city. Appl. Math. Comput. 267, 780\u2013789 (2015)","journal-title":"Appl. Math. Comput."},{"issue":"11","key":"696_CR11","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.1016\/j.aml.2012.02.042","volume":"25","author":"A Amirteimoori","year":"2012","unstructured":"Amirteimoori, A.: An extended shortest path problem: a data envelopment analysis approach. Appl. Math. Lett. 25(11), 1839\u20131843 (2012)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"696_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.12720\/jcm.8.1.55-65","volume":"8","author":"R He","year":"2013","unstructured":"He, R., Lin, B.: Dynamic Power-aware shared path protection algorithms in WDM mesh networks. J. Commun. 8(1), 55\u201365 (2013)","journal-title":"J. Commun."},{"key":"696_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.ins.2015.10.030","volume":"330","author":"H Min","year":"2016","unstructured":"Min, H., Ren, L., Lee, L.H.: Model and algorithm for 4PLRP with uncertain delivery time. Inf. Sci. 330, 211\u2013255 (2016)","journal-title":"Inf. Sci."},{"key":"696_CR14","volume-title":"Shortest Path Problem Based on Genetic Algorithms(D)","author":"ZHU Xuezhi","year":"2015","unstructured":"Xuezhi, Z.H.U.: Shortest Path Problem Based on Genetic Algorithms(D). University of Science and Technology of China, HeFei (2015)"},{"key":"696_CR15","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.tre.2015.04.002","volume":"7","author":"J Sun","year":"2015","unstructured":"Sun, J., Liu, H.X.: Stochastic eco-routing in a signalized traffic network. Transp. Res Part C 7, 110\u2013128 (2015)","journal-title":"Transp. Res Part C"},{"issue":"8","key":"696_CR16","doi-asserted-by":"crossref","first-page":"1686","DOI":"10.1109\/TMC.2014.2364846","volume":"14","author":"Q Wang","year":"2015","unstructured":"Wang, Q., Wang, Q.: Restricted epidemic routing in multi-community delay tolerant networks. IEEE Trans. Mobile Comput. 14(8), 1686\u20131697 (2015)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"696_CR17","first-page":"1","volume":"99","author":"X Tan","year":"2015","unstructured":"Tan, X., Yuan, W., Tsang, D.H.: A stochastic shortest path framework for quantifying the value and lifetime of battery energy storage under dynamic pricing. IEEE Trans. Smart Grid 99, 1\u201310 (2015)","journal-title":"IEEE Trans. Smart Grid"},{"key":"696_CR18","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cor.2016.05.002","volume":"74","author":"J Cheng","year":"2016","unstructured":"Cheng, J., Leung, J., Lisser, A.: New reformulations of distributionally robust shortest path problem. Comput. Oper. Res. 74, 196\u2013204 (2016)","journal-title":"Comput. Oper. Res."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0696-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-016-0696-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-016-0696-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T14:51:10Z","timestamp":1601218270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-016-0696-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,28]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["696"],"URL":"https:\/\/doi.org\/10.1007\/s10586-016-0696-0","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,28]]}}}