A disjunctive graph model and framework for constructing new train schedules

European Journal of Operational Research

Volumn 200, Issue 1, 2010, Pages 85-98

  Burdett, R L ^a   Kozan, E ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Job shop scheduling; Train scheduling

Indexed keywords

COMPUTATIONAL EFFORT; CONSTRUCTIVE ALGORITHMS; CURRENT TECHNIQUES; GRAPH MODEL; GRAPH REPRESENTATION; ITERATIVE REFINEMENT; JOB SHOP; JOB SHOP SCHEDULING; META HEURISTICS; NUMERICAL INVESTIGATIONS; STAND -ALONE; TIME-CONSUMING TASKS; TRAIN SCHEDULE; TRAIN SCHEDULING;

ALGORITHMS;

EID: 69249227506     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.12.005     Document Type: Article

References (38)

1. Adenso-Diaz B., Gonzalez M.O., and Gonzalez-Torre P. On line timetable re-scheduling in train services. Transportation Research Part B 33 (1999) 387-398
2. Billionnet A. Using integer programming to solve the train platforming problem. Transportation Science 37 2 (2003) 213-222
3. Brannlund U., Lindberg P.O., Nou A., and Nillson J.-E. Railway timetabling using lagrangian relaxation. Transportation Science 32 (1998) 358-369
4. 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.
5. Burdett R., and Kozan E. Techniques for absolute capacity determination in railways. Transportation Research Part B 40 8 (2006) 616-632
6. Cai X., and Goh C.J. A fast heuristic for the train scheduling problem. Computers and Operations Research 21 5 (1994) 499-510
7. Cai X., Goh C.J., and Mees A.I. Greedy heuristics for rapid scheduling of trains on a single track. IIE Transactions 30 (1998) 481-493
8. Carey, M., Lockwood, D., 1992. A model, algorithms and strategy for train pathing. Journal of the Operational Research Society. Research Report, Faculty of Business and Management, University of Ulster, North Ireland.
9. Carey M. A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Research Part B 28 5 (1994) 333-353
10. Carey M. Extending a train pathing model from one-way to two-way track. Transportation Research Part B 28 5 (1994) 395-400
11. Carey M., and Carville S. Scheduling and platforming trains at busy complex stations. Transportation Research Part A 37 (2003) 195-224
12. Chiang T.W., Hau H.Y., Chiang H.M., Ko S.Y., and Hsieh C.H. Knowledge based system for railway scheduling. Data and Knowledge Engineering 27 (1998) 289-312
13. Cordeau J.F., Toth P., and Vigo D. A survey of optimisation models for train routing and scheduling. Transportation Science 32 (1998) 380-404
14. Corry P., and Kozan E. Job scheduling with technical constraints. Journal of the Operational Research Society 55 (2004) 160-169
15. Dauzere-Peres S., and Paulli J. An integrated approach for modelling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research 70 (1997) 281-306
16. Dorfman M.J., and Medanic J. Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research Part B 38 (2004) 81-98
17. Goverde R.M.P. Improving punctuality and transfer reliability by railway timetable optimisation. In: Bovy P. (Ed). Proceedings of the TRAIL fifth Annual Congress vol. 2 (1999), Delft, The Netherlands
18. Ghoseiri K., Szidarovszsky F., and Asgharpour M.J. A multi-objective train scheduling model and solution. Transportation Research Part B 38 (2004) 927-952
19. Higgins A., Kozan E., and Ferreira L. Optimal scheduling of trains on a single line track. Transportation Research Part B 30 2 (1996) 147-161
20. Higgins A., Kozan E., and Ferreira L. Heuristic techniques for single line train scheduling. Journal of Heuristics 3 (1997) 43-62
21. Kis T. Job shop scheduling with processing alternatives. European Journal of Operational Research 151 (2003) 307-332
22. Kozan E., and Burdett R. A railway capacity determination model and rail access charging methodologies. Transportation Planning and Technology 28 1 (2005) 27-45
23. Kroon L.G., Romeijn H.E., and Zwaneveld P.J. Routing trains through railway stations: Complexity issues. European Journal of Operational Research 98 (1997) 485-498
24. Kroon L.G., and Peeters W.P. A variable trip time model for cyclic railway timetabling. Transportation Science 37 2 (2003) 198-212
25. Lindner, T., 2000. Train schedule optimisation in public rail transport, Ph.D. thesis, Technical University Braunschweig, Braunschweig, Germany.
26. Mascis A., and Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143 (2002) 498-517
27. Mastrolilli M., and Gambardella L.M. Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling 3 (2000) 3-20
28. Mati Y., Rezg N., and Xie X. A taboo search approach for deadlock free scheduling of automated manufacturing systems. Journal of Intelligent Manufacturing 12 (2001) 535-552
29. Murovec B., and Suhel P. A repairing technique for the local search of the job shop problem. European Journal of Operational Research 153 (2004) 220-238
30. Nowicki E. The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research 116 (1999) 205-219
31. Odijk M.A. A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research 30 (1996) 455-464
32. Romeijn H.E., Salomon M., Dauzere Peres S., van Hoesel S.P.M., and Ambergen H.W. Routing trains through railway stations: Model formulation and algorithms. Transportation Science 30 (1996) 181-194
33. Sahin I. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research Part B 33 (1999) 511-534
34. Werner F., and Winkler A. Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics 58 (1995) 191-211
35. Zwaneveld P.J., Kroon L.G., Romeijn H.E., Salomon M., Dauzere Peres S., Stan C.P.M., van Hoesel, and Ambergen H.W. Routing trains through railway stations: model formulation and algorithms. Transportation Science 30 (1996) 181-194
36. Zwaneveld P.J., Kroon L.G., Zwaneveld P.J., Kroon L.G., and Van Hoesel S. Routing trains through a railway station based on a node packing model. European Journal of Operational Research 128 (2001) 14-33
37. Zhou X., and Zhong M. Bicriteria train scheduling for high speed passenger railroad planning applications. European Journal of Operational Research 167 (2005) 752-771
38. Zogby J., Wesley Barnes J., and Hasenbein J.J. Modelling the re-entrant job shop scheduling problem with setups for meta-heuristic searches. European Journal of Operational Research 167 (2005) 336-348