메뉴 건너뛰기




Volumn 128, Issue , 2008, Pages 255-276

A genetic algorithm for railway scheduling problems

Author keywords

Genetic algorithms; Parameterized regret based biased random sampling; Real world instances; Scheduling; Train timetabling problem

Indexed keywords


EID: 50549096374     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-78985-7_10     Document Type: Article
Times cited : (55)

References (19)
  • 1
    • 0028436769 scopus 로고
    • A fast heuristic for the train scheduling problem
    • X. Cai and C. J. Goh. A fast heuristic for the train scheduling problem. Computers and Operations Research, 21(5):499-510, 1994.
    • (1994) Computers and Operations Research , vol.21 , Issue.5 , pp. 499-510
    • Cai, X.1    Goh, C.J.2
  • 2
    • 0036759198 scopus 로고    scopus 로고
    • Modeling and solving the train timetabling problem
    • A. Caprara, M. Fischetti, and P. Toth. Modeling and solving the train timetabling problem. Operations Research, 50:851-861, 2002.
    • (2002) Operations Research , vol.50 , pp. 851-861
    • Caprara, A.1    Fischetti, M.2    Toth, P.3
  • 3
    • 33644594453 scopus 로고    scopus 로고
    • A lagrangian heuristic algorithm for a real -world train timetabling problem
    • A. Caprara, M. Monaci, P. Toth, and P. Guida. A lagrangian heuristic algorithm for a real -world train timetabling problem. Discrete Applied Mathematics, 154:738-753, 2006.
    • (2006) Discrete Applied Mathematics , vol.154 , pp. 738-753
    • Caprara, A.1    Monaci, M.2    Toth, P.3    Guida, P.4
  • 6
    • 0031234257 scopus 로고    scopus 로고
    • Heuristic techniques for single line train scheduling
    • A. Higgins, E. Kozan, and L. Ferreira. Heuristic techniques for single line train scheduling. Journal of Heuristics, 3(1):43-62, 1997.
    • (1997) Journal of Heuristics , vol.3 , Issue.1 , pp. 43-62
    • Higgins, A.1    Kozan, E.2    Ferreira, L.3
  • 8
    • 0026104713 scopus 로고
    • Tactical scheduling of rail operations: The scan i system
    • D. Jovanovic and P. T. Harker. Tactical scheduling of rail operations: The scan i system. Transportation Science, 25(1):46-64, 1991.
    • (1991) Transportation Science , vol.25 , Issue.1 , pp. 46-64
    • Jovanovic, D.1    Harker, P.T.2
  • 9
    • 0002866635 scopus 로고
    • The critical-path method: Resources planning and scheduling
    • J. Kelley. The critical-path method: Resources planning and scheduling. Industrial Scheduling, 1963.
    • (1963) Industrial Scheduling
    • Kelley, J.1
  • 10
    • 0043207353 scopus 로고    scopus 로고
    • A variable time model for cycling railway timetabling
    • L. Kroon and L. Peeters. A variable time model for cycling railway timetabling. Transportation Science, 37(2):198-212, 2003.
    • (2003) Transportation Science , vol.37 , Issue.2 , pp. 198-212
    • Kroon, L.1    Peeters, L.2
  • 11
    • 84901411946 scopus 로고    scopus 로고
    • A co-evolutionary algorithm for train timetabling. In IEEE Press, editor
    • R. K. S. Kwan and P. Mistry. A co-evolutionary algorithm for train timetabling. In IEEE Press, editor, Congress on Evolutionary Computation, pages 2142-2148, 2003.
    • (2003) Congress on Evolutionary Computation , pp. 2142-2148
    • Kwan, R.K.S.1    Mistry, P.2
  • 13
    • 0030143150 scopus 로고    scopus 로고
    • A genetic algorithm approach to periodic railway synchronization
    • K. Nachtigall and S. Voget. A genetic algorithm approach to periodic railway synchronization. Computers and Operations Research, 23:453-463, 1996.
    • (1996) Computers and Operations Research , vol.23 , pp. 453-463
    • Nachtigall, K.1    Voget, S.2
  • 14
    • 0030412990 scopus 로고    scopus 로고
    • A constraint generation algorithm for the construction of periodic railway timetables
    • December
    • M. Odijk. A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research Part B, 30(6):455-464, December 1996.
    • (1996) Transportation Research Part B , vol.30 , Issue.6 , pp. 455-464
    • Odijk, M.1
  • 15
    • 50549104296 scopus 로고    scopus 로고
    • A. Schirmer and S Riesenberg. Parameterized heuristics for project scheduling-biased random sampling methods. Technical Report 456, Institute fr Betriebswirtschaftslehre der UNIVERSITT KIEL, 1997.
    • A. Schirmer and S Riesenberg. Parameterized heuristics for project scheduling-biased random sampling methods. Technical Report 456, Institute fr Betriebswirtschaftslehre der UNIVERSITT KIEL, 1997.
  • 16
    • 0008917539 scopus 로고
    • A mathematical model for periodic scheduling problems
    • P. Serafini and W. Ukovich. A mathematical model for periodic scheduling problems. SIAM J. on Discrete Mathematics, 2:550-581, 1989.
    • (1989) SIAM J. on Discrete Mathematics , vol.2 , pp. 550-581
    • Serafini, P.1    Ukovich, W.2
  • 17
    • 50549085899 scopus 로고    scopus 로고
    • Solving Single-Track Railway Scheduling Problem Using Constraint Programming. PhD thesis, The University of Leeds, School of Computing, September
    • E. Silva de Oliveira. Solving Single-Track Railway Scheduling Problem Using Constraint Programming. PhD thesis, The University of Leeds, School of Computing, September 2001.
    • (2001)
    • Silva de Oliveira, E.1
  • 19
    • 0035617605 scopus 로고    scopus 로고
    • A competitive heuristic solution technique for resource-constrained project scheduling
    • P. Tormos and A. Lova. A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research, 102(1-4):65-81, 2001.
    • (2001) Annals of Operations Research , vol.102 , Issue.1-4 , pp. 65-81
    • Tormos, P.1    Lova, A.2


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