Routing and scheduling of trains and engines in a railway marshalling station yard
In a busy railway marshalling station, train and engine traffic management in the receiving/departure yard plays a crucial role in efficient and stable operations. Traditionally, a track assignment problem (TAP) is solved to assign tracks to trains for berthing at a receiving/departure yard. However...
Uloženo v:
| Vydáno v: | Transportation research. Part C, Emerging technologies Ročník 167; s. 104826 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.10.2024
|
| Témata: | |
| ISSN: | 0968-090X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In a busy railway marshalling station, train and engine traffic management in the receiving/departure yard plays a crucial role in efficient and stable operations. Traditionally, a track assignment problem (TAP) is solved to assign tracks to trains for berthing at a receiving/departure yard. However, the TAP does not encompass shunting operations in the yard (e.g., engine replacement and train disassembly), which can result in additional scheduling challenges for dispatchers and route conflicts between operations. This paper investigates a train and engine routing and scheduling problem (TERSP) in a receiving/departure yard of railway marshalling stations, which involves simultaneously assigning routes and scheduling route-setting start times for both train and shunting operations to be conducted in the yard. By introducing the concepts of task, activity, and pattern, we transform the original problem into assigning pre-generated patterns incorporating both route and route-setting start time alternatives to activities. The transformed problem is formulated into a compact binary integer linear programming model with a linear number of constraints and the objective of minimizing the total time deviation of all involved tasks. An improved technique that relies on listing all maximal (bi)cliques in a constructed graph is designed to effectively model the time coherence and track section occupation constraints. A heuristic that gradually expands the patterns for the identified key activities by adding more start time alternatives is applied to remedy an infeasible model caused by potential route conflicts. In addition, a rolling horizon algorithm that decomposes the original problem into consecutive smaller stages using either a time-rolling or a train-rolling rule is developed to efficiently solve instances. Finally, numerical experiments based on the physical layouts and real timetables of a receiving yard and a departure yard of a large marshalling station in China are conducted to assess the performance and applicability of our proposed approaches. The results demonstrate that our approaches typically find (near-)optimal solutions within several minutes for the investigated instances by simultaneously addressing different classes of yard operations and resources.
•We study routing and scheduling of trains and engines in a railway marshalling station yard.•We formulate a binary linear programming model with a linear number of constraints.•A rolling horizon algorithm with two rolling rules is developed to efficiently solve instances.•Our approaches outperform three modelling techniques and two benchmark two-stage approaches.•The effects of different interlocking systems and yard track usage strategies are validated. |
|---|---|
| AbstractList | In a busy railway marshalling station, train and engine traffic management in the receiving/departure yard plays a crucial role in efficient and stable operations. Traditionally, a track assignment problem (TAP) is solved to assign tracks to trains for berthing at a receiving/departure yard. However, the TAP does not encompass shunting operations in the yard (e.g., engine replacement and train disassembly), which can result in additional scheduling challenges for dispatchers and route conflicts between operations. This paper investigates a train and engine routing and scheduling problem (TERSP) in a receiving/departure yard of railway marshalling stations, which involves simultaneously assigning routes and scheduling route-setting start times for both train and shunting operations to be conducted in the yard. By introducing the concepts of task, activity, and pattern, we transform the original problem into assigning pre-generated patterns incorporating both route and route-setting start time alternatives to activities. The transformed problem is formulated into a compact binary integer linear programming model with a linear number of constraints and the objective of minimizing the total time deviation of all involved tasks. An improved technique that relies on listing all maximal (bi)cliques in a constructed graph is designed to effectively model the time coherence and track section occupation constraints. A heuristic that gradually expands the patterns for the identified key activities by adding more start time alternatives is applied to remedy an infeasible model caused by potential route conflicts. In addition, a rolling horizon algorithm that decomposes the original problem into consecutive smaller stages using either a time-rolling or a train-rolling rule is developed to efficiently solve instances. Finally, numerical experiments based on the physical layouts and real timetables of a receiving yard and a departure yard of a large marshalling station in China are conducted to assess the performance and applicability of our proposed approaches. The results demonstrate that our approaches typically find (near-)optimal solutions within several minutes for the investigated instances by simultaneously addressing different classes of yard operations and resources.
•We study routing and scheduling of trains and engines in a railway marshalling station yard.•We formulate a binary linear programming model with a linear number of constraints.•A rolling horizon algorithm with two rolling rules is developed to efficiently solve instances.•Our approaches outperform three modelling techniques and two benchmark two-stage approaches.•The effects of different interlocking systems and yard track usage strategies are validated. |
| ArticleNumber | 104826 |
| Author | Zhao, Jun Peng, Qiyuan Xiang, Jianghai |
| Author_xml | – sequence: 1 givenname: Jun surname: Zhao fullname: Zhao, Jun email: junzhao@swjtu.edu.cn – sequence: 2 givenname: Jianghai orcidid: 0009-0001-1817-0599 surname: Xiang fullname: Xiang, Jianghai – sequence: 3 givenname: Qiyuan surname: Peng fullname: Peng, Qiyuan |
| BookMark | eNp9kE1OwzAQhb0oEm3hAOx8gRTbSZxErFDFn1QJqQKJnTV2Jq2j4CA7BfX2OA0rFl2N5s18ozdvQWaud0jIDWcrzri8bVeDNyvBRBb7rBRyRuaskmXCKvZxSRYhtIwxXuXFnGy3_WGwbkfB1TSYPdaHbmz7hg4erAunAbqddRiodRRolLsfONJP8GEP3Wk9DDDY3tEj-PqKXDTQBbz-q0vy_vjwtn5ONq9PL-v7TWJEVQyJFDrXKc-aNAMoDUqjow55gyix1DrVaWriEqCUZSFEWWiTa10UouQNAE-XhE93je9D8NioL2-jqaPiTI1BqFbFINQYhJqCiEzxjzF2sj5-250l7yYS40vfFr0KxqIzWFuPZlB1b8_Qv5xOffQ |
| CitedBy_id | crossref_primary_10_3390_systems12120514 crossref_primary_10_3390_systems13090762 crossref_primary_10_1016_j_trc_2024_104972 crossref_primary_10_1016_j_tranpol_2024_11_024 crossref_primary_10_1016_j_trb_2025_103306 crossref_primary_10_3390_app15168873 crossref_primary_10_1016_j_eswa_2025_129326 crossref_primary_10_1016_j_cie_2025_111416 |
| Cites_doi | 10.1002/nav.3800140304 10.1016/j.trb.2009.05.004 10.1287/trsc.1100.0366 10.1287/trsc.1080.0247 10.1287/trsc.1100.0362 10.1016/j.tre.2022.102622 10.1016/j.trb.2007.07.003 10.1287/trsc.1100.0349 10.2140/pjm.1965.15.835 10.1016/j.dam.2003.09.004 10.1016/j.cie.2023.109865 10.1049/itr2.12216 10.1016/j.ejor.2013.10.062 10.1016/j.trb.2014.01.004 10.1016/S0377-2217(95)00342-8 10.1016/j.trb.2006.02.006 10.1016/j.cor.2012.01.003 10.1016/S0377-2217(00)00087-4 10.1287/trsc.37.2.213.15250 10.1007/s00291-015-0391-1 10.1016/j.eswa.2015.05.044 10.1002/net.21665 10.1177/0954409712472275 10.1287/trsc.30.3.181 10.1287/trsc.2014.0580 10.1016/j.trb.2021.05.012 10.1016/S0305-0548(02)00064-3 10.1016/j.trc.2023.104160 10.1002/net.20385 10.1016/j.ejor.2012.01.043 10.1016/j.trb.2013.10.013 10.1007/BF00264533 10.1016/j.trb.2017.04.007 10.1016/j.trb.2015.06.007 10.1007/s00291-009-0189-0 10.1016/S0377-2217(98)00299-9 10.1287/trsc.37.2.183.15251 10.1007/s00291-015-0412-0 10.1016/j.cor.2011.12.004 10.1016/j.tre.2022.102717 10.1016/j.trb.2018.12.008 10.1016/j.omega.2014.11.001 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Ltd |
| Copyright_xml | – notice: 2024 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.trc.2024.104826 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| ExternalDocumentID | 10_1016_j_trc_2024_104826 S0968090X24003474 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXKI AAXUO AAYFN ABBOA ABLJU ABMAC ABMMH ABUCO ABXDB ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HAMUX HMY HVGLF HZ~ H~9 IHE J1W JJJVA KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDS SES SET SEW SPC SPCBC SSB SSD SSO SSS SST SSV SSZ T5K TN5 WUQ XPP ~G- 9DU AATTM AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AGQPQ AIIUN ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c297t-62b5b314f34aa8ce6cb297a5fee6e8bb3b33c62bae66872287bc5bb77281faa13 |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001302489100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0968-090X |
| IngestDate | Tue Nov 18 21:21:31 EST 2025 Sat Nov 29 03:01:12 EST 2025 Sat Oct 26 15:43:28 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Rolling horizon algorithm Railway transportation Marshalling station Routing and scheduling Binary integer linear programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-62b5b314f34aa8ce6cb297a5fee6e8bb3b33c62bae66872287bc5bb77281faa13 |
| ORCID | 0009-0001-1817-0599 |
| ParticipantIDs | crossref_primary_10_1016_j_trc_2024_104826 crossref_citationtrail_10_1016_j_trc_2024_104826 elsevier_sciencedirect_doi_10_1016_j_trc_2024_104826 |
| PublicationCentury | 2000 |
| PublicationDate | October 2024 2024-10-00 |
| PublicationDateYYYYMMDD | 2024-10-01 |
| PublicationDate_xml | – month: 10 year: 2024 text: October 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Transportation research. Part C, Emerging technologies |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Preis, Pollehn, Ruf (b39) 2023; 26 Sels, Vansteenwegen, Dewilde, Cattrysse, Waquet, Joubert (b43) 2014; 61 He, Song, Chaudhry (b25) 2003; 30 Lusby, Larsen, Ehrgott, Ryan (b35) 2013; 40 Lusby, Larsen, Ryan, Ehrgott (b36) 2011; 45 Lu, Ning, Liu, Nie (b32) 2022; 159 Schasfoort, Gkiotsalitis, Eikenbroek, Van Berkum (b42) 2020; 14 Ruf, Cordeau (b41) 2021; 150 Zhang, Zhang, D’Ariano, Bosi, Lu, Peng (b46) 2023; 152 Deleplanque, Hosteins, Pellegrini, Rodriguez (b19) 2022; 16 Pellegrini, Pesenti, Rodriguez (b38) 2019; 120 Carey, Carville (b15) 2003; 37 Haahr, Lusby (b24) 2016; 67 Lipski, Preparata (b31) 1981; 15 Caprara, Galli, Toth (b13) 2011; 45 Jacob, Márton, Maue, Nunkesser (b26) 2011; 57 Jaehn, Rieder, Wiehl (b28) 2015; 52 Kroon, Romeijn, Zwaneveld (b30) 1997; 98 Jánošíková, Kavička, Bažant (b29) 2014; 228 Lübbecke, Zimmermann (b33) 2003; 37 Alexe, Alexe, Crama, Foldes, Hammer, Simeone (b2) 2004; 145 Bosi, Bigi, D’Ariano, Viti, Pineda-Jaramillo (b6) 2024; 188 Rodriguez (b40) 2007; 41 D’Ariano, Corman, Pacciarelli, Pranzo (b18) 2008; 42 Caimi, Flier, Fuchsberger, Nunkesser (b11) 2008 Caimi, Fuchsberger, Laumanns, Lüthi (b12) 2012; 39 Burggraeve, Vansteenwegen (b9) 2017; 101 Lusby, Larsen, Ehrgott, Ryan (b34) 2011; 33 Dewilde, Sels, Cattrysse, Vansteenwegen (b20) 2014; 235 Zwaneveld, Kroon, Romeijn, Salomon, Dauzere-Peres, Van Hoesel, Ambergen (b47) 1996; 30 Cardillo, Mione (b14) 1998; 106 Pellegrini, Marlière, Rodriguez (b37) 2014; 59 Billionnet (b3) 2003; 37 Chakroborty, Vikram (b16) 2008; 42 Gestrelius, Aronsson, Joborn, Bohlin (b22) 2017; 7 Adlbrecht, Hüttler, Ilo, Gronalt (b1) 2015; 42 Bohlin, Hansmann, Zimmermann (b5) 2018 Caimi, Chudak, Fuchsberger, Laumanns, Zenklusen (b10) 2011; 45 Glover (b23) 1967; 14 Jaehn, Rieder, Wiehl (b27) 2015; 37 Shi, Zhou (b44) 2015; 80 Wang, Zhao, Peng (b45) 2022; 162 Boysen, Emde, Fliedner (b7) 2016; 38 Bohlin, Gestrelius, Dahms, Mihalák, Flier (b4) 2016; 50 Zwaneveld, Kroon, Van Hoesel (b48) 2001; 128 Boysen, Fliedner, Jaehn, Pesch (b8) 2012; 220 Corman, D’Ariano, Pacciarelli, Pranzo (b17) 2010; 44 Fulkerson, Gross (b21) 1965; 15 Jaehn (10.1016/j.trc.2024.104826_b28) 2015; 52 Bohlin (10.1016/j.trc.2024.104826_b4) 2016; 50 Lübbecke (10.1016/j.trc.2024.104826_b33) 2003; 37 Wang (10.1016/j.trc.2024.104826_b45) 2022; 162 Bosi (10.1016/j.trc.2024.104826_b6) 2024; 188 Alexe (10.1016/j.trc.2024.104826_b2) 2004; 145 Lu (10.1016/j.trc.2024.104826_b32) 2022; 159 Zwaneveld (10.1016/j.trc.2024.104826_b48) 2001; 128 Carey (10.1016/j.trc.2024.104826_b15) 2003; 37 Pellegrini (10.1016/j.trc.2024.104826_b37) 2014; 59 Schasfoort (10.1016/j.trc.2024.104826_b42) 2020; 14 Billionnet (10.1016/j.trc.2024.104826_b3) 2003; 37 Caimi (10.1016/j.trc.2024.104826_b12) 2012; 39 Pellegrini (10.1016/j.trc.2024.104826_b38) 2019; 120 Zhang (10.1016/j.trc.2024.104826_b46) 2023; 152 Caimi (10.1016/j.trc.2024.104826_b10) 2011; 45 Lusby (10.1016/j.trc.2024.104826_b35) 2013; 40 Zwaneveld (10.1016/j.trc.2024.104826_b47) 1996; 30 Shi (10.1016/j.trc.2024.104826_b44) 2015; 80 Bohlin (10.1016/j.trc.2024.104826_b5) 2018 Glover (10.1016/j.trc.2024.104826_b23) 1967; 14 Caprara (10.1016/j.trc.2024.104826_b13) 2011; 45 Sels (10.1016/j.trc.2024.104826_b43) 2014; 61 Ruf (10.1016/j.trc.2024.104826_b41) 2021; 150 Chakroborty (10.1016/j.trc.2024.104826_b16) 2008; 42 Boysen (10.1016/j.trc.2024.104826_b8) 2012; 220 Preis (10.1016/j.trc.2024.104826_b39) 2023; 26 Burggraeve (10.1016/j.trc.2024.104826_b9) 2017; 101 Lusby (10.1016/j.trc.2024.104826_b36) 2011; 45 Boysen (10.1016/j.trc.2024.104826_b7) 2016; 38 Jaehn (10.1016/j.trc.2024.104826_b27) 2015; 37 Rodriguez (10.1016/j.trc.2024.104826_b40) 2007; 41 Jánošíková (10.1016/j.trc.2024.104826_b29) 2014; 228 Corman (10.1016/j.trc.2024.104826_b17) 2010; 44 Dewilde (10.1016/j.trc.2024.104826_b20) 2014; 235 D’Ariano (10.1016/j.trc.2024.104826_b18) 2008; 42 Jacob (10.1016/j.trc.2024.104826_b26) 2011; 57 Fulkerson (10.1016/j.trc.2024.104826_b21) 1965; 15 Haahr (10.1016/j.trc.2024.104826_b24) 2016; 67 Lipski (10.1016/j.trc.2024.104826_b31) 1981; 15 Caimi (10.1016/j.trc.2024.104826_b11) 2008 Gestrelius (10.1016/j.trc.2024.104826_b22) 2017; 7 Cardillo (10.1016/j.trc.2024.104826_b14) 1998; 106 Kroon (10.1016/j.trc.2024.104826_b30) 1997; 98 Deleplanque (10.1016/j.trc.2024.104826_b19) 2022; 16 He (10.1016/j.trc.2024.104826_b25) 2003; 30 Lusby (10.1016/j.trc.2024.104826_b34) 2011; 33 Adlbrecht (10.1016/j.trc.2024.104826_b1) 2015; 42 |
| References_xml | – volume: 30 start-page: 181 year: 1996 end-page: 194 ident: b47 article-title: Routing trains through railway stations: Model formulation and algorithms publication-title: Transp. Sci. – volume: 14 year: 2020 ident: b42 article-title: A dynamic model for real-time track assignment at railway yards publication-title: J. Rail Transp. Plan. Manag. – volume: 42 start-page: 405 year: 2008 end-page: 419 ident: b18 article-title: Reordering and local rerouting strategies to manage train traffic in real time publication-title: Transp. Sci. – volume: 150 start-page: 26 year: 2021 end-page: 51 ident: b41 article-title: Adaptive large neighborhood search for integrated planning in railroad classification yards publication-title: Transp. Res. B – volume: 57 start-page: 87 year: 2011 end-page: 105 ident: b26 article-title: Multistage methods for freight train classification publication-title: Networks – volume: 37 start-page: 183 year: 2003 end-page: 197 ident: b33 article-title: Engine routing and scheduling at industrial in-plant railroads publication-title: Transp. Sci. – start-page: 181 year: 2018 end-page: 212 ident: b5 article-title: Optimization of railway freight shunting publication-title: Handbook of Optimization in the Railway Industry – volume: 14 start-page: 313 year: 1967 end-page: 316 ident: b23 article-title: Maximum matching in a convex bipartite graph publication-title: Nav. Res. Logist. Q. – volume: 37 start-page: 195 year: 2003 end-page: 224 ident: b15 article-title: Scheduling and platforming trains at busy complex stations publication-title: Transp. Res. Part A: Policy Pract. – volume: 235 start-page: 276 year: 2014 end-page: 286 ident: b20 article-title: Improving the robustness in railway station areas publication-title: European J. Oper. Res. – volume: 39 start-page: 2578 year: 2012 end-page: 2593 ident: b12 article-title: A model predictive control approach for discrete-time rescheduling in complex central railway station areas publication-title: Comput. Oper. Res. – volume: 7 start-page: 157 year: 2017 end-page: 170 ident: b22 article-title: Towards a comprehensive model for track allocation and roll-time scheduling at marshalling yards publication-title: J. Rail Transp. Plan. Manag. – volume: 16 start-page: 1286 year: 2022 end-page: 1305 ident: b19 article-title: Train management in freight shunting yards: Formalisation and literature review publication-title: IET Intell. Transp. Syst. – volume: 59 start-page: 58 year: 2014 end-page: 80 ident: b37 article-title: Optimal train routing and scheduling for managing traffic perturbations in complex junctions publication-title: Transp. Res. B – year: 2008 ident: b11 article-title: Performance of a greedy algorithm for edge covering by cliques in interval graphs – volume: 44 start-page: 175 year: 2010 end-page: 192 ident: b17 article-title: A tabu search algorithm for rerouting trains during rail operations publication-title: Transp. Res. B – volume: 152 year: 2023 ident: b46 article-title: Optimal platforming, routing, and scheduling of trains and locomotives in a rail passenger station yard publication-title: Transp. Res. C – volume: 38 start-page: 207 year: 2016 end-page: 233 ident: b7 article-title: The basic train makeup problem in shunting yards publication-title: OR Spectrum – volume: 52 start-page: 133 year: 2015 end-page: 141 ident: b28 article-title: Single-stage shunting minimizing weighted departure times publication-title: Omega – volume: 106 start-page: 160 year: 1998 end-page: 164 ident: b14 article-title: k L-list publication-title: European J. Oper. Res. – volume: 162 year: 2022 ident: b45 article-title: Optimizing the loaded train combination problem at a heavy-haul marshalling station publication-title: Transp. Res. Part E: Logist. Transp. Rev. – volume: 128 start-page: 14 year: 2001 end-page: 33 ident: b48 article-title: Routing trains through a railway station based on a node packing model publication-title: European J. Oper. Res. – volume: 159 year: 2022 ident: b32 article-title: Train platforming and rescheduling with flexible interlocking mechanisms: An aggregate approach publication-title: Transp. Res. Part E: Logist. Transp. Rev. – volume: 45 start-page: 212 year: 2011 end-page: 227 ident: b10 article-title: A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling publication-title: Transp. Sci. – volume: 67 start-page: 126 year: 2016 end-page: 138 ident: b24 article-title: A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards publication-title: Networks – volume: 33 start-page: 843 year: 2011 end-page: 883 ident: b34 article-title: Railway track allocation: models and methods publication-title: OR Spectrum – volume: 42 start-page: 7292 year: 2015 end-page: 7302 ident: b1 article-title: Train routing in shunting yards using answer set programming publication-title: Expert Syst. Appl. – volume: 15 start-page: 835 year: 1965 end-page: 855 ident: b21 article-title: Incidence matrices and interval graphs publication-title: Pacific J. Math. – volume: 80 start-page: 19 year: 2015 end-page: 39 ident: b44 article-title: A mixed integer programming model for optimizing multi-level operations process in railroad yards publication-title: Transp. Res. B – volume: 228 start-page: 271 year: 2014 end-page: 284 ident: b29 article-title: Optimal operation scheduling and platform track assignment in a passenger railway station publication-title: Proc. Inst. Mech. Eng., Part F: J. Rail Rapid Transit – volume: 61 start-page: 55 year: 2014 end-page: 72 ident: b43 article-title: The train platforming problem: The infrastructure management company perspective publication-title: Transp. Res. B – volume: 40 start-page: 713 year: 2013 end-page: 724 ident: b35 article-title: A set packing inspired method for real-time junction train routing publication-title: Comput. Oper. Res. – volume: 45 start-page: 228 year: 2011 end-page: 245 ident: b36 article-title: Routing trains through railway junctions: A new set-packing approach publication-title: Transp. Sci. – volume: 15 start-page: 329 year: 1981 end-page: 346 ident: b31 article-title: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems publication-title: Acta Inform. – volume: 220 start-page: 1 year: 2012 end-page: 14 ident: b8 article-title: Shunting yard operations: Theoretical aspects and applications publication-title: European J. Oper. Res. – volume: 30 start-page: 939 year: 2003 end-page: 966 ident: b25 article-title: An integrated dispatching model for rail yards operations publication-title: Comput. Oper. Res. – volume: 120 start-page: 33 year: 2019 end-page: 48 ident: b38 article-title: Efficient train re-routing and rescheduling: Valid inequalities and reformulation of RECIFE-MILP publication-title: Transp. Res. B – volume: 145 start-page: 11 year: 2004 end-page: 21 ident: b2 article-title: Consensus algorithms for the generation of all maximal bicliques publication-title: Discrete Appl. Math. – volume: 42 start-page: 169 year: 2008 end-page: 184 ident: b16 article-title: Optimum assignment of trains to platforms under partial schedule compliance publication-title: Transp. Res. B – volume: 50 start-page: 823 year: 2016 end-page: 840 ident: b4 article-title: Optimization methods for multistage freight train formation publication-title: Transp. Sci. – volume: 188 year: 2024 ident: b6 article-title: Optimal management of full train load services in the shunting yard: A comprehensive study on shunt-in shunt-out policies publication-title: Comput. Ind. Eng. – volume: 37 start-page: 407 year: 2015 end-page: 429 ident: b27 article-title: Minimizing delays in a shunting yard publication-title: OR Spectrum – volume: 26 year: 2023 ident: b39 article-title: Optimal resource rescheduling in classification yards considering flexible skill patterns publication-title: J. Rail Transp. Plan. Manag. – volume: 41 start-page: 231 year: 2007 end-page: 245 ident: b40 article-title: A constraint programming model for real-time train scheduling at junctions publication-title: Transp. Res. B – volume: 98 start-page: 485 year: 1997 end-page: 498 ident: b30 article-title: Routing trains through railway stations: complexity issues publication-title: European J. Oper. Res. – volume: 37 start-page: 213 year: 2003 end-page: 222 ident: b3 article-title: Using integer programming to solve the train-platforming problem publication-title: Transp. Sci. – volume: 101 start-page: 228 year: 2017 end-page: 244 ident: b9 article-title: Robust routing and timetabling in complex railway stations publication-title: Transp. Res. B – volume: 45 start-page: 246 year: 2011 end-page: 257 ident: b13 article-title: Solution of the train platforming problem publication-title: Transp. Sci. – volume: 14 start-page: 313 issue: 3 year: 1967 ident: 10.1016/j.trc.2024.104826_b23 article-title: Maximum matching in a convex bipartite graph publication-title: Nav. Res. Logist. Q. doi: 10.1002/nav.3800140304 – volume: 14 year: 2020 ident: 10.1016/j.trc.2024.104826_b42 article-title: A dynamic model for real-time track assignment at railway yards publication-title: J. Rail Transp. Plan. Manag. – volume: 44 start-page: 175 issue: 1 year: 2010 ident: 10.1016/j.trc.2024.104826_b17 article-title: A tabu search algorithm for rerouting trains during rail operations publication-title: Transp. Res. B doi: 10.1016/j.trb.2009.05.004 – volume: 45 start-page: 246 issue: 2 year: 2011 ident: 10.1016/j.trc.2024.104826_b13 article-title: Solution of the train platforming problem publication-title: Transp. Sci. doi: 10.1287/trsc.1100.0366 – volume: 42 start-page: 405 issue: 4 year: 2008 ident: 10.1016/j.trc.2024.104826_b18 article-title: Reordering and local rerouting strategies to manage train traffic in real time publication-title: Transp. Sci. doi: 10.1287/trsc.1080.0247 – volume: 45 start-page: 228 issue: 2 year: 2011 ident: 10.1016/j.trc.2024.104826_b36 article-title: Routing trains through railway junctions: A new set-packing approach publication-title: Transp. Sci. doi: 10.1287/trsc.1100.0362 – volume: 159 year: 2022 ident: 10.1016/j.trc.2024.104826_b32 article-title: Train platforming and rescheduling with flexible interlocking mechanisms: An aggregate approach publication-title: Transp. Res. Part E: Logist. Transp. Rev. doi: 10.1016/j.tre.2022.102622 – volume: 42 start-page: 169 issue: 2 year: 2008 ident: 10.1016/j.trc.2024.104826_b16 article-title: Optimum assignment of trains to platforms under partial schedule compliance publication-title: Transp. Res. B doi: 10.1016/j.trb.2007.07.003 – volume: 7 start-page: 157 issue: 3 year: 2017 ident: 10.1016/j.trc.2024.104826_b22 article-title: Towards a comprehensive model for track allocation and roll-time scheduling at marshalling yards publication-title: J. Rail Transp. Plan. Manag. – volume: 45 start-page: 212 issue: 2 year: 2011 ident: 10.1016/j.trc.2024.104826_b10 article-title: A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling publication-title: Transp. Sci. doi: 10.1287/trsc.1100.0349 – volume: 15 start-page: 835 issue: 3 year: 1965 ident: 10.1016/j.trc.2024.104826_b21 article-title: Incidence matrices and interval graphs publication-title: Pacific J. Math. doi: 10.2140/pjm.1965.15.835 – volume: 145 start-page: 11 issue: 1 year: 2004 ident: 10.1016/j.trc.2024.104826_b2 article-title: Consensus algorithms for the generation of all maximal bicliques publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2003.09.004 – volume: 188 year: 2024 ident: 10.1016/j.trc.2024.104826_b6 article-title: Optimal management of full train load services in the shunting yard: A comprehensive study on shunt-in shunt-out policies publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2023.109865 – volume: 16 start-page: 1286 issue: 10 year: 2022 ident: 10.1016/j.trc.2024.104826_b19 article-title: Train management in freight shunting yards: Formalisation and literature review publication-title: IET Intell. Transp. Syst. doi: 10.1049/itr2.12216 – volume: 235 start-page: 276 issue: 1 year: 2014 ident: 10.1016/j.trc.2024.104826_b20 article-title: Improving the robustness in railway station areas publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2013.10.062 – volume: 61 start-page: 55 year: 2014 ident: 10.1016/j.trc.2024.104826_b43 article-title: The train platforming problem: The infrastructure management company perspective publication-title: Transp. Res. B doi: 10.1016/j.trb.2014.01.004 – volume: 26 year: 2023 ident: 10.1016/j.trc.2024.104826_b39 article-title: Optimal resource rescheduling in classification yards considering flexible skill patterns publication-title: J. Rail Transp. Plan. Manag. – volume: 98 start-page: 485 issue: 3 year: 1997 ident: 10.1016/j.trc.2024.104826_b30 article-title: Routing trains through railway stations: complexity issues publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(95)00342-8 – volume: 41 start-page: 231 issue: 2 year: 2007 ident: 10.1016/j.trc.2024.104826_b40 article-title: A constraint programming model for real-time train scheduling at junctions publication-title: Transp. Res. B doi: 10.1016/j.trb.2006.02.006 – volume: 39 start-page: 2578 issue: 11 year: 2012 ident: 10.1016/j.trc.2024.104826_b12 article-title: A model predictive control approach for discrete-time rescheduling in complex central railway station areas publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.01.003 – volume: 128 start-page: 14 issue: 1 year: 2001 ident: 10.1016/j.trc.2024.104826_b48 article-title: Routing trains through a railway station based on a node packing model publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(00)00087-4 – volume: 37 start-page: 213 issue: 2 year: 2003 ident: 10.1016/j.trc.2024.104826_b3 article-title: Using integer programming to solve the train-platforming problem publication-title: Transp. Sci. doi: 10.1287/trsc.37.2.213.15250 – volume: 37 start-page: 407 issue: 2 year: 2015 ident: 10.1016/j.trc.2024.104826_b27 article-title: Minimizing delays in a shunting yard publication-title: OR Spectrum doi: 10.1007/s00291-015-0391-1 – volume: 42 start-page: 7292 issue: 21 year: 2015 ident: 10.1016/j.trc.2024.104826_b1 article-title: Train routing in shunting yards using answer set programming publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2015.05.044 – start-page: 181 year: 2018 ident: 10.1016/j.trc.2024.104826_b5 article-title: Optimization of railway freight shunting – volume: 67 start-page: 126 issue: 2 year: 2016 ident: 10.1016/j.trc.2024.104826_b24 article-title: A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards publication-title: Networks doi: 10.1002/net.21665 – volume: 228 start-page: 271 issue: 3 year: 2014 ident: 10.1016/j.trc.2024.104826_b29 article-title: Optimal operation scheduling and platform track assignment in a passenger railway station publication-title: Proc. Inst. Mech. Eng., Part F: J. Rail Rapid Transit doi: 10.1177/0954409712472275 – volume: 30 start-page: 181 issue: 3 year: 1996 ident: 10.1016/j.trc.2024.104826_b47 article-title: Routing trains through railway stations: Model formulation and algorithms publication-title: Transp. Sci. doi: 10.1287/trsc.30.3.181 – volume: 50 start-page: 823 issue: 3 year: 2016 ident: 10.1016/j.trc.2024.104826_b4 article-title: Optimization methods for multistage freight train formation publication-title: Transp. Sci. doi: 10.1287/trsc.2014.0580 – volume: 150 start-page: 26 year: 2021 ident: 10.1016/j.trc.2024.104826_b41 article-title: Adaptive large neighborhood search for integrated planning in railroad classification yards publication-title: Transp. Res. B doi: 10.1016/j.trb.2021.05.012 – volume: 30 start-page: 939 issue: 7 year: 2003 ident: 10.1016/j.trc.2024.104826_b25 article-title: An integrated dispatching model for rail yards operations publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(02)00064-3 – volume: 152 year: 2023 ident: 10.1016/j.trc.2024.104826_b46 article-title: Optimal platforming, routing, and scheduling of trains and locomotives in a rail passenger station yard publication-title: Transp. Res. C doi: 10.1016/j.trc.2023.104160 – volume: 57 start-page: 87 issue: 1 year: 2011 ident: 10.1016/j.trc.2024.104826_b26 article-title: Multistage methods for freight train classification publication-title: Networks doi: 10.1002/net.20385 – volume: 220 start-page: 1 issue: 1 year: 2012 ident: 10.1016/j.trc.2024.104826_b8 article-title: Shunting yard operations: Theoretical aspects and applications publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2012.01.043 – volume: 59 start-page: 58 year: 2014 ident: 10.1016/j.trc.2024.104826_b37 article-title: Optimal train routing and scheduling for managing traffic perturbations in complex junctions publication-title: Transp. Res. B doi: 10.1016/j.trb.2013.10.013 – volume: 15 start-page: 329 year: 1981 ident: 10.1016/j.trc.2024.104826_b31 article-title: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems publication-title: Acta Inform. doi: 10.1007/BF00264533 – volume: 101 start-page: 228 year: 2017 ident: 10.1016/j.trc.2024.104826_b9 article-title: Robust routing and timetabling in complex railway stations publication-title: Transp. Res. B doi: 10.1016/j.trb.2017.04.007 – year: 2008 ident: 10.1016/j.trc.2024.104826_b11 – volume: 80 start-page: 19 year: 2015 ident: 10.1016/j.trc.2024.104826_b44 article-title: A mixed integer programming model for optimizing multi-level operations process in railroad yards publication-title: Transp. Res. B doi: 10.1016/j.trb.2015.06.007 – volume: 37 start-page: 195 issue: 3 year: 2003 ident: 10.1016/j.trc.2024.104826_b15 article-title: Scheduling and platforming trains at busy complex stations publication-title: Transp. Res. Part A: Policy Pract. – volume: 33 start-page: 843 year: 2011 ident: 10.1016/j.trc.2024.104826_b34 article-title: Railway track allocation: models and methods publication-title: OR Spectrum doi: 10.1007/s00291-009-0189-0 – volume: 106 start-page: 160 issue: 1 year: 1998 ident: 10.1016/j.trc.2024.104826_b14 article-title: k L-list λ colouring of graphs publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(98)00299-9 – volume: 37 start-page: 183 issue: 2 year: 2003 ident: 10.1016/j.trc.2024.104826_b33 article-title: Engine routing and scheduling at industrial in-plant railroads publication-title: Transp. Sci. doi: 10.1287/trsc.37.2.183.15251 – volume: 38 start-page: 207 issue: 1 year: 2016 ident: 10.1016/j.trc.2024.104826_b7 article-title: The basic train makeup problem in shunting yards publication-title: OR Spectrum doi: 10.1007/s00291-015-0412-0 – volume: 40 start-page: 713 issue: 3 year: 2013 ident: 10.1016/j.trc.2024.104826_b35 article-title: A set packing inspired method for real-time junction train routing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.12.004 – volume: 162 year: 2022 ident: 10.1016/j.trc.2024.104826_b45 article-title: Optimizing the loaded train combination problem at a heavy-haul marshalling station publication-title: Transp. Res. Part E: Logist. Transp. Rev. doi: 10.1016/j.tre.2022.102717 – volume: 120 start-page: 33 year: 2019 ident: 10.1016/j.trc.2024.104826_b38 article-title: Efficient train re-routing and rescheduling: Valid inequalities and reformulation of RECIFE-MILP publication-title: Transp. Res. B doi: 10.1016/j.trb.2018.12.008 – volume: 52 start-page: 133 year: 2015 ident: 10.1016/j.trc.2024.104826_b28 article-title: Single-stage shunting minimizing weighted departure times publication-title: Omega doi: 10.1016/j.omega.2014.11.001 |
| SSID | ssj0001957 |
| Score | 2.457288 |
| Snippet | In a busy railway marshalling station, train and engine traffic management in the receiving/departure yard plays a crucial role in efficient and stable... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 104826 |
| SubjectTerms | Binary integer linear programming Marshalling station Railway transportation Rolling horizon algorithm Routing and scheduling |
| Title | Routing and scheduling of trains and engines in a railway marshalling station yard |
| URI | https://dx.doi.org/10.1016/j.trc.2024.104826 |
| Volume | 167 |
| WOSCitedRecordID | wos001302489100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect issn: 0968-090X databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001957 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Rb9MwELZgQ2I8IBigDRjyA09UqZrYjePHaRpiE5oADSniJbI9R81UsqlNYf33nO1z2g2G2AMvUeQ4Tpr7er47330m5C1XqZK6GCVaiDrhzJhE25wnOUz-1sCcfxbY9T-Kk5OiLOUnXC6Y--0ERNsWV1fy8r-KGtpA2K509g7i7geFBjgHocMRxA7HfxK8y_GJlYfgusJUMsXMZr8dROBktp6G0OfCqgE0T3-q5eA7OLlubxUMMXhkLLHqPhqwPRl6uIxcQZMhmKKzbnDgVaur6PRVWDFsv5ao-G2iwlrPokdl2WDM-tidTFSzUteh_XOzXCCIMT6R8T7TrQ805i7BYlRe07lhDw7UmuASFqFu_jeFHmIL58Nu5vgmMz5c9b1Onn1jUutTDWMW23kFQ1RuiCoMcZ9sZmIsQZlv7h8dlsf9_J3KwA8b3zuuhfuswBvv8WdrZs1COX1CHqNrQfcDJJ6Se7bdJg9j5fl8mzxaI598Rr4gUCjgga6AQi9qGoDiLyBQaNNSRREodA0oFIFCHVCek6_vD08PPiS4w0ZiMim6JM_0WLOU14wrVRibGw3talxbm9tCa6YZM9BJ2TwvRAbetTZjDX_rrEhrpVL2gmy0F63dIVS4mnzJ5Zlh4PFntdK2kJZJXXPBBOe7ZBS_VGWQft79mml1q4R2ybv-lsvAvfK3zjx-_gqNx2AUVgCl2297eZdnvCJbK4S_JhvdbGH3yAPzo2vmszeIo19zz5CW |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Routing+and+scheduling+of+trains+and+engines+in+a+railway+marshalling+station+yard&rft.jtitle=Transportation+research.+Part+C%2C+Emerging+technologies&rft.au=Zhao%2C+Jun&rft.au=Xiang%2C+Jianghai&rft.au=Peng%2C+Qiyuan&rft.date=2024-10-01&rft.issn=0968-090X&rft.volume=167&rft.spage=104826&rft_id=info:doi/10.1016%2Fj.trc.2024.104826&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_trc_2024_104826 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0968-090X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0968-090X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0968-090X&client=summon |