New approaches for solving the block-to-train assignment problem

Networks

Volumn 51, Issue 1, 2008, Pages 48-62

  Jha, Krishna C ^a   Ahuja, Ravindra K ^b   Şahin, Güvenç ^c  

^a Innovative Scheduling Inc   (United States)

^b University of Florida   (United States)

^c SABANCI UNIVERSITY   (Turkey)

Author keywords

Assignment problems; Combinatorial optimization; Heuristics; Lagrangian relaxation; Mixed integer programming; Railroad scheduling; Shortest path; Transportation

Indexed keywords

ASSIGNMENT PROBLEMS; LAGRANGIAN RELAXATION; MIXED INTEGER PROGRAMMING; RAILROAD SCHEDULING; SHORTEST PATH;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING; VEHICLE ROUTING;

RAILROAD TRANSPORTATION;

EID: 38149100999     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20195     Document Type: Article

References (29)

1. R.K. Ahuja, K.C. Jha, and J. Liu, Solving real-life railroad blocking problems, Interfaces (2007), to appear.
2. R.K. Ahuja, J. Liu, J.B. Orlin, D. Sharma, and L.A. Shughart, Solving real-life locomotive scheduling problems, Transp Sci 39 (2005), 503-517.
3. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice Hall, New Jersey, 1993.
4. A.A. Assad, Models for rail transportation, Transp Res 14A (1980), 205-220.
5. A.A. Assad, Modeling of rail networks: Toward a routing/makeup model, Transp Res 14B (1980), 101-114.
6. C. Barnhart, C.A. Hane, and P.H Vance, Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems, Oper Res 48 (2000), 318-326.
7. C. Barnhart, H. Jin, and P.H. Vance, Railroad blocking: A network design application, Oper Res 48 (2000), 603-614.
8. L.D. Bodin, B.L. Golden, A.D. Schuster, and W. Romig, A model for the blocking of trains, Transp Res 14B (1980), 115-120.
9. U. Brännlund, P.O. Lindberg, A. Nou, and J.E. Nilson, Railway timetabling using Lagrangian relaxation, Transp Sci 32 (1998), 358-369.
10. K.C. Campbell, Booking and revenue management for rail intermodal services, Ph.D. Dissertation, Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA, 1996.
11. W.M. Carlyle and R.K. Wood, Lagrangian relaxation and enumeration for solving constrained shortest-path problems, Proceedings of the 38th Annual ORSNZ Conference, Hamilton, New Zealand, 2002, pp. 3-12.
12. J.F. Cordeau, P. Toth, and D. Vigo, A survey of optimization models for train routing and scheduling, Transp Sci 32 (1998), 380-404.
13. T.G. Crainic, J.A. Ferland, and J.M. Rousseau, A tactical planning model for rail freight transportation, Transp Sci 18 (1984), 165-184.
14. T.G. Crainic, A. Frangioni, and B. Gendron, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Discr Appl Math 112 (2001), 73-99.
15. I. Dumitrescu and N. Boland, Improved preprocessing, labeling and scaling algorithm for the weight-constrained shortest path problem, Networks 42 (2003), 135-153.
16. J.M. Farvolden and W.B. Powell, Subgradient methods for the service network design problem, Transp Sci 28 (1994), 256-272.
17. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Manage Sci 27 (1981), 1-18.
18. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J Assoc Comput Machine 34 (1987), 596-615.
19. A.E. Haghani, Formulation and solution of a combined train routing and makeup, and empty car distribution model, Transp Res 23B (1989), 433-152.
20. K. Holmberg and D. Yuan, A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem, Oper Res 48 (2000), 461-481.
21. M.H. Keaton, Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches, Transp Res 23B (1989), 415-431.
22. M.H. Keaton, Designing optimal railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation, Transp Sci 26 (1992), 262-279.
23. E.R. Kraft, A reservation-based railway network operations management system, Ph.D. Dissertation, Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA, 1998.
24. O.K. Kwon, C.D. Martland, and J.M. Sussman, Routing and scheduling temporal and heterogeneous freight car traffic on rail networks, Transp Res 34E (1998), 101-115.
25. A.M. Newman, L. Nozick, and C.A. Yano, "Optimization in the rail industry," Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Editors), Oxford University Press, New York, 2002, pp. 704-718.
26. H.N. Newton, C. Barnhart, and P.M. Vance, Constructing railroad blocking plans to minimize handling costs, Transp Sci 32 (1998), 330-345.
27. L.K. Nozick and E.K. Morlok, A model for medium-term operations planning in an intermodal rail-truck service, Transp Res 31A (1997), 91-107.
28. P.H. Vance, C. Barnhart, E.L. Johnson, and G.L. Nemhauser, Airline crew scheduling: A new formulation and decomposition algorithm, Oper Res 45 (1997), 188-200.
29. M.A. Thomet, A user oriented freight railroad operating policy, IEEE Trans Syst Man Cybernetics 1 (1971), 349-356.