{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:35:16Z","timestamp":1745469316559,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353796"},{"type":"electronic","value":"9783642353802"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35380-2_21","type":"book-chapter","created":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T00:00:04Z","timestamp":1355529604000},"page":"169-180","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Dynamic Routing on Large Road Networks"],"prefix":"10.1007","author":[{"given":"Mohanasuram","family":"Geetha","sequence":"first","affiliation":[]},{"given":"G. M. Kadhar Nawaz","family":"Gulammohien","sequence":"additional","affiliation":[]},{"given":"S.","family":"Saravanan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math.\u00a01(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-72845-0_2","volume-title":"Experimental Algorithms","author":"P. Sanders","year":"2007","unstructured":"Sanders, P., Schultes, D.: Engineering Fast Route Planning Algorithms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 23\u201336. Springer, Heidelberg (2007)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Song, Q., Wang, X.: Efficient Routing on Large Road Networks using Hierarchical communities. IEEE Transactions on Intelligent Transportation Systems\u00a012(1) (March 2011)","DOI":"10.1109\/TITS.2010.2072503"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TITS.2006.889437","volume":"8","author":"Y.Y. Chen","year":"2007","unstructured":"Chen, Y.Y., Bell, M.G.H., Bogenberger, K.: Reliable pretrip multi-path planning and dynamic adaptation for a centralized road navigation system. IEEE Trans. Intell. Transp. Syst.\u00a08(1), 14\u201320 (2007)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Salehinejad, H., Talebi, S.: Dynamic fuzzy logic-ant colony system-based route selection system. Applied Computational Intelligent and Soft Computing\u00a02010, Article ID 428270, 13 pages (2010)","DOI":"10.1155\/2010\/428270"},{"issue":"3-5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep.\u00a0486(3-5), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1103\/RevModPhys.42.271","volume":"42","author":"J.W. Essam","year":"1970","unstructured":"Essam, J.W., Fisher, M.E.: Some basic definitions in graph theory. Rev. Mod. Phys.\u00a042(2), 271\u2013288 (1970)","journal-title":"Rev. Mod. Phys."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.\u00a02008(10), P10 008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"21_CR9","unstructured":"Mirabedini, S.J., Teshnehlab, M., Shenasa, M.H., Movaghar, A., Rahmani, A.M.: AFAR: adaptive fuzzy ant-based routing for communication networks. Journal of Zhejiang University Science A (2008) ISSN 1673-565X (print): ISSN 1862-1775"},{"key":"21_CR10","unstructured":"Sim, K.M., Sun, W.H.: Multiple Ant-Colony Optimization for Network routing. In: Proc. Ist Int. Symp. on Cyber Worlds, pp. 277\u2013281 (2002)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Akon, M.M., Goswami, D., Jyoti, S.A.: Routing in Telecommunication network with controlled Ant Population. In: Proc. Ist IEEE Consumer Communication and Netorking Conf., pp. 665\u2013667 (2004)","DOI":"10.1109\/CCNC.2004.1286949"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35380-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T18:45:33Z","timestamp":1745433933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35380-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353796","9783642353802"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35380-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}