The Tick Formulation for deadlock detection and avoidance in railways traffic control

Journal of Rail Transport Planning and Management - Tập 17 - Trang 100239 - 2021
Veronica Dal Sasso1, Leonardo Lamorgese1, Carlo Mannino2, Andrea Onofri1, Paolo Ventura3
1Optrail, viale Marco Polo 59, 00154, Rome, Italy
2SINTEF Digital and University of Oslo, Norway
3IASI-CNR, Rome, Italy

Tài liệu tham khảo

Ahuja, 1993 Arbib, 1990, Predicting deadlock in store-and-forward networks, Networks, 20, 861, 10.1002/net.3230200705 Aurizon, 2020 Balas, 1985, On the facial structure of scheduling polyhedra, Math. Program., 24, 179, 10.1007/BFb0121051 Bollapragada, 2018, A novel movement planner system for dispatching trains, Interfaces, 48, 57, 10.1287/inte.2017.0931 Caimi, 2012, A model predictive control approach for discrete-time rescheduling in complex central railway station areas, Comput. Oper. Res., 39, 2578, 10.1016/j.cor.2012.01.003 Caprara, 2002, Modeling and solving the train timetabling problem, Oper. Res., 50, 851, 10.1287/opre.50.5.851.362 Cui, 2009 Cui, 2017, Searching feasible resources to reduce false-positive situations for resolving deadlocks with the banker's algorithm in railway simulation, Journal of Rail Transport Planning & Management, 7, 50, 10.1016/j.jrtpm.2017.05.001 Dyer, 1990, Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Appl. Math., 26, 255, 10.1016/0166-218X(90)90104-K Fang, 2015, A survey on problem models and solution approaches to rescheduling in railway networks, IEEE Trans. Intell. Transport. Syst., 16, 2997, 10.1109/TITS.2015.2446985 Garey, 1979, vol. 174 Harrod, 2011, Modeling network transition constraints with hypergraphs, Transport. Sci., 45, 81, 10.1287/trsc.1100.0337 Keha, 2009, Mixed integer programming formulations for single machine scheduling problems, Comput. Ind. Eng., 56, 357, 10.1016/j.cie.2008.06.008 Koné, 2011, Event-based milp models for resource-constrained project scheduling problems, Comput. Oper. Res., 38, 3, 10.1016/j.cor.2009.12.011 Li, 2014, Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system, Transp. Res. Part B Methodol., 68, 385, 10.1016/j.trb.2014.06.014 Lu, 2004, Modeling train movements through complex rail networks, ACM Trans. Model Comput. Simulat, 14, 48, 10.1145/974734.974737 Mascis, 2002, Job-shop scheduling with blocking and no-wait constraints, Eur. J. Oper. Res., 143, 498, 10.1016/S0377-2217(01)00338-1 Mazzanti, 2011, 109 Meng, 2014, Simultaneous train rerouting and rescheduling on an n-track network: a model reformulation with network-based cumulative flow variables, Transp. Res. Part B Methodol., 67, 208, 10.1016/j.trb.2014.05.005 Pachl, 2011, Deadlock avoidance in railroad operations simulation, 359 Queyranne, 1994, 3 Reynolds, 2020 Tesch, 2020, A polyhedral study of event-based models for the resource-constrained project scheduling problem, J. Sched., 1 Wen, 2019, Train dispatching management with data-driven approaches: a comprehensive review and appraisal, IEEE Access, 7, 114547, 10.1109/ACCESS.2019.2935106