메뉴 건너뛰기




Volumn 41, Issue 3, 2007, Pages 320-341

Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds

Author keywords

Branch and bound; Heuristics; Lagrangian relaxation; Railway; Train timetabling

Indexed keywords

CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; OPTIMIZATION; RAILROAD STATIONS; SAFETY FACTOR; SCHEDULING;

EID: 33845274298     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2006.05.003     Document Type: Article
Times cited : (270)

References (30)
  • 3
    • 0019230108 scopus 로고
    • Models for rail transportation
    • Assad A. Models for rail transportation. Transportation Research Part A 14 3 (1980) 205-220
    • (1980) Transportation Research Part A , vol.14 , Issue.3 , pp. 205-220
    • Assad, A.1
  • 4
    • 34250094949 scopus 로고
    • Scheduling project networks with resource constraints and time windows
    • Bartusch M., Mohring R.H., and Radermacher F.J. Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16 1 (1988) 201-240
    • (1988) Annals of Operations Research , vol.16 , Issue.1 , pp. 201-240
    • Bartusch, M.1    Mohring, R.H.2    Radermacher, F.J.3
  • 6
    • 0032070192 scopus 로고    scopus 로고
    • Greedy heuristics for rapid scheduling of trains on a single track
    • Cai X., Goh C.J., and Mees A.I. Greedy heuristics for rapid scheduling of trains on a single track. IIE Transactions 30 5 (1998) 481-493
    • (1998) IIE Transactions , vol.30 , Issue.5 , pp. 481-493
    • Cai, X.1    Goh, C.J.2    Mees, A.I.3
  • 7
    • 0036759198 scopus 로고    scopus 로고
    • Modeling and solving the train timetabling problem
    • Caprara A., Fischetti M., and Toth P. Modeling and solving the train timetabling problem. Operations Research 50 5 (2002) 851-861
    • (2002) Operations Research , vol.50 , Issue.5 , pp. 851-861
    • Caprara, A.1    Fischetti, M.2    Toth, P.3
  • 8
    • 0028530808 scopus 로고
    • A model and strategy for train pathing with choice of lines, platforms and routes
    • 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
    • (1994) Transportation Research Part B , vol.28 , Issue.5 , pp. 333-353
    • Carey, M.1
  • 9
    • 0028532251 scopus 로고
    • Extending a train pathing model from one-way to two-way track
    • Carey M. Extending a train pathing model from one-way to two-way track. Transportation Research Part B 28 5 (1994) 395-400
    • (1994) Transportation Research Part B , vol.28 , Issue.5 , pp. 395-400
    • Carey, M.1
  • 11
    • 0025512036 scopus 로고
    • Two moments estimation of the delay on single-track rail lines with scheduled traffic
    • Chen B., and Harker P.T. Two moments estimation of the delay on single-track rail lines with scheduled traffic. Transportation Science 24 4 (1990) 261-275
    • (1990) Transportation Science , vol.24 , Issue.4 , pp. 261-275
    • Chen, B.1    Harker, P.T.2
  • 12
    • 0032203702 scopus 로고    scopus 로고
    • A survey of optimization models for train routing and scheduling
    • Cordeau J.-F., Toth P., and Vigo D. A survey of optimization models for train routing and scheduling. Transportation Science 32 4 (1998) 380-404
    • (1998) Transportation Science , vol.32 , Issue.4 , pp. 380-404
    • Cordeau, J.-F.1    Toth, P.2    Vigo, D.3
  • 13
    • 0032210246 scopus 로고    scopus 로고
    • Branch-and-bound algorithm for the resource-constrained project scheduling problem with generalized precedence relations
    • De Reyck B., and Herroelen W. Branch-and-bound algorithm for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 111 1 (1998) 152-174
    • (1998) European Journal of Operational Research , vol.111 , Issue.1 , pp. 152-174
    • De Reyck, B.1    Herroelen, W.2
  • 14
    • 0142156064 scopus 로고    scopus 로고
    • Scheduling trains on a railway network using a discrete event model of railway traffic
    • 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 1 (2004) 81-98
    • (2004) Transportation Research Part B , vol.38 , Issue.1 , pp. 81-98
    • Dorfman, M.J.1    Medanic, J.2
  • 15
    • 0000711418 scopus 로고
    • A branch-and-bound solution to the general scheduling problem
    • Greenberg H.H. A branch-and-bound solution to the general scheduling problem. Operations Research 16 2 (1968) 352-361
    • (1968) Operations Research , vol.16 , Issue.2 , pp. 352-361
    • Greenberg, H.H.1
  • 16
    • 0032206316 scopus 로고    scopus 로고
    • Modeling train delays in urban networks
    • Higgins A., and Kozan E. Modeling train delays in urban networks. Transportation Science 32 4 (1998) 346-357
    • (1998) Transportation Science , vol.32 , Issue.4 , pp. 346-357
    • Higgins, A.1    Kozan, E.2
  • 18
    • 0026104713 scopus 로고
    • Tactical scheduling of rail operations: the SCAN I system
    • Jovanovic D., and Harker P.T. Tactical scheduling of rail operations: the SCAN I system. Transportation Science 25 1 (1991) 46-64
    • (1991) Transportation Science , vol.25 , Issue.1 , pp. 46-64
    • Jovanovic, D.1    Harker, P.T.2
  • 19
  • 20
    • 0043207353 scopus 로고    scopus 로고
    • A variable trip time model for cyclic railway timetabling
    • Kroon L.G., and Peeters L.W. A variable trip time model for cyclic railway timetabling. Transportation Science 37 2 (2003) 198-212
    • (2003) Transportation Science , vol.37 , Issue.2 , pp. 198-212
    • Kroon, L.G.1    Peeters, L.W.2
  • 21
    • 0000988422 scopus 로고
    • Branch and bound methods: A survey
    • Lawler E.L., and Wood D.E. Branch and bound methods: A survey. Operations Research 14 4 (1966) 699-719
    • (1966) Operations Research , vol.14 , Issue.4 , pp. 699-719
    • Lawler, E.L.1    Wood, D.E.2
  • 22
    • 0032654876 scopus 로고    scopus 로고
    • An effective approach for job-shop scheduling with uncertain processing requirements
    • Luh P.B., Chen D., and Thakur L.S. An effective approach for job-shop scheduling with uncertain processing requirements. IEEE Transactions on Robotics and Automation 15 2 (1999) 328-339
    • (1999) IEEE Transactions on Robotics and Automation , vol.15 , Issue.2 , pp. 328-339
    • Luh, P.B.1    Chen, D.2    Thakur, L.S.3
  • 24
    • 0020128317 scopus 로고
    • A structured model for rail line simulation and optimization
    • Petersen E.R., and Taylor A.J. A structured model for rail line simulation and optimization. Transportation Science 16 2 (1982) 192-206
    • (1982) Transportation Science , vol.16 , Issue.2 , pp. 192-206
    • Petersen, E.R.1    Taylor, A.J.2
  • 27
    • 0032884348 scopus 로고    scopus 로고
    • Railway traffic control and train scheduling based on inter-train conflict management
    • Sahin I. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research Part B 33 7 (1999) 511-534
    • (1999) Transportation Research Part B , vol.33 , Issue.7 , pp. 511-534
    • Sahin, I.1
  • 28
    • 0011877979 scopus 로고
    • Optimal train scheduling on a single track railway
    • North-Holland, Amsterdam, Netherlands pp. 343-352
    • Szpigel B. Optimal train scheduling on a single track railway. Operations Research'72 (1973), North-Holland, Amsterdam, Netherlands pp. 343-352
    • (1973) Operations Research'72
    • Szpigel, B.1
  • 29
    • 13544267417 scopus 로고    scopus 로고
    • Bi-criteria train scheduling for high-speed passenger railroad planning applications
    • Zhou X., and Zhong M. Bi-criteria train scheduling for high-speed passenger railroad planning applications. European Journal of Operational Research 167 3 (2005) 752-771
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 752-771
    • Zhou, X.1    Zhong, M.2
  • 30
    • 0031626073 scopus 로고    scopus 로고
    • Zhou, L., Hu, S., Ma, J., Yue, Y., 1998. Network hierarchy parallel algorithm of automatic train scheduling. In: Proceedings of the Conference on Traffic and Transportation Studies, ICTTS, pp. 358-368.


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