{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T02:08:06Z","timestamp":1774404486124,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"vor","delay-in-days":71,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Public Transp"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Train unit scheduling assigns vehicles to cover all trips of a fixed timetable satisfying constraints such as seat demands. With a two-phase approach, this problem is first solved in Phase I as an integer multi-commodity flow problem. Train stations are simplified as single points and coupling orders of train units are left undetermined. In this paper, platforms and their layouts at the stations are restored to complete a fully operable schedule, defined as Phase II. An adaptive approach expanding Phase I to Phase II is proposed. The logistics of (de-)coupling operations, coupling orders and re-platforming are determined in detail to prevent unit blockage where possible, particularly focusing on developing a schedule with conflict-free coupling orders. If unresolvable station level conflicts still exist, the process loops back to Phase I with addressed Phase II constraints to avoid identified conflicts. Thus, the schedule is iteratively improved until it is fully operable.<\/jats:p>","DOI":"10.1007\/s12469-022-00295-3","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T06:03:01Z","timestamp":1652248981000},"page":"27-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Resolution of coupling order and station level constraints in train unit scheduling"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1395-5554","authenticated-orcid":false,"given":"Li","family":"Lei","sequence":"first","affiliation":[]},{"given":"Raymond S K","family":"Kwan","sequence":"additional","affiliation":[]},{"given":"Zhiyuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Pedro J","family":"Copado-Mendez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"issue":"1","key":"295_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E Balas","year":"1972","unstructured":"Balas E, Jeroslow R (1972) Canonical cuts on the unit hypercube. SIAM J Appl Math 23(1):61\u201369","journal-title":"SIAM J Appl Math"},{"issue":"1\u20132","key":"295_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-010-0361-y","volume":"124","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani V, Caprara A, Toth P (2010) Solving a real-world train-unit assignment problem. Math Program 124(1\u20132):207\u2013231","journal-title":"Math Program"},{"issue":"1","key":"295_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.orl.2012.11.007","volume":"41","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani V, Caprara A, Mar\u00f3ti G, Toth P (2013a) On integer polytopes with few nonzero vertices. Oper Res Lett 41(1):74\u201377","journal-title":"Oper Res Lett"},{"issue":"12","key":"295_CR4","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1016\/j.dam.2011.10.035","volume":"161","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani V, Caprara A, Toth P (2013b) A Lagrangian heuristic for a train-unit assignment problem. Discrete Appl Math 161(12):1707\u20131718","journal-title":"Discrete Appl Math"},{"key":"295_CR5","unstructured":"Copado-Mendez P, Lin Z, Kwan R (2017) Size limited iterative method (SLIM) for train unit scheduling. In: Proceedings of the 12th Metaheuristics International Conference, Barcelona, Spain"},{"issue":"2","key":"295_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1287\/trsc.1030.0076","volume":"39","author":"R Freling","year":"2005","unstructured":"Freling R, Lentink RM, Kroon LG, Huisman D (2005) Shunting of passenger train units in a railway station. Transport Sci 39(2):261\u2013272","journal-title":"Transport Sci"},{"issue":"2","key":"295_CR7","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ejor.2016.10.053","volume":"259","author":"J Haahr","year":"2017","unstructured":"Haahr J, Lusby RM (2017) Integrating rolling stock scheduling with train unit shunting. Eur J Oper Res 259(2):452\u2013468","journal-title":"Eur J Oper Res"},{"issue":"4","key":"295_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1111\/j.1467-9574.2005.00303.x","volume":"59","author":"D Huisman","year":"2005","unstructured":"Huisman D, Kroon LG, Lentink RM, Vromans MJCM (2005) Operations research in passenger railway transportation. Stat Neerl 59(4):467\u2013497","journal-title":"Stat Neerl"},{"issue":"4","key":"295_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1287\/trsc.1080.0243","volume":"42","author":"LG Kroon","year":"2008","unstructured":"Kroon LG, Lentink RM, Schrijver A (2008) Shunting of passenger train units: an integrated approach. Transp Sci 42(4):436\u2013449","journal-title":"Transp Sci"},{"key":"295_CR10","unstructured":"Kwan RSK, Lin Z, Copado-Mendez PJ, Lei L (2017) Multi-commodity flow and station logistics resolution for train unit scheduling. In: Proceedings of the 8th multidisciplinary international conference on scheduling: theory and applications, MISTA, pp 321\u2013324"},{"key":"295_CR11","unstructured":"Lei L, Kwan RSK, Lin Z, Copado-Mendez PJ (2017) Station level refinement of train unit network flow schedules. In: 8th International Conference on Computational Logistics, Southampton, UK"},{"key":"295_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.endm.2013.05.089","volume":"41","author":"Z Lin","year":"2013","unstructured":"Lin Z, Kwan RSK (2013) An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling. Electron Notes Discrete Math 41:165\u2013172","journal-title":"Electron Notes Discrete Math"},{"issue":"1\u20132","key":"295_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s12469-013-0073-9","volume":"6","author":"Z Lin","year":"2014","unstructured":"Lin Z, Kwan RSK (2014) A two-phase approach for real-world train unit scheduling. Public Transp 6(1\u20132):35\u201365","journal-title":"Public Transp"},{"key":"295_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.trb.2016.09.007","volume":"94","author":"Z Lin","year":"2016","unstructured":"Lin Z, Kwan RSK (2016a) A branch-and-price approach for solving the train unit scheduling problem. Transp Res Part B Methodol 94:97\u2013120","journal-title":"Transp Res Part B Methodol"},{"issue":"3","key":"295_CR15","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s10589-016-9831-3","volume":"64","author":"Z Lin","year":"2016","unstructured":"Lin Z, Kwan RSK (2016b) Local convex hulls for a special class of integer multicommodity flow problems. Comput Optim Appl 64(3):881\u2013919","journal-title":"Comput Optim Appl"},{"issue":"1\u20132","key":"295_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s12469-016-0138-7","volume":"9","author":"Z Lin","year":"2017","unstructured":"Lin Z, Barrena E, Kwan RSK (2017) Train unit scheduling guided by historic capacity provisions and passenger count surveys. Public Transp 9(1\u20132):137\u2013154","journal-title":"Public Transp"},{"key":"295_CR17","doi-asserted-by":"crossref","unstructured":"Lin Z, Kwan RSK (2017) Multicommodity flow problems with commodity compatibility relations. In: ITM Web of Conferences, Volume 14, 2017 The 12th international conference applied mathematical programming and modelling\u2014APMOD 2016, EDP Sciences, vol\u00a014","DOI":"10.1051\/itmconf\/20171400003"},{"key":"295_CR18","doi-asserted-by":"crossref","unstructured":"Tomii N, Zhou LJ, Fukumura N (1999) An algorithm for station shunting scheduling problems combining probabilistic local search and PERT. In: International conference on industrial, engineering and other applications of applied intelligent systems. Springer, pp 788\u2013797","DOI":"10.1007\/978-3-540-48765-4_84"},{"key":"295_CR19","unstructured":"Wikipedia (2019) https:\/\/en.wikipedia.org\/wiki\/Passenger_rail_franchising_in_Great_Britain"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-022-00295-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12469-022-00295-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-022-00295-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T07:38:48Z","timestamp":1656920328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12469-022-00295-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["295"],"URL":"https:\/\/doi.org\/10.1007\/s12469-022-00295-3","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3]]},"assertion":[{"value":"17 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}