Constructing railroad blocking plans to minimize handling costs

Transportation Science

Volumn 32, Issue 4, 1998, Pages 330-345

  Newton, Harry N ^a   Barnhart, Cynthia ^b   Vance, Pamela H ^c  

^a UNITED STATES AIR FORCE ACADEMY   (United States)

^b Massachusetts Institute of Technology Cambridge   (United States)

^c EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; DECISION THEORY; PROBLEM SOLVING; RAILROAD TRAFFIC CONTROL; STRATEGIC PLANNING;

RAILROAD BLOCKING PLANS;

FREIGHT TRANSPORTATION;

EID: 0032206317     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.32.4.330     Document Type: Article

References (21)

1. A. ARMACOST, "Modeling Railroad Terminal Operations: Supporting Real-Time Network Planning and Control," Masters Thesis, Massachusetts Institute of Technology, Cambridge, MA, 1995.
2. A. BALAKRISHNAN, "LP Extreme Points and Cuts for the Fixed-Charge Network Design Problem," Mathematical Programming 39, 263-284 (1987).
3. C. BARNHART, E. L. JOHNSON, G. L. NEMHAUSER, M. W. P. SAVELSBERGH, AND P. H. VANCE, "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research 46, 316-329, 1998.
4. L. D. BODIN, B. L. GOLDEN, AND A. D. SCHUSTER, "A Model for the Blocking of Trains," Transportation. Research 14, 115-121 (1980).
5. CPLEX OPTIMIZATION, INC., Using the CPLEX Callable Library, Incline Village, NV, 1994.
6. T. G. CRAINIC, J. A. FERLAND, AND J. M. ROUSSEAU, "A Tactical Planning Model for Rail Freight Transportation," Transportation Science 18, 165-184 (1984).
7. M. DESROCHERS, AND F. SOUMIS, "A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows," INFOR 26, 191-212 (1988).
8. R. DIONNE AND M. FLORIAN, "Exact and Approximate Algorithms for Optimal Network Design," Networks 9, 37-59 (1979).
9. D. S. JOHNSON, J. K. LENSTRA, AND A. H. G. RINNOOY KAN, "The Complexity of the Network Design Problem." Networks 8, 279-285 (1978).
10. B. GENDRON, T. G. CRAINIC, AND A. FRANGIONI, "Multicommodity Capacitated Network Design," Working paper, Universite de Montreal, Montréal, Canada (1996).
11. M. F. GORMAN, "An Application of Genetic and Tabu Searches to the Freight Railroad Operation Plan Problem," INFORMS Spring 1995 Meeting.
12. T. C. Hu, "Optimum Communication Spanning Trees," SIAM J. Computing 3, 188-195 (1974).
13. C. L. HUNTLEY, D. E. BROWN, D. E. SAPPINGTON, AND B. P. MARKOWICZ, "Freight Routing and Scheduling at CSX Transportation," Interfaces 25, 58-71 (1995).
14. M. H. KEATON, "Designing Optimal Railroad Operating Plans: Lagrangian Relaxation and Heuristic Approaches," Transportation Research 23B, 363-374 (1989).
15. M. H. KEATON, "Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation," Transportation Research 26A, 263-279 (1992).
16. T. L. MAGNANTI AND R. T. WONG, "Network Design and Transportation Planning: Models and Algorithms," Transportation Science 18, 1-55 (1984).
17. M. MINOUX, "Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications," Networks 19, 313-360 (1989).
18. M. W. P. SAVELSBERGH, G. C. SIGISMONDI, AND G. L. NEMHAUSER, "A Functional Description of MINTO, A Mixed INTeger Optimizer," COC-93-02, Georgia Institute of Technology, Atlanta, GA, (1993).
19. E. E. PETERSEN AND H. V. FULLERTON, "The Railcar Network Model," Report No. 75-11, Queen's University, Kingston, Ontario, Canada (1975).
20. C. D. VAN DYKE, "The Automated Blocking Model: A Practical Approach to Freight Railroad Blocking Plan Development," Transportation Research Forum 27, 116-121 (1986).
21. R. T. WONG, "Worst-Case Analysis of Network Design Problem Heuristics," SIAM Journal of Algorithms and Discrete Methods 1, 51-63 (1980).