{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T22:32:57Z","timestamp":1718749977856},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,22]],"date-time":"2017-07-22T00:00:00Z","timestamp":1500681600000},"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":["J Sched"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10951-017-0535-z","type":"journal-article","created":{"date-parts":[[2017,7,22]],"date-time":"2017-07-22T09:48:24Z","timestamp":1500716904000},"page":"367-386","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Lunce","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maged","family":"Dessouky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,22]]},"reference":[{"issue":"4","key":"535_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/net.10072","volume":"41","author":"RK Ahuja","year":"2003","unstructured":"Ahuja, R. K., Orlin, J. B., Pallottino, S., & Scutella, M. G. (2003). Dynamic shortest paths minimizing travel times and costs. Networks, 41(4), 197\u2013205.","journal-title":"Networks"},{"issue":"3","key":"535_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H","volume":"29","author":"X Cai","year":"1997","unstructured":"Cai, X., Kloks, T., & Wong, C. K. (1997). Time-varying shortest path problems with constraints. Networks, 29(3), 141\u201350.","journal-title":"Networks"},{"key":"535_CR3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I Chabini","year":"1998","unstructured":"Chabini, I. (1998). Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Research Record: Journal of the Transportation Research Board, 1645, 170\u2013175.","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"issue":"3","key":"535_CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K. L., & Halsey, E. (1966). The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications, 14(3), 493\u2013498.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"(1\u20132) (02\/01)","key":"535_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10107-012-0610-3","volume":"143","author":"F Fischer","year":"2014","unstructured":"Fischer, F., & Helmberg, C. (2014). Dynamic graph generation for the shortest path problem in time expanded networks. Mathematical Programming, 143((1\u20132) (02\/01)), 257\u2013297.","journal-title":"Mathematical Programming"},{"issue":"1","key":"535_CR6","first-page":"1","volume":"1","author":"DE Kaufman","year":"1993","unstructured":"Kaufman, D. E., & Smith, R. L. (1993). Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. Journal of Intelligent Transportation Systems, 1(1), 1\u201311.","journal-title":"Journal of Intelligent Transportation Systems"},{"key":"535_CR7","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1137\/110821111","volume":"52","author":"R Koch","year":"2014","unstructured":"Koch, R., & Nasrabadi, E. (2014). Continuous-time dynamic shortest path problems with negative transit times. SIAM Journal on Control and Optimization, 52, 2449\u20132481.","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"1","key":"535_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/974734.974737","volume":"14","author":"Q Lu","year":"2004","unstructured":"Lu, Q., Dessouky, M. M., & Leachman, R. C. (2004). Modeling train movements through complex rail networks. ACM Transactions on Modeling and Computer Simulation, 14(1), 48\u201375.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"issue":"4","key":"535_CR9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10951-008-0056-x","volume":"11","author":"V Nagarajan","year":"2008","unstructured":"Nagarajan, V., & Ranade, A. G. (2008). Exact train pathing. Journal of Scheduling, 11(4), 279\u2013297.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"535_CR10","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., & Rom, R. (1990). Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37(3), 607\u2013625.","journal-title":"Journal of the ACM"},{"issue":"3","key":"535_CR11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A Orda","year":"1991","unstructured":"Orda, A., & Rom, R. (1991). Minimum weight paths in time-dependent networks. Networks, 21(3), 295\u2013319.","journal-title":"Networks"},{"key":"535_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4615-5757-9_11","volume-title":"Equilibrium and advanced transportation modelling","author":"S Pallottino","year":"1998","unstructured":"Pallottino, S., & Scutella, M. G. (1998). Shortest path algorithms in transportation models: Classical and innovative aspects. In P. Marcotte & S. Nguyen (Eds.), Equilibrium and advanced transportation modelling (pp. 245\u2013281). Berlin: Springer."},{"issue":"2","key":"535_CR13","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/S0363012991196414","volume":"32","author":"AB Philpott","year":"1994","unstructured":"Philpott, A. B. (1994). Continuous-time shortest path problems and linear programming. SIAM Journal on Control and Optimization, 32(2), 538\u2013552.","journal-title":"SIAM Journal on Control and Optimization"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0535-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0535-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0535-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T11:04:30Z","timestamp":1527591870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0535-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,22]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["535"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0535-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,22]]}}}