메뉴 건너뛰기




Volumn 26, Issue 4, 2014, Pages 490-515

An iterative optimization framework for delay management and train scheduling

Author keywords

Alternative graph; Event activity network; Public transportation; Railway operations

Indexed keywords

RAILROADS; SCHEDULING;

EID: 84912041490     PISSN: 19366582     EISSN: 19366590     Source Type: Journal    
DOI: 10.1007/s10696-013-9187-2     Document Type: Article
Times cited : (84)

References (31)
  • 3
    • 79958017675 scopus 로고    scopus 로고
    • Algorithmic decision support for train scheduling in a large and highly utilised railway network
    • ETH Zurich, Switzerland:
    • Caimi G (2009) Algorithmic decision support for train scheduling in a large and highly utilised railway network. PhD thesis, ETH Zurich, Switzerland
    • (2009) PhD thesis
    • Caimi, G.1
  • 5
    • 69249202566 scopus 로고    scopus 로고
    • Evaluation of green wave policy in real-time railway traffic management
    • Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2009) Evaluation of green wave policy in real-time railway traffic management. Transp Res Part C 17(6):607–616
    • (2009) Transp Res Part C , vol.17 , Issue.6 , pp. 607-616
    • Corman, F.1    D’Ariano, A.2    Pacciarelli, D.3    Pranzo, M.4
  • 6
    • 80054790040 scopus 로고    scopus 로고
    • Bi-objective conflict detection and resolution in railway traffic management
    • Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2010) Bi-objective conflict detection and resolution in railway traffic management. Transp Res Part C 20(1):79–94
    • (2010) Transp Res Part C , vol.20 , Issue.1 , pp. 79-94
    • Corman, F.1    D’Ariano, A.2    Pacciarelli, D.3    Pranzo, M.4
  • 8
    • 79958004969 scopus 로고    scopus 로고
    • Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area
    • Corman F, D’Ariano A, Pranzo M, Hansen I (2011) Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area. Transp Plan Technol 34(4):341–362
    • (2011) Transp Plan Technol , vol.34 , Issue.4 , pp. 341-362
    • Corman, F.1    D’Ariano, A.2    Pranzo, M.3    Hansen, I.4
  • 9
    • 70449635732 scopus 로고    scopus 로고
    • Reordering and local rerouting strategies to manage train traffic in real-time
    • D’Ariano A, Corman F, Pacciarelli D, Pranzo M (2008) Reordering and local rerouting strategies to manage train traffic in real-time. Transp Sci 42(4):405–419
    • (2008) Transp Sci , vol.42 , Issue.4 , pp. 405-419
    • D’Ariano, A.1    Corman, F.2    Pacciarelli, D.3    Pranzo, M.4
  • 10
    • 34249982545 scopus 로고    scopus 로고
    • A branch and bound algorithm for scheduling trains in a railway network
    • D’Ariano A, Pacciarelli D, Pranzo M (2007) A branch and bound algorithm for scheduling trains in a railway network. Eur J Oper Res 183(2):643–657
    • (2007) Eur J Oper Res , vol.183 , Issue.2 , pp. 643-657
    • D’Ariano, A.1    Pacciarelli, D.2    Pranzo, M.3
  • 11
    • 40849124003 scopus 로고    scopus 로고
    • Optimization models for the single delay management problem in public transportation
    • De Giovanni L, Heilporn G, Labbé M (2008) Optimization models for the single delay management problem in public transportation. Eur J Oper Res 189(3):762–774
    • (2008) Eur J Oper Res , vol.189 , Issue.3 , pp. 762-774
    • De Giovanni, L.1    Heilporn, G.2    Labbé, M.3
  • 12
    • 56349103276 scopus 로고    scopus 로고
    • Stability evaluation of a railway timetable at station level
    • Delorme X, Gandibleux X, Rodriguez J (2009) Stability evaluation of a railway timetable at station level. Eur J Oper Res 3(195):780–790
    • (2009) Eur J Oper Res , vol.3 , Issue.195 , pp. 780-790
    • Delorme, X.1    Gandibleux, X.2    Rodriguez, J.3
  • 13
    • 84899802223 scopus 로고    scopus 로고
    • Fast heuristics for delay management with passenger rerouting. Pub Transport
    • Dollevoet T, Huisman D (2013) Fast heuristics for delay management with passenger rerouting. Pub Transport. doi:10.1007/s12469-013-0076-6
    • (2013) doi:10.1007/s12469-013-0076-6
    • Dollevoet, T.1    Huisman, D.2
  • 16
    • 50049084408 scopus 로고    scopus 로고
    • On-line delay management on a single train line
    • Lecture notes in computer science. Springer, Berlin:
    • Gatto M, Jacob R, Peeters L, Widmayer P (2007) On-line delay management on a single train line. In: Algorithmic methods for railway optimization, vol 4359. Lecture notes in computer science. Springer, Berlin, pp 306–320
    • (2007) Algorithmic methods for railway optimization , vol.4359 , pp. 306-320
    • Gatto, M.1    Jacob, R.2    Peeters, L.3    Widmayer, P.4
  • 18
    • 0039444428 scopus 로고    scopus 로고
    • Decision support systems support the search for win–win solutions in railway network design
    • Hooghiemstra JS, Kroon LG, Odijk MA, Salomon M, Zwaneveld PJ (1999) Decision support systems support the search for win–win solutions in railway network design. Interfaces 29(2):15–32
    • (1999) Interfaces , vol.29 , Issue.2 , pp. 15-32
    • Hooghiemstra, J.S.1    Kroon, L.G.2    Odijk, M.A.3    Salomon, M.4    Zwaneveld, P.J.5
  • 19
    • 84897469246 scopus 로고    scopus 로고
    • Eickmann C (2003) Integrating microscopic and macroscopic models for railway network evaluation
    • Kettner M, Sewcyk B, Eickmann C (2003) Integrating microscopic and macroscopic models for railway network evaluation. In: Proceedings of the European transport conference 2003
    • (2003) Proceedings of the European transport conference
    • Kettner, M.1    Sewcyk, B.2
  • 20
    • 78650137333 scopus 로고    scopus 로고
    • A note on the online nature of the railway delay management problem
    • Kliewer N, Suhl L (2011) A note on the online nature of the railway delay management problem. Networks 57(1):28–37
    • (2011) Networks , vol.57 , Issue.1 , pp. 28-37
    • Kliewer, N.1    Suhl, L.2
  • 21
    • 80054963090 scopus 로고    scopus 로고
    • Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization
    • Krumke S, Thielen C, Zeck C (2011) Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization. Math Methods Oper Res 74(1):53–75
    • (2011) Math Methods Oper Res , vol.74 , Issue.1 , pp. 53-75
    • Krumke, S.1    Thielen, C.2    Zeck, C.3
  • 22
    • 0037121475 scopus 로고    scopus 로고
    • Job shop scheduling with blocking and no-wait constraints
    • Mascis A, Pacciarelli D (2002) Job shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143(3):498–517
    • (2002) Eur J Oper Res , vol.143 , Issue.3 , pp. 498-517
    • Mascis, A.1    Pacciarelli, D.2
  • 23
    • 77955639714 scopus 로고    scopus 로고
    • To wait or not to wait and who goes first? Delay management with priority decisions
    • 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–321
    • (2010) Transp Sci , vol.44 , Issue.3 , pp. 307-321
    • Schachtebeck, M.1    Schöbel, A.2
  • 25
    • 18944406568 scopus 로고    scopus 로고
    • A model for the delay management problem based on mixed-integer programming
    • Schöbel A (2001) A model for the delay management problem based on mixed-integer programming. Electron Notes Theor Comput Sci 50(1):1–10
    • (2001) Electron Notes Theor Comput Sci , vol.50 , Issue.1 , pp. 1-10
    • Schöbel, A.1
  • 27
    • 77955597779 scopus 로고    scopus 로고
    • Capacity constraints in delay management
    • Schöbel A (2009) Capacity constraints in delay management. Public Transp 1(2):135–154
    • (2009) Public Transp , vol.1 , Issue.2 , pp. 135-154
    • Schöbel, A.1
  • 28
    • 0011529581 scopus 로고
    • Dienstregelontwikkeling voor railned
    • Center for Mathematics and Computer Science, Amsterdam:
    • Schrijver A, Steenbeek A (1994) Dienstregelontwikkeling voor railned. Technical report, Center for Mathematics and Computer Science, Amsterdam
    • (1994) Technical report
    • Schrijver, A.1    Steenbeek, A.2
  • 30
    • 80054777781 scopus 로고    scopus 로고
    • Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances
    • Törnquist J (2012) Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transp Res Part C Emerg Technol 20(1):62–78
    • (2012) Transp Res Part C Emerg Technol , vol.20 , Issue.1 , pp. 62-78
    • Törnquist, J.1
  • 31
    • 0035204411 scopus 로고    scopus 로고
    • Routing trains through railway stations based on a node packing model
    • Zwaneveld P, Kroon L, van Hoesel C (2001) Routing trains through railway stations based on a node packing model. Eur J Oper Res 128:14–33
    • (2001) Eur J Oper Res , vol.128 , pp. 14-33
    • Zwaneveld, P.1    Kroon, L.2    van Hoesel, C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.