{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:49:39Z","timestamp":1753922979461},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"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":["Int. J. ITS Res."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s13177-024-00406-3","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T06:02:20Z","timestamp":1717999340000},"page":"407-415","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Integrated Model for Traffic Routing Optimization and Train Formation Plan with Yard Capacity Constraints and Demand Uncertainty"],"prefix":"10.1007","volume":"22","author":[{"given":"Shima","family":"Aghaee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Alinaghian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Aghaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"406_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0191-2615(80)90037-5","volume":"14","author":"LD Bodin","year":"1980","unstructured":"Bodin, L.D., Golden, B.L., Schuster, A.D., Romig, W.: A model for the blocking of trains. Transport. Res. B Meth. 14, 115\u2013120 (1980). https:\/\/doi.org\/10.1016\/0191-2615(80)90037-5","journal-title":"Transport. Res. B Meth."},{"key":"406_CR2","doi-asserted-by":"crossref","unstructured":"Assad, A.: Analysis of rail classification policies. INFOR: Information Systems and Operational Research 21, 4:293\u2013314 (1983)","DOI":"10.1080\/03155986.1983.11731905"},{"key":"406_CR3","first-page":"116","volume":"27","author":"CD Dyke","year":"1986","unstructured":"Dyke, C.D.: The automated blocking model: a practical approach to freight railroad blocking plan development. Transp. Res. Forum 27, 116\u2013121 (1986)","journal-title":"Transp. Res. Forum"},{"key":"406_CR4","first-page":"149","volume":"29","author":"CD Dyke","year":"1988","unstructured":"Dyke, C.D.: Dynamic management of railroad blocking plans. Transp. Res. Forum 29, 149\u2013152 (1988)","journal-title":"Transp. Res. Forum"},{"key":"406_CR5","unstructured":"Newton, H.N.: Network design under budget constraints with application to the railroad blocking problem. Auburn University (1996)"},{"key":"406_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/trsc.32.4.330","volume":"32","author":"H Newton","year":"1998","unstructured":"Newton, H., Barnhart, C., Vance, P.: constructing railroad blocking plans to minimize handling costs. Transport. Sci. 32, 330\u2013345 (1998). https:\/\/doi.org\/10.1287\/trsc.32.4.330","journal-title":"Transport. Sci."},{"key":"406_CR7","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/opre.48.4.603.12416","volume":"48","author":"H Barnhart","year":"2000","unstructured":"Barnhart, H., Jin, P.H.V.: Railroad blocking: a network design application. Oper. Res. 48, 603\u2013614 (2000). https:\/\/doi.org\/10.1287\/opre.48.4.603.12416","journal-title":"Oper. Res."},{"key":"406_CR8","doi-asserted-by":"publisher","first-page":"106090","DOI":"10.1016\/j.cie.2019.106090","volume":"137","author":"A Goli","year":"2019","unstructured":"Goli, A., et al.: Hybrid artificial intelligence and robust optimization for a multi-objective product portfolio problem Case study: The dairy products industry. Comput. Ind. Eng. 137, 106090 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"54","key":"406_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/educ.1053.0013","volume":"1","author":"RK Ahuja","year":"2005","unstructured":"Ahuja, R.K., Cunha, C.B., \u015eahin, G.: Network models in railroad planning and scheduling Tutor. Oper. Res. 1(54), 101 (2005). https:\/\/doi.org\/10.1287\/educ.1053.0013","journal-title":"Oper. Res."},{"key":"406_CR10","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1287\/inte.1070.0295","volume":"37","author":"RK Ahuja","year":"2007","unstructured":"Ahuja, R.K., Jha, K.C., Liu, J.: solving real-life railroad blocking problems. Interfaces Provid. 37, 404\u2013419 (2007). https:\/\/doi.org\/10.1287\/inte.1070.0295","journal-title":"Interfaces Provid."},{"key":"406_CR11","doi-asserted-by":"publisher","first-page":"5579","DOI":"10.1016\/j.apm.2011.05.018","volume":"35","author":"M Yaghini","year":"2011","unstructured":"Yaghini, M., Foroughi, A., Nadjari, B.: Solving railroad blocking problem using ant colony optimization algorithm. Appl. Math. Model. 35, 5579\u20135591 (2011). https:\/\/doi.org\/10.1016\/j.apm.2011.05.018","journal-title":"Appl. Math. Model."},{"key":"406_CR12","doi-asserted-by":"publisher","first-page":"6114","DOI":"10.1016\/j.apm.2015.01.052","volume":"39","author":"M Yaghini","year":"2011","unstructured":"Yaghini, M., Momeni, M., Sarmadi, M., Seyedabadi, M., Khoshraftar, M.: A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways. Appl. Math. Model. 39, 6114\u20136125 (2011). https:\/\/doi.org\/10.1016\/j.apm.2015.01.052","journal-title":"Appl. Math. Model."},{"key":"406_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2018.10.003","volume":"118","author":"C Chen","year":"2018","unstructured":"Chen, C., Dollevoet, T., Zhao, J.: One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm. Transportation Research Part B:Methodological 118, 1\u201330 (2018)","journal-title":"Transportation Research Part B:Methodological"},{"issue":"4","key":"406_CR14","doi-asserted-by":"publisher","first-page":"2300","DOI":"10.1016\/j.apm.2012.05.016","volume":"37","author":"M Yaghini","year":"2013","unstructured":"Yaghini, M., Momeni, M., Sarmadi, M.: An improved local branching approach for train formation planning. Appl. Math. Model. 37(4), 2300\u20132307 (2013)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"406_CR15","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.2015.0656","volume":"50","author":"R Bornd\u00f6rfer","year":"2016","unstructured":"Bornd\u00f6rfer, R., Klug, T., Schlechte, T., F\u00fcgenschuh, A., Schang, T., Sch\u00fclldorf, H.: The freight train routing problem for congested railway networks with mixed traffic. Transp. Sci. 50(2), 408\u2013423 (2016)","journal-title":"Transp. Sci."},{"key":"406_CR16","doi-asserted-by":"publisher","first-page":"61992","DOI":"10.1109\/ACCESS.2022.3181815","volume":"10","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Song, R., He, S., Song, Z., Chi, J.: Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach. IEEE Access 10, 61992\u201362010 (2022)","journal-title":"IEEE Access"},{"issue":"4","key":"406_CR17","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MITS.2010.935910","volume":"1","author":"A D'Ariano","year":"2009","unstructured":"D\u2019Ariano, A.: Innovative decision support system for railway traffic control. IEEE Intell. Transp. Syst. Mag. 1(4), 8\u201316 (2009)","journal-title":"IEEE Intell. Transp. Syst. Mag."},{"key":"406_CR18","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.apm.2020.12.031","volume":"93","author":"B Lin","year":"2021","unstructured":"Lin, B., Zhao, Y., Lin, R., Liu, C.: Integrating traffic routing optimization and train formation plan using simulated annealing algorithm. Appl. Math. Model. 93, 811\u2013830 (2021)","journal-title":"Appl. Math. Model."},{"key":"406_CR19","doi-asserted-by":"publisher","unstructured":"Lin, B., Wang, Z., Zhao, Y.: A Train Formation Plan with Elastic Capacity for Large-Scale Rail Networks. arXiv:2111.03473 (2021).\u00a0https:\/\/doi.org\/10.48550\/arXiv.2111.03473","DOI":"10.48550\/arXiv.2111.03473"},{"key":"406_CR20","doi-asserted-by":"publisher","unstructured":"Lin, B.: Integrating car path optimization with train formation plan: A non-linear binary programming model and simulated annealing based heuristics. arXiv:1707.08326 (2017).\u00a0https:\/\/doi.org\/10.48550\/arXiv.1707.08326","DOI":"10.48550\/arXiv.1707.08326"},{"key":"406_CR21","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1002\/atr.1183","volume":"48","author":"M Yaghini","year":"2014","unstructured":"Yaghini, M., Momeni, M., Sarmadi, M.: Solving train formation problem using simulated annealing algorithm in a simplex framework. J. Adv. Transport. 48, 402\u2013416 (2014). https:\/\/doi.org\/10.1002\/atr.1183","journal-title":"J. Adv. Transport."},{"key":"406_CR22","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.cie.2017.02.014","volume":"106","author":"R Hasany","year":"2017","unstructured":"Hasany, R., Shafahi, Y.: Two-stage stochastic programming for the railroad blocking problem with uncertain demand and supply resources. Comput. Ind. Eng. 106, 275\u2013286 (2017). https:\/\/doi.org\/10.1016\/j.cie.2017.02.014","journal-title":"Comput. Ind. Eng."},{"key":"406_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.cie.2017.02.014","volume":"106","author":"R Hasany","year":"2017","unstructured":"Hasany, R., Shafahi, Y.: Two-stage stochastic programming for the railroad blocking problem with uncertain demand and supply resources. Comput. Ind. Eng. 106, 275\u2013286 (2017). https:\/\/doi.org\/10.1016\/j.cie.2017.02.014","journal-title":"Comput. Ind. Eng."},{"key":"406_CR24","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.asoc.2015.02.039","volume":"31","author":"M Yaghini","year":"2015","unstructured":"Yaghini, M., Momeni, M., Sarmadi, M.: A hybrid solution method for fuzzy train formation planning. Appl. Soft Comput. 31, 257\u2013265 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"406_CR25","doi-asserted-by":"publisher","first-page":"5022","DOI":"10.3390\/su15065022","volume":"15","author":"M Noruzi","year":"2023","unstructured":"Noruzi, M., et al.: A Robust Optimization Model for Multi-Period Railway Network Design Problem Considering Economic Aspects and Environmental Impact. Sustainability 15(6), 5022 (2023)","journal-title":"Sustainability"},{"key":"406_CR26","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.trb.2011.12.003","volume":"46","author":"BL Lin","year":"2012","unstructured":"Lin, B.L., Wang, Z.M., Ji, L.J., Tian, Y.M., Zhou, G.Q.: Optimizing the freight train connection service network of a large-scale rail system. Transport. Res. B Meth. 46, 649\u2013667 (2012). https:\/\/doi.org\/10.1016\/j.trb.2011.12.003","journal-title":"Transport. Res. B Meth."},{"key":"406_CR27","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.trb.2011.12.003","volume":"46","author":"BL Lin","year":"2012","unstructured":"Lin, B.L., Wang, Z.M., Ji, L.J., Tian, Y.M., Zhou, G.Q.: Optimizing the freight train connection service network of a large-scale rail system. Transport. Res. B Meth. 46, 649\u2013667 (2012). https:\/\/doi.org\/10.1016\/j.trb.2011.12.003","journal-title":"Transport. Res. B Meth."}],"container-title":["International Journal of Intelligent Transportation Systems Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13177-024-00406-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13177-024-00406-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13177-024-00406-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:44:43Z","timestamp":1723013083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13177-024-00406-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s13177-024-00406-3","relation":{},"ISSN":["1348-8503","1868-8659"],"issn-type":[{"type":"print","value":"1348-8503"},{"type":"electronic","value":"1868-8659"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"22 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants and animals.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}