Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area

Transportation Planning and Technology

Volumn 34, Issue 4, 2011, Pages 341-362

  Corman, F ^a   D'Ariano, A ^a,b   Pranzo, M ^c   Hansen, I A ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b ROMA TRE UNIVERSITY   (Italy)

^c UNIVERSITY OF SIENA   (Italy)

Author keywords

Alternative graph incompatibility graph; Dispatching support tool; Rerouting; Rescheduling; Utrecht

Indexed keywords

DISPATCHING SUPPORT TOOL; INCOMPATIBILITY GRAPH; REROUTING; RESCHEDULING; UTRECHT;

RAILROADS;

COMPUTER CIRCUITS;

ALGORITHM; COMPLEXITY; RAILWAY; TRAFFIC MANAGEMENT; TRANSPORTATION PLANNING;

NETHERLANDS; UTRECHT [NETHERLANDS];

EID: 79958004969     PISSN: 03081060     EISSN: 10290354     Source Type: Journal    
DOI: 10.1080/03081060.2011.577152     Document Type: Article

References (29)

1. Aytug, H., et al., 2005. Executing production schedules in the face of uncertainties: a review and some future directions. European Journal of Operational Research, 161 (1), 86-110.
2. Bailey, C., 1995. European railway signalling. London: A & C Black.
3. Berends, N. and Ouburg, N., 2005. Beschrijving ARI-functionaliteit (in Dutch). Utrecht: ProRail Internal Specification, Technical Report 20.
4. Caimi, G., et al., 2009. Design of a railway scheduling model for dense services. Networks and Spatial Economics, 9 (1), 25-46.
5. Carey, M. and Crawford, I., 2007. Scheduling trains on a network of busy complex stations. Transportation Research, Part B, 41 (2), 159-178.
6. Corman, F., Goverde, R.M.P., and D'Ariano, A. 2009. Rescheduling dense train traffic over complex station interlocking areas. In: R.K. Ahuja, R. Moehring, and C. Zaroliagis, eds. Robust and online large-scale optimization, lecture notes in computer science, vol. 5868. Berlin: Springer-Verlag, 369-386.
7. Corman, F., et al., 2010. A tabu search algorithm for rerouting trains during rail operations. Transportation Research, Part B, 44 (1), 175-192.
8. Daamen, W., Goverde, R.M.P., and Hansen, I.A., 2009. Non-discriminatory automatic and distinct registration of primary and secondary train delays. Networks and Spatial Economics, 9 (1), 47-61.
9. D'Ariano, A., 2008. Improving real-time train dispatching: models, algorithms and applications. Thesis (PhD). Delft University of Technology.
10. D'Ariano, A., Pacciarelli, D., and Pranzo, M., 2007. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research, 183 (2), 643-657.
11. D'Ariano, A., Pranzo, M., and Hansen, I.A., 2007. Conflict resolution and train speed coordination for solving real-time timetable perturbations. IEEE Transactions on Intelligent Transportation Systems, 8 (2), 208-222.
12. D'Ariano, A. and Pranzo, M, 2008. An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances. Networks and Spatial Economics, 9 (1), 63-84.
13. D'Ariano, A., et al., 2008. Reordering and local rerouting strategies to manage train traffic in real-time. Transportation Science, 42 (4), 405-419.
14. Hansen, I.A. and Pachl, J., 2008. Railway timetable and traffic: analysis, modeling and simulation. Hamburg: Eurailpress.
15. Hozak, K. and Hill, J.A. Issues and opportunities regarding replanning and rescheduling frequencies. International Journal of Production Economics, 47 (18), 4955-4970.
16. Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness. University of California, LA: Management Science Research Project, Technical Report 43.
17. Jacobs, J., 2004. Reducing delays by means of computer-aided 'on-the-spot' rescheduling. In: J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, and S. Sone, eds. Computers in railways IX. Southampton: WIT Press, 603-612.
18. Lüthi, M., Medeossi, G., and Nash, A., 2007. Evaluation of an Integrated Real Time Rescheduling and Train Control System for Heavily Used Areas. In: I.A. Hansen, A. Radtke, J. Pachl, and E. Wendler, eds. Proceedings of the 2nd international seminar on railway operations modelling and analysis [CD-ROM], 28-30 March 2007, Hannover, 1-14.
19. Mascis, A. and Pacciarelli, D., 2002. Job shop scheduling with blocking and no wait constraints. European Journal of Operational Research, 143, 498-517.
20. Mazzarello, M. and Ottaviani, E., 2007. A traffic management system for real-time traffic optimisation in railways. Transportation Research, Part B, 41 (2), 246-274.
21. Pinedo, M., 1995. Scheduling: theory, algorithms and system. Upper Saddle River, NJ: Prentice Hall.
22. Rodriguez, J., 2007. A study of the use of state resources in a constraint-based model for routing and scheduling trains. In: I.A. Hansen, A. Radtke, J. Pachl, and E. Wendler, eds. Proceedings of the 2nd international seminar on railway operations modelling and analysis [CD-ROM], 28-30 March 2007, Hannover, 1-14.
23. Schrijver, A. and Steenbeek, A., 1994. Dienstregelingontwikkeling voor railned: rapport CADANS 1.0 (In Dutch). Amsterdam: Centrum voorWiskunde en Informatica, Technical report.
24. Serafini, P. and Ukovich, W., 1989. A mathematical model for periodic event scheduling problems. SIAM Journal on Discrete Mathematics, 2 (4), 550-581.
25. Törnquist, J. and Persson, J.A., 2007. N-tracked railway traffic re-scheduling during disturbances. Transportation Research, Part B, 41 (3), 342-362.
26. Vieira, G.H., Herrmann, J.W., and Lin, E., 2003. Rescheduling manufacturing systems: a framework of strategies, policies, and methods. Journal of Scheduling, 6 (1), 39-62.
27. Wegele, S., Corman, F., and D'Ariano, A., 2008. Comparing the effectiveness of two realtime train rescheduling systems in case of perturbed traffic conditions. In: J. Allan, E. Arias, C.A. Brebbia, C. Goodman, A.F. Rumsey, G. Sciutto, and N. Tomii, eds. Computers in railways XI. Southampton: WIT Press, 535-544.
28. Yuan, J., 2006. Stochastic modelling of train delays and delay propagation in stations. Thesis (PhD). Delft University of Technology.
29. Zwaneveld, P.J., et al., 1996. Routing trains through railway stations: model formulation and algorithms. Transportation Science, 30, 181-194.