Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time

Published Online:https://doi.org/10.1287/trsc.1080.0247

References

  • Adenso-Díaz B., González M. O., González-Torre P. On-line timetable re-scheduling in regional train services. Transportation Res. Part B (1999) 33:387–398CrossrefGoogle Scholar
  • Balas E. Machine sequencing via disjunctive graphs: An implicit enumeration approach. Oper. Res. (1969) 17:941–957LinkGoogle Scholar
  • Berends N., Ouburg N. Beschrijving ARI-functionaliteit. (2005) . Technical report, ProRail Internal Specification. (In Dutch)Google Scholar
  • Bertsimas D., Patterson S. S. The traffic flow management rerouting problem in air traffic control: A dynamic network flow approach. Transportation Sci. (2000) 34(3):239–255LinkGoogle Scholar
  • Bianco L., Dell'Olmo P., Giordani S. Scheduling models for air traffic control in terminal areas. J. Scheduling (2006) 9:223–253CrossrefGoogle Scholar
  • Caimi G., Burkolter D., Herrmann T., Fleuren H. Finding delay-tolerant train routings through stations. Oper. Res. Proc. 2004: Selected Papers of the Annual Internat. Conf. German Oper. Res. Soc. (GOR) (2005) (Springer Verlag, Tilburg, The Netherlands) 136–143CrossrefGoogle Scholar
  • Carey M., Carville S. Scheduling and platforming trains at busy complex stations. Transportation Res. Part A (2003) 37(3):195–224Google Scholar
  • Cordeau J. F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32(4):380–420LinkGoogle Scholar
  • D'Ariano A., Pacciarelli D., Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. (2007) 183:643–657CrossrefGoogle Scholar
  • Delorme X. Modélisation et résolution de problèmes liés à l'exploitation d'infrastructures ferroviaires. (2003) . Ph.D. thesis, Universite de Valenciennes, Valenciennes, FranceGoogle Scholar
  • Delorme X., Rodriguez J., Gandibleux X. Heuristics for railway infrastructure saturation. Electronic Notes Theoret. Comput. Sci. (2001) 50(1):39–53CrossrefGoogle Scholar
  • Dessouky M. M., Lu Q., Zhao J., Leachman R. C. An exact solution procedure to determine the optimal dispatching times for complex rail networks. IIE Trans. (2006) 38(2):141–152CrossrefGoogle Scholar
  • Dorfman M. J., Medanic J. Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Res. Part B (2004) 38:81–98CrossrefGoogle Scholar
  • Fioole P., Kroon L. G., Maroti G., Schrijver A. A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. (2006) 174(2):1281–1297CrossrefGoogle Scholar
  • Gandibleux X., Jorge J., Angibaud S., Delorme X., Rodriguez J. An ant colony optimization inspired algorithm for the set packing problem with application to railway infrastructure. Proc. Sixth Metaheuristics Internat. Conf. (MIC2005) (2005) Vienna:390–396Google Scholar
  • Higgins A., Kozan E. Heuristic techniques for single line train scheduling. J. Heuristics (1997) 3:43–62CrossrefGoogle Scholar
  • Higgins A., Kozan E., Ferreira L. Optimal scheduling of trains on a single line track. Transportation Res. Part B (1996) 30:147–161CrossrefGoogle Scholar
  • Hooghiemstra J. S., Kroon L. G., Odijk M. A., Salomon M., Zwaneveld P. J. Decision support systems support the search for win-win solutions in railway network design. Interfaces (1999) 29(2):15–32LinkGoogle Scholar
  • Kroon L. G., Romeijn H., Zwaneweld P. J. Routing trains through railway networks: Complexity issues. Eur. J. Oper. Res. (1997) 98:485–498CrossrefGoogle Scholar
  • Lusby R., Larsen J., Ryan D., Ehrgott M. Routing trains through railway junctions: A new set packing approach. (2006) . Technical Report 2006-21, Informatics and Mathematical Modelling, Technical University of Denmark, CopenhagenGoogle Scholar
  • Mascis A., Pacciarelli D. Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. (2002) 143(3):498–517CrossrefGoogle Scholar
  • Mascis A., Pacciarelli D., Pranzo M., Hickman M., Mirchandani P., Voss S. Scheduling models for short-term railway traffic optimization. Lecture Notes in Economics and Mathematical Systems 600: Computer-Aided Systems in Public Transport (2008) (Springer, Berlin) 71–90CrossrefGoogle Scholar
  • Mazzarello M., Ottaviani E. A traffic management system for real-time traffic optimization in railways. Transportation Res. Part B (2007) 41(2):246–274CrossrefGoogle Scholar
  • Nie L., Hansen I. A. System analysis of train operations and track occupancy at railway stations. Eur. J. Transport Infrastructure Res. (2005) 5(1):31–54Google Scholar
  • Oliveira E., Smith B. M. A job-shop scheduling model for the single-track railway scheduling problem. (2000) . School of Computing Research Report 2000.21, University of Leeds, Leeds, UKGoogle Scholar
  • Pachl J.Railway Operation and Control (2002) (VTD Rail Publishing, Mountlake Terrace, WA) Google Scholar
  • Rodriguez J. A constraint programming model for real-time trains scheduling at junctions. Transportation Res. Part B (2007) 41(2):231–245CrossrefGoogle Scholar
  • Şahin İ. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Res. Part B (1999) 33:511–534CrossrefGoogle Scholar
  • Schöbel A. A model for the delay management problem based on mixed-integer-programming. Electron. Notes Theor. Comput. Sci. (2001) 50(1):1–10CrossrefGoogle Scholar
  • Szpigel B., Ross M. Optimal train scheduling on a single track railway. Operational Research '72 (1973) (North Holland Publishing Co., Amsterdam) 343–352Google Scholar
  • Törnquist J., Persson J. A. N-tracked railway traffic re-scheduling during disturbances. Transportation Res. Part B (2007) 41(3):342–362CrossrefGoogle Scholar
  • Zwaneveld P. J., Kroon L. G., van Hoesel S. P. M. Routing trains through a railway station based on a node packing model. Eur. J. Oper. Res. (2001) 128:14–33CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.