{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:40:34Z","timestamp":1738777234404,"version":"3.37.0"},"reference-count":19,"publisher":"Academy Publisher","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.9.5.1333-1338","type":"journal-article","created":{"date-parts":[[2014,5,9]],"date-time":"2014-05-09T01:14:02Z","timestamp":1399598042000},"source":"Crossref","is-referenced-by-count":0,"title":["Multi-granularity-based Routing Algorithm for Dynamic Networks"],"prefix":"10.4304","volume":"9","author":[{"given":"Fu-gui","family":"He","sequence":"first","affiliation":[]},{"given":"Yan-ping","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiancun","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Renjin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"2838","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"issue":"No. 12","key":"ref1","doi-asserted-by":"crossref","first-page":"2797","DOI":"10.4304\/jnw.8.12.2797-2803","article-title":"All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model","volume":"8","author":"Wu","year":"2013","unstructured":"[1] Q. Wu, C. Tong, Q. Wang, et al. \"All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model\". Journal of Networks, Vol. 8, No. 12, pp. 2797-2803, 2013.","journal-title":"Journal of Networks"},{"issue":"No. 12","key":"ref2","doi-asserted-by":"crossref","first-page":"1496","DOI":"10.4304\/jnw.5.12.1496-1504","article-title":"An Optimized Floyd Algorithm for the Shortest Path Problem","volume":"5","author":"Wei","year":"2010","unstructured":"[2] D. Wei. \"An Optimized Floyd Algorithm for the Shortest Path Problem\". Journal of Networks, Vol. 5, No. 12, pp. 1496-1504, 2010.","journal-title":"Journal of Networks"},{"issue":"no. 1","key":"ref3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/TITS.2006.889437","article-title":"Reliable pretrip multi-path planning and dynamic adaptation for a centralized road navigation system","volume":"8","author":"Chen","year":"2007","unstructured":"[3] Y. Y. Chen, M. G. H. Bell, and K. Bogenberger, \"Reliable pretrip multi-path planning and dynamic adaptation for a centralized road navigation system,\" IEEE Trans. Intell. Transp. Syst., vol. 8, no. 1, pp. 14\u201320, Mar. 2007.","journal-title":"IEEE Trans Intell Transp Syst","ISSN":"https:\/\/id.crossref.org\/issn\/1524-9050","issn-type":"print"},{"issue":"no. 1","key":"ref4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/34.982887","article-title":"Multi-hierarchical graph search","volume":"24","author":"Fern\u00e1ndez-Madrigal","year":"2002","unstructured":"[4] J. -A. Fern\u00e1ndez-Madrigal and J. Gonz\u00e1lez, \"Multi-hierarchical graph search,\" IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 1, pp. 103\u2013113, Jan. 2002.","journal-title":"IEEE Trans Pattern Anal Mach Intell","ISSN":"https:\/\/id.crossref.org\/issn\/0162-8828","issn-type":"print"},{"key":"ref5","first-page":"380","article-title":"Intelligent route \ufb01nding: combining knowledge, cases and an ef\ufb01cient search algorithm","volume-title":"Proc 12th Int Conf Arti\ufb01cial Intelligence","author":"Liu","year":"1996","unstructured":"[5] B. Liu. \"Intelligent route \ufb01nding: combining knowledge, cases and an ef\ufb01cient search algorithm\". Proc. 12th Int. Conf. Arti\ufb01cial Intelligence, 1996, pp. 380\u2013384."},{"issue":"No. 3","key":"ref6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/69.687976","article-title":"Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation","volume":"10","author":"Jing","year":"1998","unstructured":"[6] N. Jing, Y. Huang, E. A. Rundensteiner. \"Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation\", IEEE Trans. Knowl. Data Eng., Vol. 10, No. 3, pp. 409\u2013432, 1998.","journal-title":"IEEE Trans Knowl Data Eng","ISSN":"https:\/\/id.crossref.org\/issn\/1041-4347","issn-type":"print"},{"issue":"No. 5","key":"ref7","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","article-title":"An ef\ufb01cient path computation model for hierarchically structured topographical road maps","volume":"14","author":"Jung","year":"2002","unstructured":"[7] S. Jung, S. Pramanik. \"An ef\ufb01cient path computation model for hierarchically structured topographical road maps\", IEEE Trans. Knowl. Data Eng., Vol. 14, No. 5, pp. 1029\u20131046, 2002.","journal-title":"IEEE Trans Knowl Data Eng","ISSN":"https:\/\/id.crossref.org\/issn\/1041-4347","issn-type":"print"},{"key":"ref8","first-page":"94","article-title":"Materialization trade-offs in hierarchical shortest path algorithms","volume-title":"Proc 5th Int Symp Advances in Spatial Databases","author":"Shenhar","year":"1997","unstructured":"[9] S. Shenhar, A. Fetterer, B. Goyal. \"Materialization trade-offs in hierarchical shortest path algorithms\". Proc. 5th Int. Symp. Advances in Spatial Databases, 1997, pp. 94\u2013111."},{"key":"ref9","first-page":"646","article-title":"General principles of hierarchical spatial reasoning \u2013 the case of way\ufb01nding","volume-title":"Proc 6th Int Symp Spatial Data Handling","volume":"2","author":"Car","year":"1994","unstructured":"[10] A. Car, A. U. Frank. \"General principles of hierarchical spatial reasoning \u2013 the case of way\ufb01nding\". Proc. 6th Int. Symp. Spatial Data Handling, 1994, vol. 2, pp. 646\u2013664."},{"key":"ref10","first-page":"380","article-title":"Intelligent route \ufb01nding: combining knowledge, cases and an ef\ufb01cient search algorithm","volume-title":"Proc 12th Int conf Arti\ufb01cial Intelligence","author":"Liu","year":"1996","unstructured":"[11] B. Liu. \"Intelligent route \ufb01nding: combining knowledge, cases and an ef\ufb01cient search algorithm\". Proc. 12th Int. conf. Arti\ufb01cial Intelligence, 1996, pp. 380\u2013384."},{"key":"ref11","first-page":"283","article-title":"Path planning and evaluation in IVHS databases","volume-title":"Proc IEEE Vehicle Navigation and Information Systems Conf","author":"Yang","year":"1991","unstructured":"[12] T. A. Yang, S. Shekhar, B. Hamidzadeh, et al. \"Path planning and evaluation in IVHS databases\". Proc. IEEE Vehicle Navigation and Information Systems Conf., 1991, pp. 283\u2013290."},{"key":"ref12","first-page":"112","article-title":"Improving hierarchical route computations for roadway networks","volume-title":"Proc IEEE IntelligentTransportation Systems Conf","author":"Quek","year":"2001","unstructured":"[14] K. H. Quek, T. Srikanthan. \"Improving hierarchical route computations for roadway networks\". Proc. IEEE IntelligentTransportation Systems Conf., 2001, pp. 112\u2013117."},{"key":"ref13","volume-title":"Theory and Applications of Problem Solving-- the Quotient Space granular computation theory and Application","author":"Zhang","year":"2007","unstructured":"[17] L. Zhang and B. Zhang. \"Theory and Applications of Problem Solving-- the Quotient Space granular computation theory and Application\" 2rd ed., Tsinghua University Press, Beijing, 2007."},{"issue":"No. 2","key":"ref14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1504\/IJGCRSIS.2009.028008","article-title":"The theory and application of tolerance relations","volume":"1","author":"Zhang","year":"2009","unstructured":"[18] L. Zhang and B. Zhang. \"The theory and application of tolerance relations\". International Journal of Granular Computing, Rough Sets and Intelligent Systems. Vol. 1, No. 2, pp. 179-189, 2009.","journal-title":"International Journal of Granular Computing Rough Sets and Intelligent Systems"},{"issue":"No. 2","key":"ref15","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","unstructured":"[19] P. E. Hart, N. J. Nilsson and B. Raphael. \"A formal basis for the heuristic determination of minimum cost paths\". IEEE Transactions on System Science and Cybernetics, Vol. 4, No. 2, pp. 100\u2013107, 1968.","journal-title":"IEEE Transactions on System Science and Cybernetics"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","unstructured":"[20] M. E. J. Newman and M. Girvan. \"Finding and evaluating community structure in networks\", Physical review E, vol. 69, p. 026113, 2004.","journal-title":"Phys Rev E Stat Nonlin Soft Matter Phys","ISSN":"https:\/\/id.crossref.org\/issn\/1539-3755","issn-type":"print"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","unstructured":"[21] V. D. Blondel, J. L. Guillaume, R. Lambiotte, and et al. \"Fast unfolding of communities in large networks\". Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, p. P10008, 2008.","journal-title":"J Stat Mech","ISSN":"https:\/\/id.crossref.org\/issn\/1742-5468","issn-type":"print"},{"key":"ref18","article-title":"Core Routing on Dynamic Time-Dependent Road Networks","author":"Delling","year":"2011","unstructured":"[22] D. Delling and G. Nannicini, \"Core Routing on Dynamic Time-Dependent Road Networks\", INFORMS Journal on Computing, 2011.","journal-title":"INFORMS J Comput","ISSN":"https:\/\/id.crossref.org\/issn\/1091-9856","issn-type":"print"},{"key":"ref19","first-page":"334","volume-title":"Bidirectional A* search for time-dependent fast paths","author":"Nannicini","year":"2008","unstructured":"[23] G. Nannicini, D. Delling, L. Liberti, and D. Schultes, \"Bidirectional A* search for time-dependent fast paths\", Experimental Algorithms, pp. 334-346, 2008."}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:06:15Z","timestamp":1738775175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,8]]},"references-count":19,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2014,5,8]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.9.5.1333-1338","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2014,5,8]]}}}