메뉴 건너뛰기




Volumn 167, Issue 3, 2005, Pages 752-771

Bicriteria train scheduling for high-speed passenger railroad planning applications

Author keywords

Multiple objective programming; Railway; Scheduling; Transportation

Indexed keywords

ACCELERATION; ALGORITHMS; PASSENGER CARS; PLANNING; RAILROADS; TRANSPORTATION;

EID: 13544267417     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.07.019     Document Type: Article
Times cited : (184)

References (37)
  • 2
    • 0019230108 scopus 로고
    • Models for rail transportation
    • A. Assad Models for rail transportation Transportation Research A 14 1980 205 220
    • (1980) Transportation Research A , Issue.14 , pp. 205-220
    • Assad, A.1
  • 3
    • 0029473530 scopus 로고
    • A heteroscedastic extreme value model of intercity travel mode choice
    • C. Bhat A heteroscedastic extreme value model of intercity travel mode choice Transportation Research B 29 1995 471 483
    • (1995) Transportation Research B , Issue.29 , pp. 471-483
    • Bhat, C.1
  • 8
    • 0034011719 scopus 로고    scopus 로고
    • A multiobjective model for passenger train services planning: Application to Taiwan's high-speed rail line
    • Y.H. Chang, C.H. Yeh, and C.C. Shen A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line Transportation Research B 34 2000 91 106
    • (2000) Transportation Research B , Issue.34 , pp. 91-106
    • Chang, Y.H.1    Yeh, C.H.2    Shen, C.C.3
  • 9
    • 0032203702 scopus 로고    scopus 로고
    • A survey of optimization models for train routing and scheduling
    • J.-F. Cordeau, P. Toth, and D. Vigo A survey of optimization models for train routing and scheduling Transportation Science 32 1998 380 404
    • (1998) Transportation Science , vol.32 , pp. 380-404
    • Cordeau, J.-F.1    Toth, P.2    Vigo, D.3
  • 10
    • 0037120618 scopus 로고    scopus 로고
    • Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization
    • J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization European Journal of Operational Research 141 3 2002 559 569
    • (2002) European Journal of Operational Research , vol.141 , Issue.3 , pp. 559-569
    • Framinan, J.M.1    Leisten, R.2    Ruiz-Usano, R.3
  • 11
    • 0000711418 scopus 로고
    • A branch and bound solution to the general scheduling problem
    • H.H. Greenberg A branch and bound solution to the general scheduling problem Operations Research 16 1968 352 361
    • (1968) Operations Research , vol.16 , pp. 352-361
    • Greenberg, H.H.1
  • 12
    • 0032206316 scopus 로고    scopus 로고
    • Modeling train delays in urban networks
    • A. Higgins, and E. Kozan Modeling train delays in urban networks Transportation Science 32 1998 346 357
    • (1998) Transportation Science , vol.32 , pp. 346-357
    • Higgins, A.1    Kozan, E.2
  • 13
  • 15
    • 0029416680 scopus 로고
    • Real-time scheduling of freight railroads
    • D.R. Kraay, and P.T. Harker Real-time scheduling of freight railroads Transportation Research B 29 1995 213 229
    • (1995) Transportation Research B , Issue.29 , pp. 213-229
    • Kraay, D.R.1    Harker, P.T.2
  • 16
    • 0013315834 scopus 로고
    • A branch and bound procedure for optimal train dispatching
    • E.R. Kraft A branch and bound procedure for optimal train dispatching Journal of the Transportation Research Forum 28 1 1987 263 276
    • (1987) Journal of the Transportation Research Forum , vol.28 , Issue.1 , pp. 263-276
    • Kraft, E.R.1
  • 18
    • 0004425515 scopus 로고
    • Analysis of the market demand for high speed rail in the Quebec-Ontario corridor
    • KPMG Peat Marwick, Vienna, VA
    • KPMG Peat Marwick, Koppelman, F.S., 1990. Analysis of the market demand for high speed rail in the Quebec-Ontario corridor. Report produced for Ontario/Quebec Rapid Train Task Force, KPMG Peat Marwick, Vienna, VA
    • (1990) Report Produced for Ontario/Quebec Rapid Train Task Force
    • Koppelman, F.S.1
  • 26
    • 0025701909 scopus 로고
    • Computational experience with a backtracking algorithm for solving a general class of resource constrained scheduling problems
    • J.H. Patterson, R. Slowiski, F.B. Talbot, and J. Weglarz Computational experience with a backtracking algorithm for solving a general class of resource constrained scheduling problems European Journal of Operational Research 90 1 1990 68 79
    • (1990) European Journal of Operational Research , vol.90 , Issue.1 , pp. 68-79
    • Patterson, J.H.1    Slowiski, R.2    Talbot, F.B.3    Weglarz, J.4
  • 28
    • 0032884348 scopus 로고    scopus 로고
    • Railway traffic control and train scheduling based on inter-train conflict management
    • I. Sahin Railway traffic control and train scheduling based on inter-train conflict management Transportation Research B 33 1999 511 534
    • (1999) Transportation Research B , Issue.33 , pp. 511-534
    • Sahin, I.1
  • 29
    • 0033102018 scopus 로고    scopus 로고
    • A bicriteria approach to the two-machine flow shop scheduling problem
    • E. Sayin, and S. Karabati A bicriteria approach to the two-machine flow shop scheduling problem European Journal of Operational Research 113 2 1999 435 449
    • (1999) European Journal of Operational Research , vol.113 , Issue.2 , pp. 435-449
    • Sayin, E.1    Karabati, S.2
  • 30
    • 0032096811 scopus 로고    scopus 로고
    • Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
    • A. Sprecher, and A. Drexl Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm European Journal of Operational Research 107 2 1998 431 450
    • (1998) European Journal of Operational Research , vol.107 , Issue.2 , pp. 431-450
    • Sprecher, A.1    Drexl, A.2
  • 33
    • 0037120688 scopus 로고    scopus 로고
    • An Ant Colony optimization algorithm to solve a 2-machine bicriteria flow shop scheduling problem
    • V. T'kindt, N. Monmarché, F. Tercinet, and D. Laügt An Ant Colony optimization algorithm to solve a 2-machine bicriteria flow shop scheduling problem European Journal of Operational Research 142 2 2002 250 257
    • (2002) European Journal of Operational Research , vol.142 , Issue.2 , pp. 250-257
    • T'Kindt, V.1    Monmarché, N.2    Tercinet, F.3    Laügt, D.4
  • 36
    • 0036497701 scopus 로고    scopus 로고
    • Evaluation of management strategies for the operation of high-speed railways in China
    • W.G. Wong, B.M. Han, L. Ferreira, X.N. Zhu, and Q.X. Sun Evaluation of management strategies for the operation of high-speed railways in China Transportation Research A 36 2002 277 289
    • (2002) Transportation Research A , Issue.36 , pp. 277-289
    • Wong, W.G.1    Han, B.M.2    Ferreira, L.3    Zhu, X.N.4    Sun, Q.X.5


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