IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v30y1996i6p455-464.html
   My bibliography  Save this article

A constraint generation algorithm for the construction of periodic railway timetables

Author

Listed:
  • Odijk, Michiel A.

Abstract

This paper addresses the problem of constructing periodic timetables for train operations. We use a mathematical model consisting of periodic time window constraints by means of which arrival and departure times can be related pairwise on a clock, rather than on a linear time axis. Constructing a timetable, then, means solving a set of such constraints. This problem is known to be hard, i.e. it is NP-complete. We describe a new algorithm to solve the problem based on constraint generation and work out a real-life example. It appears that, for problem instances of modest, yet non-trivial, size, the algorithm performs very well, which opens a way to thorough performance analysis of railway systems by studying a large number of possible future timetables.

Suggested Citation

  • Odijk, Michiel A., 1996. "A constraint generation algorithm for the construction of periodic railway timetables," Transportation Research Part B: Methodological, Elsevier, vol. 30(6), pages 455-464, December.
  • Handle: RePEc:eee:transb:v:30:y:1996:i:6:p:455-464
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(96)00005-7
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Serafini, Paolo & Ukovich, Walter, 1989. "A mathematical model for the fixed-time traffic control problem," European Journal of Operational Research, Elsevier, vol. 42(2), pages 152-165, September.
    2. Gertsbakh, Ilya & Serafini, Paolo, 1991. "Periodic transportation schedules with flexible departure times : An interactive approach based on the periodic event scheduling problem and the deficit function approach," European Journal of Operational Research, Elsevier, vol. 50(3), pages 298-309, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cacchiani, Valentina & Toth, Paolo, 2012. "Nominal and robust train timetabling problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 727-737.
    2. repec:eee:transb:v:105:y:2017:i:c:p:144-173 is not listed on IDEAS
    3. Kroon, L.G. & Peeters, L.W.P. & Wagenaar, J.C. & Zuidwijk, R.A., 2012. "Flexible Connections in PESP Models for Cyclic Passenger Railway Timetabling," ERIM Report Series Research in Management ERS-2012-008-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.
    4. Barrena, Eva & Canca, David & Coelho, Leandro C. & Laporte, Gilbert, 2014. "Single-line rail rapid transit timetabling under dynamic passenger demand," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 134-150.
    5. Burdett, R.L. & Kozan, E., 2010. "A disjunctive graph model and framework for constructing new train schedules," European Journal of Operational Research, Elsevier, vol. 200(1), pages 85-98, January.
    6. Odijk, Michiel A., 1999. "Sensitivity analysis of a railway station track layout with respect to a given timetable," European Journal of Operational Research, Elsevier, vol. 112(3), pages 517-530, February.
    7. Guo, Xin & Sun, Huijun & Wu, Jianjun & Jin, Jiangang & Zhou, Jin & Gao, Ziyou, 2017. "Multiperiod-based timetable optimization for metro transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 46-67.
    8. Carey, Malachy & Crawford, Ivan, 2007. "Scheduling trains on a network of busy complex stations," Transportation Research Part B: Methodological, Elsevier, vol. 41(2), pages 159-178, February.
    9. Dennis Huisman & Leo G. Kroon & Ramon M. Lentink & Michiel J. C. M. Vromans & Dennis Huisman & Leo G. Kroon & Ramon M. Lentink & Michiel J. C. M. Vromans, 2005. "Operations Research in passenger railway transportation," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 59(4), pages 467-497.
    10. Cacchiani, Valentina & Furini, Fabio & Kidd, Martin Philip, 2016. "Approaches to a real-world Train Timetabling Problem in a railway node," Omega, Elsevier, vol. 58(C), pages 97-110.
    11. Robenek, Tomáš & Maknoon, Yousef & Azadeh, Shadi Sharif & Chen, Jianghang & Bierlaire, Michel, 2016. "Passenger centric train timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 107-126.
    12. Sparing, Daniel & Goverde, Rob M.P., 2017. "A cycle time optimization model for generating stable periodic railway timetables," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 198-223.
    13. Kang, Liujiang & Wu, Jianjun & Sun, Huijun & Zhu, Xiaoning & Gao, Ziyou, 2015. "A case study on the coordination of last trains for the Beijing subway network," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 112-127.
    14. Sels, P. & Dewilde, T. & Cattrysse, D. & Vansteenwegen, P., 2016. "Reducing the passenger travel time in practice by the automated construction of a robust railway timetable," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 124-156.
    15. Cordone, Roberto & Redaelli, Francesco, 2011. "Optimizing the demand captured by a railway system with a regular timetable," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 430-446, February.
    16. repec:spr:compst:v:62:y:2005:i:2:p:281-295 is not listed on IDEAS
    17. Chakroborty, Partha & Vikram, Durgesh, 2008. "Optimum assignment of trains to platforms under partial schedule compliance," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 169-184, February.
    18. Carey, Malachy & Carville, Sinead, 2003. "Scheduling and platforming trains at busy complex stations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(3), pages 195-224, March.
    19. Thomas Lindner & Uwe Zimmermann, 2005. "Cost optimal periodic train scheduling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(2), pages 281-295, November.
    20. Van Aken, Sander & Bešinović, Nikola & Goverde, Rob M.P., 2017. "Designing alternative railway timetables under infrastructure maintenance possessions," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 224-238.

    More about this item

    Statistics

    Access and download statistics

    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:eee:transb:v:30:y:1996:i:6:p:455-464. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.