{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T02:08:08Z","timestamp":1774404488390,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T00:00:00Z","timestamp":1622764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T00:00:00Z","timestamp":1622764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11590-021-01761-w","type":"journal-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T14:02:55Z","timestamp":1622815375000},"page":"2577-2595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The single train shortest route problem in a railyard"],"prefix":"10.1007","volume":"15","author":[{"given":"Mina","family":"Aliakbari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5613-8146","authenticated-orcid":false,"given":"Joseph","family":"Geunes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6862-3843","authenticated-orcid":false,"given":"Kelly M.","family":"Sullivan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,4]]},"reference":[{"issue":"1\u20132","key":"1761_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0191-2615(80)90037-5","volume":"14","author":"L Bodin","year":"1980","unstructured":"Bodin, L., Golden, B., Schuster, A., Romig, W.: A model for the blocking of trains. Transp. Res. Part B 14(1\u20132), 115\u2013120 (1980)","journal-title":"Transp. Res. Part B"},{"issue":"4","key":"1761_CR2","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/trsc.32.4.380","volume":"32","author":"J Cordeau","year":"1998","unstructured":"Cordeau, J., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transp. Sci. 32(4), 380\u2013408 (1998)","journal-title":"Transp. Sci."},{"issue":"2","key":"1761_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0191-2607(83)90063-8","volume":"17","author":"C Daganzo","year":"1983","unstructured":"Daganzo, C., Dowling, R., Hall, R.: Railroad classification yard throughput: the case of multistage triangular sorting. Transp. Res. Part A 17(2), 95\u2013106 (1983)","journal-title":"Transp. Res. Part A"},{"issue":"1","key":"1761_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"1761_CR5","unstructured":"Enayaty Ahangar, N., Sullivan, K., Spanton, S., Wang, Y.: Algorithms and Complexity Results for the Single-Cut Routing Problem in a Rail Yard. Working Paper, University of Arkansas, Fayetteville, AR. https:\/\/industrial-engineering.uark.edu\/_resources\/scrp-20210603.pdf (2021)"},{"issue":"1","key":"1761_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M Fredman","year":"1976","unstructured":"Fredman, M.: New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5(1), 83\u201389 (1976)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1761_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/28869.28874","volume":"34","author":"M Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 569\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"1","key":"1761_CR8","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1002\/net.20195","volume":"51","author":"K Jha","year":"2008","unstructured":"Jha, K., Ahuja, R., \u015eahin, G.: New approaches for solving the block-to-train assignment problem. Networks 51(1), 48\u201362 (2008)","journal-title":"Networks"},{"issue":"2","key":"1761_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10951-017-0526-0","volume":"21","author":"J Lange","year":"2018","unstructured":"Lange, J., Werner, F.: Approaches to modelling train scheduling problems as job-shop problems with blocking constraints. J. Sched. 21(2), 191\u2013207 (2018)","journal-title":"J. Sched."},{"issue":"1","key":"1761_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/trsc.11.1.37","volume":"11","author":"E Petersen","year":"1977","unstructured":"Petersen, E.: Railyard modeling: part I. Prediction of put-through time. Transp. Sci. 11(1), 37\u201349 (1977)","journal-title":"Transp. Sci."},{"issue":"4","key":"1761_CR11","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s00291-008-0140-9","volume":"31","author":"J Riezebos","year":"2009","unstructured":"Riezebos, J., Wezel, W.: k-shortest routing of trains on shunting yards. OR Spectr. 31(4), 745\u2013758 (2009)","journal-title":"OR Spectr."},{"key":"1761_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.trb.2016.01.005","volume":"85","author":"M Sama","year":"2016","unstructured":"Sama, M., Pellegrini, P., D\u2019Ariano, A., Rodriguez, J., Pacciarelli, D.: Ant colony optimization for the real-time train routing selection problem. Transp. Res. Part B 85, 89\u2013108 (2016)","journal-title":"Transp. Res. Part B"},{"issue":"2","key":"1761_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/trsc.16.2.207","volume":"16","author":"M Turnquist","year":"1982","unstructured":"Turnquist, M., Daskin, M.: Queuing models of classification and connection delay in railyards. Transp. Sci. 16(2), 207\u2013230 (1982)","journal-title":"Transp. Sci."},{"issue":"3","key":"1761_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1287\/trsc.30.3.181","volume":"30","author":"P Zwaneveld","year":"1996","unstructured":"Zwaneveld, P., Kroon, L., Romeijn, H., Salomon, M.: Routing trains through railway stations: model formulation and algorithms. Transp. Sci. 30(3), 181\u2013194 (1996)","journal-title":"Transp. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01761-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01761-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01761-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:32:49Z","timestamp":1632447169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01761-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,4]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1761"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01761-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,4]]},"assertion":[{"value":"15 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}