{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:14:53Z","timestamp":1766733293828},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T00:00:00Z","timestamp":1475712000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11042-016-4015-9","type":"journal-article","created":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T01:28:01Z","timestamp":1475717281000},"page":"19945-19957","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multimedia application to an extended public transportation network in South Korea: optimal path search in a multimodal transit network"],"prefix":"10.1007","volume":"76","author":[{"given":"Yongshin","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekyoung","family":"Youm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,6]]},"reference":[{"issue":"2","key":"4015_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1990) Faster algorithms for the shortest path problem. J Assoc Comput Mach 37(2):213\u2013223","journal-title":"J Assoc Comput Mach"},{"issue":"2","key":"4015_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/1033048","volume":"33","author":"RK Ahuja","year":"1991","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1991) Some recent advances in network flows. SIAM Rev 33(2):175\u2013219","journal-title":"SIAM Rev"},{"key":"4015_CR3","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Inc. Upper Saddle River"},{"issue":"1","key":"4015_CR4","first-page":"70","volume":"1","author":"F Benjamin Zhan","year":"1997","unstructured":"Benjamin Zhan F (1997) Three fastest shortest path algorithms on real road networks: data structures and procedures. J Geogr Inf Decis Anal 1(1):70\u201382","journal-title":"J Geogr Inf Decis Anal"},{"key":"4015_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","volume":"43","author":"J Brumbaugh-Smith","year":"1989","unstructured":"Brumbaugh-Smith J, Shoer D (1989) An empirical investigation of some bicriterion\u2013shortest path algorithms. Eur J Oper Res 43:216\u2013224","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4015_CR6","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1137\/S0097539796313490","volume":"28","author":"BV Cherkassky","year":"1999","unstructured":"Cherkassky BV, Goldberg AV, Silverstein C (1999) Buckets, heaps, lists, and monotone priority queues. SIAM J Comput 28(4):1326\u20131346","journal-title":"SIAM J Comput"},{"issue":"4","key":"4015_CR7","first-page":"167","volume":"16","author":"KJ Choi","year":"1998","unstructured":"Choi KJ, Jang WJ (1998) A model for shortest path calculation on intermodal transportation network. Journal of Korea transportation research. Society 16(4):167\u2013186","journal-title":"Society"},{"issue":"3","key":"4015_CR8","first-page":"233","volume":"26","author":"SH Chun","year":"2008","unstructured":"Chun SH, Shin SI, Lee IY, Lee CJ (2008) A methodology of multimodal public transportation network building and path searching using transportation card data. Journal of Korea transportation research. Society 26(3):233\u2013243","journal-title":"Society"},{"issue":"1","key":"4015_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00938761","volume":"46","author":"HW Corley","year":"1985","unstructured":"Corley HW, Moon ID (1985) Shortest path in networks with vector weights. J Optim Theory Appl 46(1):79\u201386","journal-title":"J Optim Theory Appl"},{"key":"4015_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Mumerische Mathematik 1:269\u2013271","journal-title":"Mumerische Mathematik"},{"issue":"3","key":"4015_CR11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/321765.321768","volume":"20","author":"D Johnson","year":"1973","unstructured":"Johnson D (1973) A note on Dijkstra's shortest path algorithm. J Assoc Comput Mach 20(3):385\u2013388","journal-title":"J Assoc Comput Mach"},{"issue":"5","key":"4015_CR12","first-page":"87","volume":"17","author":"HM Kim","year":"1999","unstructured":"Kim HM, Lim YT, Lee SJ (1999) Development of an integrated network model for mode choice and trip assignment. Journal of Korea transportation research. Society 17(5):87\u201398","journal-title":"Society"},{"issue":"3","key":"4015_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0965-8564(99)00056-7","volume":"35","author":"A Lazano","year":"2001","unstructured":"Lazano A, Storchi G (2001) Shortest viable path algorithm in multimodal networks. Transp Res A Policy Pract 35(3):225\u2013241","journal-title":"Transp Res A Policy Pract"},{"key":"4015_CR14","unstructured":"Lee, M. (2004). Transportation network models and algorithms considering directional delay and prohibition for intersection movement. Ph.D. Dissertation, University of Wisconsin Madison"},{"issue":"1","key":"4015_CR15","first-page":"127","volume":"26","author":"MY Lee","year":"2008","unstructured":"Lee MY, Kim HC, Park DJ, Shin SI (2008) A link-based label correcting multi-objective shortest paths algorithm in multi-modal transit networks. Journal of Korea transportation research. Society 26(1):127\u2013135","journal-title":"Society"},{"issue":"1","key":"4015_CR16","first-page":"1","volume":"4","author":"MY Lee","year":"2005","unstructured":"Lee MY, Baek NC (2005) Finding alternative routes in inter modal transit networks considering constraints. Journal of Korean Society of IT Service 4(1):1\u201313","journal-title":"Journal of Korean Society of IT Service"},{"key":"4015_CR17","first-page":"225","volume":"35","author":"A Lozano","year":"2001","unstructured":"Lozano A, Storchi G (2001) Shortest viable path algorithm in multimodal networks. Transp Res A 35:225\u2013241","journal-title":"Transp Res A"},{"key":"4015_CR18","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 16:236\u2013245","journal-title":"Eur J Oper Res"},{"key":"4015_CR19","first-page":"285","volume-title":"The shortest path through a maze, proceedings of the international symposium on theory of switching","author":"EF Moore","year":"1959","unstructured":"Moore EF (1959) The shortest path through a maze, proceedings of the international symposium on theory of switching, vol 2. MAL Harvard University Press, Cambridge, pp. 285\u2013292"},{"issue":"3","key":"4015_CR20","first-page":"317","volume":"28","author":"SI Shin","year":"2008","unstructured":"Shin SI, Park JJ, Lee JC, Ha TJ (2008) Development of user customized path finding algorithm for public transportation information. Journal of Korean Society of Civil Engineering 28(3):317\u2013323","journal-title":"Journal of Korean Society of Civil Engineering"},{"key":"4015_CR21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"A Skriver","year":"2000","unstructured":"Skriver A, Anderson K (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput Oper Res 27:507\u2013524","journal-title":"Comput Oper Res"},{"key":"4015_CR22","doi-asserted-by":"crossref","unstructured":"Yang, R., S. Zhou, and C. Fan. (2008). A new algorithm for tetwork diameter. The 9th international conference for young computer scientists","DOI":"10.1109\/ICYCS.2008.352"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-016-4015-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-4015-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-4015-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T09:04:27Z","timestamp":1568451867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-016-4015-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,6]]},"references-count":22,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["4015"],"URL":"https:\/\/doi.org\/10.1007\/s11042-016-4015-9","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,6]]}}}