Skip to main content
SpringerLink
Log in

A sequencing approach for creating new train timetables

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

Train scheduling is a complex and time consuming task of vital importance. To schedule trains more accurately and efficiently than permitted by current techniques a novel hybrid job shop approach has been proposed and implemented. Unique characteristics of train scheduling are first incorporated into a disjunctive graph model of train operations. A constructive algorithm that utilises this model is then developed. The constructive algorithm is a general procedure that constructs a schedule using insertion, backtracking and dynamic route selection mechanisms. It provides a significant search capability and is valid for any objective criteria. Simulated Annealing and Local Search meta-heuristic improvement algorithms are also adapted and extended. An important feature of these approaches is a new compound perturbation operator that consists of many unitary moves that allows trains to be shifted feasibly and more easily within the solution. A numerical investigation and case study is provided and demonstrates that high quality solutions are obtainable on real sized applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adenso-Diaz B, Gonzalez MO, Gonzalez-Torre P (1999) On line timetable re-scheduling in train services. Transp Res Part B 33: 387–398

    Article  Google Scholar 

  • Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega Int J Manage Sci 27: 219–239

    Article  Google Scholar 

  • Billionnet A (2003) Using integer programming to solve the train platforming problem. Transp Sci 37(2): 213–222

    Article  Google Scholar 

  • Brannlund U, Lindberg PO, Nou A, Nillson J-E (1998) Railway timetabling using lagrangian relaxation. Transp Sci 32: 358–369

    Article  Google Scholar 

  • Burdett R, Kozan E (2004) Absolute capacity determination and timetabling in railways. In: Proceedings of the fifth Asia Pacific industrial engineering and management systems conference, APIEMS 2004

  • Burdett R, Kozan E (2006) Techniques for absolute capacity determination in Railways. Transp Res B 40(8): 616–632

    Article  Google Scholar 

  • Cai X, Goh CJ (1994) A fast heuristic for the train scheduling problem. Comput Oper Res 21(5): 499–510

    Article  Google Scholar 

  • Cai X, Goh CJ, Mees AI (1998) Greedy heuristics for rapid scheduling of trains on a single track. IIE Trans 30: 481–493

    Article  Google Scholar 

  • Candido MAB, Khator SK, Barcia RM (1998) A genetic algorithm based procedure for more realistic job shop scheduling. Int J Prod Res 36(12): 3437–3457

    Article  Google Scholar 

  • Carey M (1994a) A model and strategy for train pathing with choice of lines, platforms, and routes. Transp Res B 28(5): 333–353

    Article  Google Scholar 

  • Carey M (1994b) Extending a train pathing model from one-way to two-way track. Transp Res B 28(5): 395–400

    Article  Google Scholar 

  • Carey M, Carville S (2003) Scheduling and platforming trains at busy complex stations. Transp Res A 37: 195–224

    Google Scholar 

  • Carey M, Lockwood D (1992) A model, algorithms and strategy for train pathing. Research Report, Faculty of Business and Management, University of Ulster, North Ireland. J Oper Res Soc

  • Chiang TW, Hau HY, Chiang HM, Ko SY, Hsieh CH (1998) Knowledge based system for railway scheduling. Data Knowl Eng 27: 289–312

    Article  Google Scholar 

  • Cordeau JF, Toth P, Vigo D (1998) A survey of optimisation models for train routing and scheduling. Transp Sci 32: 380–404

    Article  Google Scholar 

  • Corry P, Kozan E (2004) Job scheduling with technical constraints. J Oper Res Soc 55: 160–169

    Article  Google Scholar 

  • Daniels RL, Hua SY, Webster S (1999) Heuristics for parallel machine flexible resource scheduling problems with unspecified job assignment. Comput Oper Res 26: 143–155

    Article  Google Scholar 

  • Dauzere-Peres S, Paulli J (1997) An integrated approach for modelling and solving the multiprocessor job shop scheduling problem using tabu search. Ann Oper Res 70: 281–306

    Article  Google Scholar 

  • Dorfman MJ, Medanic J (2004) Scheduling trains on a railway network using a discrete event model of railway traffic. Transp Res B 38: 81–98

    Article  Google Scholar 

  • Goverde RMP (1999) Improving punctuality and transfer reliability by railway timetable optimisation. In: Bovy P (ed) Proceedings of TRAIL 5th annual congress, vol 2. Delft, The Netherlands

  • Groflin H, Klinkert A (2007) Feasible insertions in job shop scheduling, short cycles and stable sets. Eur J Oper Res 177: 763–785

    Article  Google Scholar 

  • Higgins A, Kozan E, Ferreira L (1996) Optimal scheduling of trains on a single line track. Transp Res B 30(2): 147–161

    Article  Google Scholar 

  • Higgins A, Kozan E, Ferreira L (1997) Heuristic techniques for single line train scheduling. J Heuristics 3: 43–62

    Article  Google Scholar 

  • Khosla I (1995) The scheduling problem where multiple machines compete for a common buffer. Eur J Oper Res 84: 330–342

    Article  Google Scholar 

  • Kim DW, Na DG, Chen F (2003) Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot Comput Integr Manuf 19: 173–181

    Article  Google Scholar 

  • Kim YK, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30: 1151–1171

    Article  Google Scholar 

  • Kis T (2003) Job shop scheduling with processing alternatives. Eur J Oper Res 151: 307–332

    Article  Google Scholar 

  • Kozan E, Burdett R (2005) A Railway capacity determination model and rail access charging methodologies. Transp Plann Technol 28(1): 27–45

    Article  Google Scholar 

  • Kroon LG, Peeters WP (2003) A variable trip time model for cyclic railway timetabling. Transp Sci 37(2): 198–212

    Article  Google Scholar 

  • Kroon LG, Romeijn HE, Zwaneveld PJ (1997) Routing trains through railway stations: complexity issues. Eur J Oper Res 98: 485–498

    Article  Google Scholar 

  • Kolonko M (1999) Some new results on simulated annealing applied to the job shop scheduling problem. Eur J Oper Res 113: 123–136

    Article  Google Scholar 

  • Lindner T (2000) Train schedule optimisation in public rail transport. PhD Thesis, Technical University Braunschweig, Braunschweig

  • Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143: 498–517

    Article  Google Scholar 

  • Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Scheduling 3: 3–20

    Article  Google Scholar 

  • Mati Y, Rezg N, Xie X (2001) A taboo search approach for deadlock free scheduling of automated manufacturing systems. J Intell Manuf 12: 535–552

    Article  Google Scholar 

  • Mattfeld DC, Bierwirth C (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur J Oper Res 155: 616–630

    Article  Google Scholar 

  • Murovec B, Suhel P (2004) A repairing technique for the local search of the job shop problem. Eur J Oper Res 153: 220–238

    Article  Google Scholar 

  • Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine n-job flow shop sequencing problem. Omega 11(1): 91–95

    Article  Google Scholar 

  • Nowicki E (1999) The permutation flow shop with buffers: a tabu search approach. Eur J Oper Res 116: 205–219

    Article  Google Scholar 

  • Odijk MA (1996) A constraint generation algorithm for the construction of periodic railway timetables. Transp Res 30: 455–464

    Article  Google Scholar 

  • Sahin I (1999) Railway traffic control and train scheduling based on inter-train conflict management. Transp Res B 33: 511–534

    Article  Google Scholar 

  • Steinhofel K, Albrecht A, Wong CK (1999) Two simulated annealing based heuristics for the job shop scheduling problem. Eur J Oper Res 118: 524–548

    Article  Google Scholar 

  • Van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Operations Research 40(1): 113–125

    Article  Google Scholar 

  • Werner F, Winkler A (1995) Insertion techniques for the heuristic solution of the job shop problem. Discrete Appl Math 58: 191–211

    Article  Google Scholar 

  • Zoghby J, Barnes JW, Hasenbein JJ (2005) Modelling the re-entrant job shop scheduling problem with setups for meta-heuristic searches. Eur J Oper Res 167: 336–348

    Article  Google Scholar 

  • Zwaneveld PJ, Kroon LG, Romeijn HE, Salomon M, Dauzere Peres S, van Hoesel CPMS, Ambergen HW (1996) Routing trains through railway stations: model formulation and algorithms. Transp Sci 30: 181–194

    Article  Google Scholar 

  • Zwaneveld PJ, Kroon LG, Van Hoesel SPM (2001) Routing trains through a railway station based on a node packing model. Eur J Oper Res 128: 14–33

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Queensland University of Technology, PO Box 2434, 4001, Brisbane, QLD, Australia

    R. L. Burdett & E. Kozan

Authors
  1. R. L. Burdett
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Kozan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Kozan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdett, R.L., Kozan, E. A sequencing approach for creating new train timetables. OR Spectrum 32, 163–193 (2010). https://doi.org/10.1007/s00291-008-0143-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-008-0143-6

Keywords

Search

Navigation