Rescheduling models for railway traffic management in large-scale networks
详细信息    查看全文
  • 作者:Pavle Kecman (1)
    Francesco Corman (2)
    Andrea D’Ariano (3)
    Rob M. P. Goverde (1)
  • 关键词:Alternative graph ; Delay propagation ; Macroscopic modeling ; Railway traffic management ; Timed event graph
  • 刊名:Public Transport
  • 出版年:2013
  • 出版时间:September 2013
  • 年:2013
  • 卷:5
  • 期:1-2
  • 页码:95-123
  • 全文大小:1245KB
  • 参考文献:1. Berger A, Gebhardt A, Müller-Hannemann M, Ostrowski M (2011) Stochastic delay prediction in large train networks. In: Caprara A, Kontogiannis J (eds) 11th workshop on algorithmic approaches for transportation modelling, optimization, and systems. Dagstuhl, Germany, pp?100-11
    2. Caimi G, Burkolter D, Herrmann T, Chudak F, Laumanns M (2009) Design of a railway scheduling model for dense services. Netw Spat Econ 9(1):25-6 CrossRef
    3. Caimi G, Fuchsberger M, Laumanns M, Lüthi M (2012) A?model–predictive control approach for discrete-time rescheduling in complex central railway station areas. Comput Oper Res 39(11):2578-593 CrossRef
    4. Corman F, Goverde RMP, D’Ariano A (2009) Rescheduling dense train traffic over complex station interlocking areas. In: Ahuja RK et al. (eds) Robust and online large-scale optimization. LNCS, vol 5868. Springer, Berlin/Heidelberg, pp 100-11 CrossRef
    5. Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2010) Centralized versus distributed systems to reschedule trains in two dispatching areas. Public Transp 2(3):219-47 CrossRef
    6. Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2011) Dispatching and coordination in multi-area railway traffic management. Tech Rep RT-DIA-190-11, pp 1-0, Dipartimento di Informatica e Automazione, Roma Tre
    7. Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2012a) Optimal inter-area coordination of train rescheduling decisions. Transp Res, Part E, Logist Transp Rev 48(1):71-8 CrossRef
    8. Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2012b) Bi-objective conflict detection and resolution in railway traffic management. Transp Res, Part C, Emerg Technol 20(1):79-4 CrossRef
    9. D’Ariano A (2008) Improving real-time train dispatching: models, algorithms and applications. PhD thesis, TU Delft
    10. D’Ariano A, Pacciarelli D, Pranzo M (2007a) A?branch and bound algorithm for scheduling trains in a railway network. Eur J Oper Res 183(2):643-57 CrossRef
    11. D’Ariano A, Pranzo M, Hansen IA (2007b) Conflict resolution and train speed coordination for solving real-time timetable perturbations. IEEE Trans Intell Transp Syst 8(2):208-22 CrossRef
    12. Goverde RMP (2007) Railway timetable stability analysis using max-plus system theory. Transp Res, Part B, Methodol 41(2):179-01 CrossRef
    13. Goverde RMP (2010) A?delay propagation algorithm for large-scale railway traffic networks. Transp Res, Part C, Emerg Technol 18(3):269-87 CrossRef
    14. Hansen IA, Pachl J (eds) (2008) Railway timetable & traffic—analysis, modelling, simulation. EUrail Press, Hamburg
    15. Hooghiemstra JS (1996) Design of regular interval timetables for strategic and tactical railway planning. In: Allan J, Brebbia CA, Hill RJ, Sciutto G, Sone S (eds) Computers in railways V. Computational Mechanics Publications, Southampton, pp 393-02
    16. Jacobs J (2004) Reducing delays by means of ‘on the spot-reschdeduling. In: Allan J, Brebbia CA, Hill RJ, Sciutto G, Sone S (eds) Computers in railways IX. WIT Press, Southampton, pp 603-12
    17. Kecman P, Corman F, D’Ariano A, Goverde RMP (2012) Rescheduling models for network-wide railway traffic management. In: Proceedings of the conference on advanced systems for public transport (CASPT12), Santiago
    18. Kettner M, Sewcyk B, Eickmann C (2003) Integrating microscopic and macroscopic models for railway network evaluation. In: Proceedings of the European transport conference (ETC), Strassbourg, France
    19. Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143:498-17 CrossRef
    20. Mascis A, Pacciarelli D, Pranzo M (2002) Models and algorithms for traffic management of rail networks. In: Tech. Rep. RT-DIA-074-2002, pp 1-0, Dipartimento di Informatica e Automazione, Roma Tre
    21. Min YH, Park MJ, Hong SP, Hong SH (2011) An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network. Transp Res, Part B, Methodol 45(2):409-29 CrossRef
    22. Nash A, Huerlimann D (2004) Railroad simulation using OpenTrack. In: Allan J et al. (eds) Computers in railways IX. WIT Press, Southampton, pp 45-4
    23. Network Statement (2013) In: ProRail, Utrecht, Netherlands (2012)
    24. Schachtebeck M, Sch?bel A (2010) To wait or not to wait–and who goes first? Delay management with priority decisions. Transp Sci 44(3):307-21 CrossRef
    25. Schlechte T, Bornd?rfer R, Erol B, Graffagnino T, Swarat E (2011) Micro–macro transformation of railway networks. J Rail Transp Plann Manag 1(1):38-8 CrossRef
    26. Sch?bel A (2007) Integer programming approaches for solving the delay management problem. In: Geraets F et al. (eds) Railway optimization. LNCS, vol 4359. Springer, Berlin/Heidelberg, pp 145-70 CrossRef
    27. Siefer T, Radtke A (2006) Evaluation of delay propagation. In: Proceedings of 7th world congress on railway research, Montreal
    28. Sporenplan (2013) www.sporenplan.nl
    29. Suhl L, Biederbick C, Kliewer N (2001) Design of customer-oriented dispatching support for railways. In: Vo?S, Daduna J (eds) Computer-aided transit scheduling. LNEMS, vol 505. Springer, Berlin, pp 365-86 CrossRef
    30. Tomii N, Yoshiaki T, Noriyuki T, Chikara H, Kunimitsu M (2005) Train rescheduling algorithm which minimizes passengers-dissatisfaction. In: Ali M, Esposito F (eds) Innovations in applied artificial intelligence. LNCS, vol 3533. Springer, Berlin/Heidelberg, pp 37-3
    31. T?rnquist Krasemann J (2011) Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transp Res, Part C, Emerg Technol 20:62-8 CrossRef
    32. T?rnquist J, Persson J (2007) N-tracked railway traffic re-scheduling during disturbances. Transp Res, Part B, Methodol 41(3):342-62 CrossRef
    33. Van den Boom TJJ, De Schutter B (2007) On a model predictive control algorithm for dynamic railway network. In: Hansen IA et al. (eds) Proceedings of the 2nd international seminar on railway operations modelling and analysis (RailHannover2007), Hannover, Germany
  • 作者单位:Pavle Kecman (1)
    Francesco Corman (2)
    Andrea D’Ariano (3)
    Rob M. P. Goverde (1)

    1. Department of Transport and Planning, Delft University of Technology, Delft, The Netherlands
    2. Center for Industrial Management, Catholic University Leuven, Leuven, Belgium
    3. Dipartimento di Informatica e Automazione, Università degli Studi Roma Tre, Rome, Italy
文摘
In the last decades of railway operations research, microscopic models have been intensively studied to support traffic operators in managing their dispatching areas. However, those models result in long computation times for large and highly utilized networks. The problem of controlling country-wide traffic is still open since the coordination of local areas is hard to tackle in short time and there are multiple interdependencies between trains across the whole network. This work is dedicated to the development of new macroscopic models that are able to incorporate traffic management decisions. Objective of this paper is to investigate how different levels of detail and number of operational constraints may affect the applicability of models for network-wide rescheduling in terms of quality of solutions and computation time. We present four different macroscopic models and test them on the Dutch national timetable. The macroscopic models are compared with a state-of-the-art microscopic model. Trade-off between computation time and solution quality is discussed on various disturbed traffic conditions.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700