{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:33Z","timestamp":1742914053367,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662452363"},{"type":"electronic","value":"9783662452370"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45237-0_49","type":"book-chapter","created":{"date-parts":[[2014,10,25]],"date-time":"2014-10-25T10:37:20Z","timestamp":1414233440000},"page":"535-546","source":"Crossref","is-referenced-by-count":6,"title":["Multi\u2013criteria Route Planning in Bus Network"],"prefix":"10.1007","author":[{"given":"Vo Dang","family":"Khoa","sequence":"first","affiliation":[]},{"given":"Tran Vu","family":"Pham","sequence":"additional","affiliation":[]},{"given":"Huynh Tuong","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Tran","family":"Van Hoai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74247-0_3","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.D.: Timetable Information: Models and Algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 67\u201390. Springer, Heidelberg (2007)"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-48318-7_11","volume-title":"Algorithm Engineering","author":"F. Schulz","year":"1999","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 110\u2013123. Springer, Heidelberg (1999)"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-74247-0_13","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schnee, M.: Finding All Attractive Train Connections by Multi-criteria Pareto Search. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 246\u2013263. Springer, Heidelberg (2007)"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2003.12.019","volume":"92","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S., Jacob, R.: Time\u2013dependent networks as models to achieve fast exact time-table queries. Electronic Notes in Theoretical Computer Science\u00a092, 3\u201315 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.entcs.2003.12.024","volume":"92","author":"E. Pyrga","year":"2004","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Towards Realistic Modeling of Timetable Information through the Time\u2013Dependent Approach. Electronic Notes in Theoretical Computer Science\u00a092, 85\u2013103 (2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-68552-4_26","volume-title":"Experimental Algorithms","author":"Y. Disser","year":"2008","unstructured":"Disser, Y., M\u00fcller\u2013Hannemann, M., Schnee, M.: Multi-criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Experimental comparison of shortest path approaches for timetable information. In: 6th Workshop on Algorithm Engineering and Experiments (ALENEX04), pp. 88\u201399. SIAM (2004)","key":"49_CR7"},{"doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. Journal of Experimental Algorithmics (JEA) 12, Article No. 2.4 (2008)","key":"49_CR8","DOI":"10.1145\/1227161.1227166"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"A.J.V. Skriver","year":"2000","unstructured":"Skriver, A.J.V., Andersen, K.A.: A label correcting approach for solving bicriterion shortest path problems. Computers & Operations Research\u00a027, 507\u2013524 (2000)","journal-title":"Computers & Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Beugnies, F., Randriamasy, S.: Martins\u2019 algorithm revisited for multi\u2013objective shortest path problems with a MaxMin cost function. In: 4OR, vol.\u00a04, pp. 47\u201359 (2006)","key":"49_CR10","DOI":"10.1007\/s10288-005-0074-x"},{"unstructured":"Martins, E.Q.V., Santos, J.L.: The labeling algorithm for multicriteria shortest path problem. Departamento de Matematica, Universidade de Coimbra, Portugal (1999)","key":"49_CR11"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","volume":"43","author":"J. Brumbaugh","year":"1989","unstructured":"Brumbaugh, J., Smith: An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research\u00a043, 216\u2013224 (1989)","journal-title":"European Journal of Operational Research"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0377-2217(91)90094-C","volume":"53","author":"J. Mote","year":"1991","unstructured":"Mote, J., Murthy, I., Olson, D.L.: A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research\u00a053, 81\u201392 (1991)","journal-title":"European Journal of Operational Research"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-94-007-4722-7_46","volume":"61","author":"J.M. Paixao","year":"2013","unstructured":"Paixao, J.M., Santos, J.L.: Labeling methods for the general case of the multiobjective shortest path problem\u2013a computational study. Intelligent Systems, Control and Automation: Science and Engineering\u00a061, 489\u2013502 (2013)","journal-title":"Intelligent Systems, Control and Automation: Science and Engineering"},{"unstructured":"Mali, G., Michail, P., Zaroliagis, C.: Faster multiobjective heuristic search in road maps. In: Proceedings ICT, vol.\u00a03, pp. 67\u201372 (2012)","key":"49_CR15"},{"key":"49_CR16","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 connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45237-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T05:07:26Z","timestamp":1559020046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45237-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662452363","9783662452370"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45237-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}