References
- Ait-Ali, A., P.O. Lindberg, J. Eliasson, J. E. Nilsson, and A. Peterson. 2020. “A disaggregate bundle method for train timetabling problems.” Journal of Rail Transport Planning & Management, 100200. doi: https://doi.org/10.1016/j.jrtpm.2020.100200.
- Barrena, E., D. Canca, L. C. Coelho, and G. Laporte. 2014a. “Single-line Rail Rapid Transit Timetabling under Dynamic Passenger Demand.” Transportation Research Part B: Methodological 70: 134–150. doi:https://doi.org/10.1016/j.trb.2014.08.013.
- Barrena, E., D. Canca, L. C. Coelho, and G. Laporte. 2014b. “Exact Formulations and Algorithm for the Train Timetabling Problem with Dynamic Demand.” Computers & Operations Research 44: 66–74. doi:https://doi.org/10.1016/j.cor.2013.11.003.
- Bešinović, N., R. M. Goverde, E. Quaglietta, and R. Roberti. 2016. “An Integrated Micro–macro Approach to Robust Railway Timetabling.” Transportation Research Part B: Methodological 87: 14–32. doi:https://doi.org/10.1016/j.trb.2016.02.004.
- Cacchiani, V., A. Caprara, and M. Fischetti. 2012. “A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling.” Transportation Science 46 (1): 124–133. doi:https://doi.org/10.1287/trsc.1110.0378.
- Cacchiani, V., A. Caprara, and P. Toth. 2010. “Scheduling Extra Freight Trains on Railway Networks.” Transportation Research Part B: Methodological 44 (2): 215–231. doi:https://doi.org/10.1016/j.trb.2009.07.007.
- Cacchiani, V., D. Huisman, M. Kidd, L. Kroon, P. Toth, L. Veelenturf, and J. Wagenaar. 2014. “An Overview of Recovery Models and Algorithms for Real-time Railway Rescheduling.” Transportation Research Part B: Methodological 63: 15–37. doi:https://doi.org/10.1016/j.trb.2014.01.009.
- Cacchiani, V., and P. Toth. 2012. “Nominal and Robust Train Timetabling Problems.” European Journal of Operational Research 219 (3): 727–737. doi:https://doi.org/10.1016/j.ejor.2011.11.003.
- Caimi, G., M. Fuchsberger, M. Laumanns, and M. Lüthi. 2012. “A Model Predictive Control Approach for Discrete-time Rescheduling in Complex Central Railway Station Areas.” Computers & Operations Research 39 (11): 2578–2593. doi:https://doi.org/10.1016/j.cor.2012.01.003.
- Caprara, A., M. Fischetti, and P. Toth. 2002. “Modeling and Solving the Train Timetabling Problem.” Operations Research 50 (5): 851–861. doi:https://doi.org/10.1287/opre.50.5.851.362.
- Caprara, A., M. Monaci, P. Toth, and P. L. Guida. 2006. “A Lagrangian Heuristic Algorithm for A Real-world Train Timetabling Problem.” Discrete Applied Mathematics 154 (5): 738–753. doi:https://doi.org/10.1016/j.dam.2005.05.026.
- Carey, M. 1994. “Extending a Train Pathing Model from One-way to Two-way Track.” Transportation Research Part B: Methodological 28 (5): 395–400. doi:https://doi.org/10.1016/0191-2615(94)90033-7.
- Carey, M., and D. Lockwood. 1995. “A Model, Algorithms and Strategy for Train Pathing.” Journal of the Operational Research Society 46 (8): 988–1005. doi:https://doi.org/10.1057/jors.1995.136.
- Chen, D., S. Ni, C. A. Xu, and X. Jiang. 2019. “Optimizing the Draft Passenger Train Timetable Based on Node Importance in a Railway Network.” Transportation Letters 11 (1): 20–32. doi:https://doi.org/10.1080/19427867.2016.1271523.
- Chen, D., S. Ni, H. Lv, M. Lv, and H. Li. 2015. “Genetic Algorithm Based on Conflict Detecting for Solving Departure Time Domains of Passenger Trains.” Transportation Letters 7 (4): 181–187. doi:https://doi.org/10.1179/1942787515Y.0000000009.
- Corman, F., A. D’Ariano, D. Pacciarelli, and M. Pranzo. 2010. “A Tabu Search Algorithm for Rerouting Trains during Rail Operations.” Transportation Research Part B: Methodological 44 (1): 175–192. doi:https://doi.org/10.1016/j.trb.2009.05.004.
- Corman, F., A. D’Ariano, D. Pacciarelli, and M. Pranzo. 2012. “Bi-objective Conflict Detection and Resolution in Railway Traffic Management.” Transportation Research Part C: Emerging Technologies 20 (1): 79–94. doi:https://doi.org/10.1016/j.trc.2010.09.009.
- Corman, F., R. M. Goverde, and A. D’Ariano. 2009. “Rescheduling Dense Train Traffic over Complex Station Interlocking Areas.” In Robust and Online Large-Scale Optimization, 369–386. Berlin, Heidelberg: Springer.
- D’ariano, A., D. Pacciarelli, and M. Pranzo. 2007. “A Branch and Bound Algorithm for Scheduling Trains in A Railway Network.” European Journal of Operational Research 183 (2): 643–657. doi:https://doi.org/10.1016/j.ejor.2006.10.034.
- D’Ariano, A., F. Corman, D. Pacciarelli, and M. Pranzo. 2008. “Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time.” Transportation Science 42 (4): 405–419. doi:https://doi.org/10.1287/trsc.1080.0247.
- Ding, T., and Z. Bie. 2017. “Parallel Augmented Lagrangian Relaxation for Dynamic Economic Dispatch Using Diagonal Quadratic Approximation Method.” IEEE Transactions on Power Systems 32 (2): 1115–1126. doi:https://doi.org/10.1109/TPWRS.2016.2576465.
- Fazlollahtabar, H. 2018. “Lagrangian Relaxation Method for Optimizing Delay of Multiple Autonomous Guided Vehicles.” Transportation Letters 10 (6): 354–360. doi:https://doi.org/10.1080/19427867.2017.1386871.
- Fischer, F., and T. Schlechte, 2017. “Strong Relaxations for the Train Timetabling Problem Using Connected Configurations.” 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), 59, 11: 1-11:6. https://doi.org/10.4230/OASIcs.ATMOS.2017.11
- Fisher, M. L. 2004. “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science 50 (12_supplement): 1861–1871. doi:https://doi.org/10.1287/mnsc.1040.0263.
- Goverde, R. M., N. Bešinović, A. Binder, V. Cacchiani, E. Quaglietta, R. Roberti, and P. Toth. 2016. “A Three-level Framework for Performance-based Railway Timetabling.” Transportation Research Part C: Emerging Technologies 67: 62–83. doi:https://doi.org/10.1016/j.trc.2016.02.004.
- Harrod, S. S. 2012. “A Tutorial on Fundamental Model Structures for Railway Timetable Optimization.” Surveys in Operations Research and Management Science 17 (2): 85–96. doi:https://doi.org/10.1016/j.sorms.2012.08.002.
- Lamorgese, L., C. Mannino, and M. Piacentini. 2016. “Optimal Train Dispatching by Benders’-like Reformulation.” Transportation Science 50 (3): 910–925. doi:https://doi.org/10.1287/trsc.2015.0605.
- Lusby, R. M., J. Larsen, M. Ehrgott, and D. M. Ryan. 2013. “A Set Packing Inspired Method for Real-time Junction Train Routing.” Computers & Operations Research 40 (3): 713–724. doi:https://doi.org/10.1016/j.cor.2011.12.004.
- Mackenzie, S., and G. Mills. 2008. “Scheduling a Heterogeneous Set of Trains over a Single Line Track Using Lagrangian Relaxation.” The ANZIAM Journal 50 (2): 266–281. doi:https://doi.org/10.1017/S1446181108080322.
- Meng, L., and X. Zhou. 2014. “Simultaneous Train Rerouting and Rescheduling on an N-track Network: A Model Reformulation with Network-based Cumulative Flow Variables.” Transportation Research Part B: Methodological 67: 208–234. doi:https://doi.org/10.1016/j.trb.2014.05.005.
- Oliveira, P., J. Blair-Fish, S. McKees, and C. Coles. 1992. “Parallel Lagrangian Relaxation in Power Scheduling.” Computing Systems in Engineering 3 (5): 609–612. doi:https://doi.org/10.1016/0956-0521(92)90029-I.
- Schlechte, T., R. Borndörfer, B. Erol, T. Graffagnino, and E. Swarat. 2011. “Micro–macro Transformation of Railway Networks.” Journal of Rail Transport Planning & Management 1 (1): 38–48. doi:https://doi.org/10.1016/j.jrtpm.2011.09.001.
- Szpigel, B. 1973. “Optimal Train Scheduling on a Single Line Railway.” Journal of Operations Research 72: 344–351.
- Veelenturf, L. P., D. Potthoff, D. Huisman, and L. G. Kroon. 2012. “Railway Crew Rescheduling with Retiming.” Transportation Research Part C: Emerging Technologies 20 (1): 95–110. doi:https://doi.org/10.1016/j.trc.2010.09.008.
- Wang, K., J. Desai, and H. He. 2015. “A Note on Augmented Lagrangian-based Parallel Splitting Method.” Optimization Letters 9 (6): 1199–1212. doi:https://doi.org/10.1007/s11590-014-0825-8.
- Xu, X., C. L. Li, and Z. Xu. 2018. “Integrated Train Timetabling and Locomotive Assignment.” Transportation Research Part B: Methodological 117: 573–593. doi:https://doi.org/10.1016/j.trb.2018.09.015.
- Yue, Y., S. Wang, L. Zhou, L. Tong, and M. R. Saat. 2016. “Optimizing Train Stopping Patterns and Schedules for High-speed Passenger Rail Corridors.” Transportation Research Part C: Emerging Technologies 63: 126–146. doi:https://doi.org/10.1016/j.trc.2015.12.007.
- Zhou, W., and H. Teng. 2016. “Simultaneous Passenger Train Routing and Timetabling Using an Efficient Train-based Lagrangian Relaxation Decomposition.” Transportation Research Part B: Methodological 94: 409–439. doi:https://doi.org/10.1016/j.trb.2016.10.010.
- Zhou, W., J. Tian, L. Xue, M. Jiang, L. Deng, and J. Qin. 2017. “Multi-periodic Train Timetabling Using a Period-type-based Lagrangian Relaxation Decomposition.” Transportation Research Part B: Methodological 105: 144–173. doi:https://doi.org/10.1016/j.trb.2017.08.005.
- Zhou, X., and M. Zhong. 2007. “Single-track Train Timetabling with Guaranteed Optimality: Branch-and-bound Algorithms with Enhanced Lower Bounds.” Transportation Research Part B: Methodological 41 (3): 320–341. doi:https://doi.org/10.1016/j.trb.2006.05.003.