{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:19:41Z","timestamp":1773681581413,"version":"3.50.1"},"reference-count":63,"publisher":"American Society of Civil Engineers (ASCE)","issue":"5","content-domain":{"domain":["ascelibrary.org"],"crossmark-restriction":true},"short-container-title":["J. Comput. Civ. Eng."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1061\/(asce)cp.1943-5487.0000675","type":"journal-article","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T14:02:38Z","timestamp":1491832958000},"update-policy":"https:\/\/doi.org\/10.1061\/do.news.20190416.0001","source":"Crossref","is-referenced-by-count":5,"title":["Bounding Box Approach to Network Pruning for Efficient Path Search through Large Networks"],"prefix":"10.1061","volume":"31","author":[{"given":"Xi","family":"Zhou","sequence":"first","affiliation":[{"name":"Transportation\/Traffic Engineer, CH2M HILL, Inc., 15010 Conference Center Dr., Suite 200, Chantilly, VA 20151."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Venigalla","sequence":"additional","affiliation":[{"name":"Associate Professor, George Mason Univ., Fairfax, VA 22030 (corresponding author)."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanjiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Assistant Professor, George Mason Univ., Fairfax, VA 22030."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"30","reference":[{"key":"e_1_3_2_2_1","unstructured":"ArcGIS [Computer software]. Environmental Systems Research Institute Redlands CA."},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77615"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2013.01.006"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_6_1","unstructured":"Bernstein D. and Kornhauser A. (1996). \u201cAn introduction to map-matching for personal navigation assistants.\u201d Princeton Univ. Princeton NJ."},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/01441640802078673"},{"key":"e_1_3_2_8_1","unstructured":"Car A. and Frank A. U. (1993). \u201cHierarchical street networks as a conceptual model for efficient way finding.\u201d Proc. 4th European Conf. and Exhibition on Geographical Information Systems EGIS Foundation Utrecht Netherlands."},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.862"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-008-0236-7"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.10.2.163"},{"key":"e_1_3_2_12_1","volume-title":"Introduction to algorithms","author":"Cormen H. T.","year":"1990"},{"key":"e_1_3_2_13_1","unstructured":"Daniel J. and Delgrossi L. (2008). \u201cIEEE 802.11 p: Towards an international standard for wireless access in vehicular environments.\u201d Vehicular Technology Conf. IEEE New York."},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.2.187"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0968-090X(03)00031-7"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2012.01.009"},{"issue":"11","key":"e_1_3_2_17_1","first-page":"632","article-title":"Algorithm 360: Shortest path forest with topological ordering","volume":"12","author":"Dial R. B.","year":"1969","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2008.07.003"},{"key":"e_1_3_2_20_1","unstructured":"Ford L. R. (1956). \u201cNetwork flow theory.\u201d Rep. P-923 Rand Corporation Santa Monica CA."},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.027"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288320"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2011.08.003"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140103"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.1.65"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2013.04.005"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2002.806806"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786986"},{"key":"e_1_3_2_31_1","doi-asserted-by":"crossref","unstructured":"Johnson E. L. (1972). \u201cShortest path on sorting.\u201d Proc. 25th ACM Annual Conf. Association for Computing Machinery New York 510\u2013517.","DOI":"10.1145\/800193.569965"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"issue":"2","key":"e_1_3_2_33_1","first-page":"111","article-title":"Real-time optimal route computation: A heuristic approach","volume":"3","author":"Karimi H. A.","year":"1996","journal-title":"ITS J."},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37110-6_12"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0968-090X(94)90008-6"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0968-090X(02)00023-2"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2007.912927"},{"key":"e_1_3_2_38_1","unstructured":"Liu B. (1996). \u201cIntelligent route finding: Combining knowledge cases and an efficient search algorithm.\u201d Proc. 12th Int. Conf. on Artificial Intelligence Cases and an Efficient Search Algorithm Association for Computing Machinery New York 380\u2013384."},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/3468.594911"},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2011.10.004"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2011.10.006"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00152-3"},{"key":"e_1_3_2_43_1","unstructured":"Moore E. F. (1957). \u201cThe shortest path through a maze.\u201d Proc. Int. Symp. on Theory of Switching Bell Telephone System New Haven CT 285\u2013292."},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.03.029"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2012.07.005"},{"key":"e_1_3_2_46_1","volume-title":"Problem-solving methods in artificial intelligence","author":"Nilsson J. N.","year":"1971"},{"key":"e_1_3_2_47_1","unstructured":"Pallottino S. (1979). \u201cAdapting the algorithm to D\u2019Esopo-Pape for the determination of all shortest paths: Improvements and simplifications.\u201d Technical Rep. 136 Centre de Recherchesur les Transports Univ. de Montreal Montreal."},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140206"},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585517"},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/355900.355919"},{"key":"e_1_3_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/357456.357466"},{"key":"e_1_3_2_52_1","volume-title":"Heuristics: Intelligent search strategies for computer problem solving","author":"Pearl J.","year":"1984"},{"key":"e_1_3_2_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2011.12.007"},{"key":"e_1_3_2_54_1","first-page":"127","article-title":"Bi-directional search","volume":"6","author":"Pohl I.","year":"1971","journal-title":"Mach. Intell."},{"key":"e_1_3_2_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.02.017"},{"key":"e_1_3_2_56_1","doi-asserted-by":"publisher","DOI":"10.1080\/15472450600793560"},{"key":"e_1_3_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2007.05.002"},{"key":"e_1_3_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840435"},{"key":"e_1_3_2_59_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)UP.1943-5444.0000364"},{"key":"e_1_3_2_60_1","doi-asserted-by":"crossref","unstructured":"Wagner D. and Willhalm T. (2003). \u201cGeometric speed-up techniques for finding shortest paths in large sparse graphs.\u201d Proc. 11th European Symp. on Algorithms Springer New York 776\u2013787.","DOI":"10.1007\/978-3-540-39658-1_69"},{"key":"e_1_3_2_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0968-090X(00)00026-7"},{"issue":"6","key":"e_1_3_2_62_1","first-page":"347","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams J. W. J.","year":"1964","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"e_1_3_2_63_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.65"},{"key":"e_1_3_2_64_1","unstructured":"Zhou X. (2014). \u201cRevealed path choice behavior and network pruning for efficient path finding.\u201d Ph.D. thesis George Mason Univ. Fairfax VA."}],"container-title":["Journal of Computing in Civil Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ascelibrary.org\/doi\/pdf\/10.1061\/%28ASCE%29CP.1943-5487.0000675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:35:55Z","timestamp":1654821355000},"score":1,"resource":{"primary":{"URL":"https:\/\/ascelibrary.org\/doi\/10.1061\/%28ASCE%29CP.1943-5487.0000675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":63,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1061\/(ASCE)CP.1943-5487.0000675"],"URL":"https:\/\/doi.org\/10.1061\/(asce)cp.1943-5487.0000675","relation":{},"ISSN":["0887-3801","1943-5487"],"issn-type":[{"value":"0887-3801","type":"print"},{"value":"1943-5487","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"2016-03-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-27","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-04-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"04017033"}}