An Algorithm for Rescheduling of Trains under Planned Track Closures
This work considered a joint problem of train rescheduling and closure planning. The derivation of a new train run schedule and the determination of a closure plan not only must guarantee the satisfaction of all the given constraints but also must optimize the number of accepted closures, the number...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-03-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/11/5/2334 |
| _version_ | 1797413331143753728 |
|---|---|
| author | Grzegorz Filcek Dariusz Gąsior Maciej Hojda Jerzy Józefczyk |
| author_facet | Grzegorz Filcek Dariusz Gąsior Maciej Hojda Jerzy Józefczyk |
| author_sort | Grzegorz Filcek |
| collection | DOAJ |
| description | This work considered a joint problem of train rescheduling and closure planning. The derivation of a new train run schedule and the determination of a closure plan not only must guarantee the satisfaction of all the given constraints but also must optimize the number of accepted closures, the number of approved train runs, and the total time shift between the resultant and the original schedule. Presented is a novel nonlinear mixed integer optimization problem which is valid for a broad class of railway networks. A multi-level hierarchical heuristic algorithm is introduced due to the NP-hardness of the considered optimization problem. The algorithm is able, on an iterative basis, to jointly select closures and train runs, along with the derivation of a train schedule. Results obtained by the algorithm, launched for the conducted experiments, confirm its ability to provide acceptable and feasible solutions in a reasonable amount of time. |
| first_indexed | 2024-03-09T05:16:06Z |
| format | Article |
| id | doaj.art-8ad3df2a12d64f3985b9bfcd3bf54e87 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-09T05:16:06Z |
| publishDate | 2021-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-8ad3df2a12d64f3985b9bfcd3bf54e872023-12-03T12:45:18ZengMDPI AGApplied Sciences2076-34172021-03-01115233410.3390/app11052334An Algorithm for Rescheduling of Trains under Planned Track ClosuresGrzegorz Filcek0Dariusz Gąsior1Maciej Hojda2Jerzy Józefczyk3Department of Computer Science and Systems Engineering, Faculty of Computer Science and Management, Wroclaw University of Science and Technology, 27 Wyb. Wyspianskiego St., 50-370 Wroclaw, PolandDepartment of Computer Science and Systems Engineering, Faculty of Computer Science and Management, Wroclaw University of Science and Technology, 27 Wyb. Wyspianskiego St., 50-370 Wroclaw, PolandDepartment of Computer Science and Systems Engineering, Faculty of Computer Science and Management, Wroclaw University of Science and Technology, 27 Wyb. Wyspianskiego St., 50-370 Wroclaw, PolandDepartment of Computer Science and Systems Engineering, Faculty of Computer Science and Management, Wroclaw University of Science and Technology, 27 Wyb. Wyspianskiego St., 50-370 Wroclaw, PolandThis work considered a joint problem of train rescheduling and closure planning. The derivation of a new train run schedule and the determination of a closure plan not only must guarantee the satisfaction of all the given constraints but also must optimize the number of accepted closures, the number of approved train runs, and the total time shift between the resultant and the original schedule. Presented is a novel nonlinear mixed integer optimization problem which is valid for a broad class of railway networks. A multi-level hierarchical heuristic algorithm is introduced due to the NP-hardness of the considered optimization problem. The algorithm is able, on an iterative basis, to jointly select closures and train runs, along with the derivation of a train schedule. Results obtained by the algorithm, launched for the conducted experiments, confirm its ability to provide acceptable and feasible solutions in a reasonable amount of time.https://www.mdpi.com/2076-3417/11/5/2334railway transportationtimetabletrack closurereschedulingoptimizationsimulation |
| spellingShingle | Grzegorz Filcek Dariusz Gąsior Maciej Hojda Jerzy Józefczyk An Algorithm for Rescheduling of Trains under Planned Track Closures Applied Sciences railway transportation timetable track closure rescheduling optimization simulation |
| title | An Algorithm for Rescheduling of Trains under Planned Track Closures |
| title_full | An Algorithm for Rescheduling of Trains under Planned Track Closures |
| title_fullStr | An Algorithm for Rescheduling of Trains under Planned Track Closures |
| title_full_unstemmed | An Algorithm for Rescheduling of Trains under Planned Track Closures |
| title_short | An Algorithm for Rescheduling of Trains under Planned Track Closures |
| title_sort | algorithm for rescheduling of trains under planned track closures |
| topic | railway transportation timetable track closure rescheduling optimization simulation |
| url | https://www.mdpi.com/2076-3417/11/5/2334 |
| work_keys_str_mv | AT grzegorzfilcek analgorithmforreschedulingoftrainsunderplannedtrackclosures AT dariuszgasior analgorithmforreschedulingoftrainsunderplannedtrackclosures AT maciejhojda analgorithmforreschedulingoftrainsunderplannedtrackclosures AT jerzyjozefczyk analgorithmforreschedulingoftrainsunderplannedtrackclosures AT grzegorzfilcek algorithmforreschedulingoftrainsunderplannedtrackclosures AT dariuszgasior algorithmforreschedulingoftrainsunderplannedtrackclosures AT maciejhojda algorithmforreschedulingoftrainsunderplannedtrackclosures AT jerzyjozefczyk algorithmforreschedulingoftrainsunderplannedtrackclosures |