A lagrangian relaxation method for crew and vehicle rescheduling of railway passenger transportation and its application

IEEJ Transactions on Electronics, Information and Systems

Volumn 132, Issue 2, 2012, Pages 260-268

  Sato, Tatsuhiro ^a   Tomiyama, Tomoe ^a   Morita, Toyohisa ^a   Murata, Tomohiro ^b  

^a HITACHI LTD   (Japan)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

Crew vehicle rescheduling; Integer programming; Lagrangian relaxation method; Network flow model; Railway train operation; Shortest path algorithm

Indexed keywords

INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; RAILROADS;

CREW/VEHICLE RESCHEDULING; LAGRANGIAN RELAXATION METHOD; NETWORK FLOW MODEL; RAILWAY TRAIN; SHORTEST PATH ALGORITHMS;

RAILROAD TRANSPORTATION;

EID: 84863027874     PISSN: 03854221     EISSN: 13488155     Source Type: Journal    
DOI: 10.1541/ieejeiss.132.260     Document Type: Article

References (13)

1. R. Freling, J. M. P. Paixão, and A. P. M. Wagelmans: "Models and algorithms for vehicle scheduling", Report 9562/A, Econometric Institute, Erasmus University Rotterdam (1999)
2. T. Erlebach, M. Gantenbein, D. Hürlimann, and G. Neyer: "On the Complexity of Train Assignment Problems", Proc. 12th International Symposium on Algorithm and Computation (ISAAC 2001), Lecture Notes in Computer Science 2223, pp.390-402 (2001)
3. V. Cacchiani, A. Caprara, and P. Toth: "Solving a Real-World Train Unit Assignment", Proc. 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATOMS 2007), pp.79-95 (2007)
4. A. Caprara, M. Fischetti, P. L. Guida, P. Toth, and D. Vigo: "Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience", Lecture Notes in Economics and Mathematical Systems 471, pp.1-18 (1999)
5. M. Fischetti, A. Lodi, S. Martello, and P. Toth: "A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems", Management Science, Vol.47, No.6, pp.833-850 (2001) (Pubitemid 34192801)
6. K. Haase, G. Desaulniers, and J. Desrosiers: "Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems", Transportation Science, Vol.35, No.3, pp. 286-303 (2001) (Pubitemid 33014134)
7. S. Takahashi, K. Kataoka, T. Kojima, and M. Asami: "An Algorithm for Automatically Modifying Train Crew Schedule", IEEJ Trans. Industry Applications, Vol.128, No.11, pp.1291- 1297 (2008) (in Japanese)
8. T. Sato, S. Sakikawa, T. Morita, N. Ueki, and T. Murata: "Crew and Vehicle Rescheduling Based on a Network Flow Model and Its Application to a Railway Train Operation", IAENG International Journal of AppliedMathematics, Vol.39, No.3, pp.142-150 (2009)
9. M. L. Fisher: "The Lagrangian Relaxation Method for Solving Integer Programming Problems", Management Science, Vol.27, No.1, pp.1-18 (1981)
10. E. W. Dijkstra: "A note on two problems in connexion with graphs", Inurische Mathematik, Vol.1 pp.269-271 (1959)
11. R. Bellman: "On a Routing Problem", Quarterly of Applied Mathematics, Vol.16, No.1, pp.87-90 (1958)
12. T.H. Cormen, C.E. Leiserson, R. L. Rivest, andC. Stein: "Introduction to Algorithms, Second Edition", MIT Press (2001)
13. N. Z. Shor: "Minimization Methods for Non-differentiable Functions", Springer Series in Computational Mathematics, Springer (1985)