Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling

Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010

Volumn 1, Issue , 2010, Pages 403-408

  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

Indexed keywords

CREW/VEHICLE RESCHEDULING; DIRECTED ACYCLIC GRAPHS; FEASIBLE SOLUTION; HEURISTIC SOLUTIONS; INTEGER PROGRAMMING PROBLEMS; LAGRANGIAN MULTIPLIERS; LAGRANGIAN RELAXATION; LAGRANGIAN RELAXATION METHOD; MULTIPLE RESOURCES; NETWORK FLOW MODEL; NETWORK FLOWS; PRIMAL PROBLEM; RAILWAY LINE; RAILWAY TRAIN; REAL-WORLD; RESCHEDULING PROBLEM; SHORTEST PATH ALGORITHMS; UPPER AND LOWER BOUNDS;

DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LARGE EDDY SIMULATION; RAILROADS;

NETWORK MANAGEMENT;

EID: 77957949829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICACC.2010.5486971     Document Type: Conference Paper

References (12)

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, Issue 6, pp. 833-850, 2001.
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.
7. 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 Applied Mathematics, Vol. 39 Issue. 3, pp. 142-150, 2009.
8. M. L. Fisher, "The Lagrangian Relaxation Method for Solving Integer Programming Problems, " Management Science, Vol. 27, No. 1, pp. 1-18, 1981.
9. E. W. Dijkstra, "A note on two problems in connexion with graphs, " Inurische Mathematik, Vol. 1 pp. 269-271, 1959.
10. R. Bellman, "On a Routing Problem, " Quarterly of Applied Mathematics, Vol. 16, No. 1, pp. 87-90, 1958.
11. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms, Second Edition, " MIT Press, 2001.
12. N. Z. Shor, "Minimization Methods for Non-differentiable Functions, " Springer Series in Computational Mathematics, Springer, 1985.