IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i5p851-861.html
   My bibliography  Save this article

Modeling and Solving the Train Timetabling Problem

Author

Listed:
  • Alberto Caprara

    (DEIS, University of Bologna, Italy)

  • Matteo Fischetti

    (DEIS, University of Padova, Italy)

  • Paolo Toth

    (DEIS, University of Bologna, Italy)

Abstract

The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some operational constraints. In particular, we concentrate on the problem of a single, one-way track linking two major stations, with a number of intermediate stations in between. Each train connects two given stations along the track (possibly different from the two major stations) and may have to stop for a minimum time in some of the intermediate stations. Trains can overtake each other only in correspondence of an intermediate station, and a minimum time interval between two consecutive departures and arrivals of trains in each station is specified.In this paper, we propose a graph theoretic formulation for the problem using a directed multigraph in which nodes correspond to departures/arrivals at a certain station at a given time instant. This formulation is used to derive an integer linear programming model that is relaxed in a Lagrangian way. A novel feature of our model is that the variables in the relaxed constraints are associated only with nodes (as opposed to arcs) of the aforementioned graph. This allows a considerable speed-up in the solution of the relaxation. The relaxation is embedded within a heuristic algorithm which makes extensive use of the dual information associated with the Lagrangian multipliers. We report extensive computational results on real-world instances provided from Ferrovie dello Stato SpA, the Italian railway company, and from Ansaldo Segnalamento Ferroviario SpA.

Suggested Citation

  • Alberto Caprara & Matteo Fischetti & Paolo Toth, 2002. "Modeling and Solving the Train Timetabling Problem," Operations Research, INFORMS, vol. 50(5), pages 851-861, October.
    • Handle: RePEc:inm:oropre:v:50:y:2002:i:5:p:851-861
    DOI: 10.1287/opre.50.5.851.362
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.5.851.362
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.50.5.851.362?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    2. Harker, Patrick T. & Hong, Sungwook, 1994. "Pricing of track time in railroad operations: An internal market approach," Transportation Research Part B: Methodological, Elsevier, vol. 28(3), pages 197-212, June.
    3. U. Brännlund & P. O. Lindberg & A. Nõu & J.-E. Nilsson, 1998. "Railway Timetabling Using Lagrangian Relaxation," Transportation Science, INFORMS, vol. 32(4), pages 358-369, November.
    4. Dejan Jovanović & Patrick T. Harker, 1991. "Tactical Scheduling of Rail Operations: The SCAN I System," Transportation Science, INFORMS, vol. 25(1), pages 46-64, February.
    5. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Meng, Lingyun & Zhou, Xuesong, 2011. "Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1080-1102, August.
    2. Li, Feng & Sheu, Jiuh-Biing & Gao, Zi-You, 2014. "Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 385-414.
    3. Lee, Yusin & Chen, Chuen-Yih, 2009. "A heuristic for the train pathing and timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 837-851, September.
    4. Talebian, Ahmadreza & Zou, Bo, 2015. "Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 114-140.
    5. Ernst Althaus & Stefan Canzar, 2008. "A Lagrangian relaxation approach for the multiple sequence alignment problem," Journal of Combinatorial Optimization, Springer, vol. 16(2), pages 127-154, August.
    6. Yu-Jun Zheng, 2018. "Emergency Train Scheduling on Chinese High-Speed Railways," Transportation Science, INFORMS, vol. 52(5), pages 1077-1091, October.
    7. Martin-Iradi, Bernardo & Ropke, Stefan, 2022. "A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing," European Journal of Operational Research, Elsevier, vol. 297(2), pages 511-531.
    8. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    9. Kraay, David R. & Harker, Patrick T., 1995. "Real-time scheduling of freight railroads," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 213-229, June.
    10. Zhou, Xuesong & Zhong, Ming, 2007. "Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 320-341, March.
    11. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    12. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    13. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    14. Formaneck, Steven D. & Cozzarin, Brian P., 2013. "Technology adoption and training practices as a constrained shortest path problem," Omega, Elsevier, vol. 41(2), pages 459-472.
    15. Polinder, G.-J. & Cacchiani, V. & Schmidt, M.E. & Huisman, D., 2020. "An iterative heuristic for passenger-centric train timetabling with integrated adaption times," ERIM Report Series Research in Management ERS-2020-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Li, Feng & Gao, Ziyou & Li, Keping & Yang, Lixing, 2008. "Efficient scheduling of railway traffic based on global information of train," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 1008-1030, December.
    17. Carey, Malachy & Kwiecinski, Andrzej, 1995. "Properties of expected costs and performance measures in stochastic models of scheduled transport," European Journal of Operational Research, Elsevier, vol. 83(1), pages 182-199, May.
    18. Enrique Castillo & Inmaculada Gallego & José Ureña & José Coronado, 2009. "Timetabling optimization of a single railway track line with sensitivity analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 256-287, December.
    19. Fischetti, M. & Kroon, L.G. & Timmer, G. & Vromans, M.J.C.M. & Abbink, E.J.W., 2004. "Reinventing Crew Scheduling at Netherlands Railways," ERIM Report Series Research in Management ERS-2004-046-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    20. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:50:y:2002:i:5:p:851-861. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.