{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:54:29Z","timestamp":1742925269877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232034"},{"type":"electronic","value":"9783319232041"}],"license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-23204-1_34","type":"book-chapter","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T15:12:25Z","timestamp":1440774745000},"page":"339-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding Shortest Path and Transit Nodes in Public Transportation System"],"prefix":"10.1007","author":[{"given":"Myat Thu","family":"Zar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myint Myint","family":"Sein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1109\/TITS.2011.2181501","volume":"13","author":"Lilian S. C. Pun-Cheng","year":"2012","unstructured":"Pun-Cheng, L.S.C.: An interactive web based public transport enquiry system with real time optimal route computation. IEEE Transactions on Intelligent Transportation Systems 13(2) (June 2012)","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Transactions on Intelligent Transportation Systems 13(2) (June 2012)","DOI":"10.1109\/TITS.2012.2229914"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Pucher, J., Korattyswaroopam, N.: Rutgers University Neenu Ittyerah. The Crisis of Public Transport in India: Overwhelming Needs but Limited Resources 7(3) (2004)","DOI":"10.5038\/2375-0901.7.3.5"},{"key":"34_CR4","unstructured":"Samet, H.: University of Maryland,USA. Database and Geographical Information System (GIS) (2002)"},{"key":"34_CR5","unstructured":"Liu, C.-L., Pai, T.-W., Chang, C.-T., Hsieh, C.-M.: Path-Planning Algorithms for Public Transportation Systems. In: The 4th International IEEE Conference on Intelligent Transportation System, USA (August 2001)"},{"key":"34_CR6","unstructured":"Dai, L.: Fast Shortest Path Algorithm for Road Network and Implementation. Carleton University if Computer"},{"key":"#cr-split#-34_CR7.1","unstructured":"Science COMP 4905 HONOURS PROJECT Fall Term (2005)"},{"key":"#cr-split#-34_CR7.2","unstructured":"Subadra, N., Bhagavan Das, M., Rama Seshagiri Rao, C.: Directed Graph Algorithms for Tours-A Case Study. Scholarlink Research Institute Journals (2011) (ISSN: 2141-7016)"},{"key":"34_CR8","unstructured":"Abhishek, G., Prateek, M., Rishabh, L., Ms, N.S.: Path Finding: A* or DIJKSTRA\u2019S? IJITE 2(1) (January 2013)"},{"key":"34_CR9","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path:A_ Search Meets Graph Theory, Technical Report MSR-TR-2004\u201324"},{"key":"34_CR10","unstructured":"Sebastian, K., Peter, S., Dominik, S., Frank, S.: Fast Computation of Distance Tables using Highway Hierarchies (July 25, 2006)"},{"key":"34_CR11","unstructured":"http:\/\/wiki.openstreetmap.org\/wiki\/Offline_Openstreetmap"},{"key":"34_CR12","unstructured":"http:\/\/gis.stackexchange.com\/questions\/28593\/what-is-the-difference-between-geocoding-and-georeferencing"},{"key":"34_CR13","unstructured":"Bast, H., Funke, S., Matijievic, D.: Transit ultrafast shortest-path queries with linear-time preprocessing. In: 9th DIMACS Implementation Challenge (2006)"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest path queires in road networks. In: Proc. 9th Workshop on Algorithm Engineering and Experimentation (ALENEX) (2007)","DOI":"10.1137\/1.9781611972870.5"}],"container-title":["Advances in Intelligent Systems and Computing","Genetic and Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23204-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T14:34:34Z","timestamp":1674570874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23204-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"ISBN":["9783319232034","9783319232041"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23204-1_34","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,8,29]]},"assertion":[{"value":"29 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}