Constructing Railroad Blocking Plans to Minimize Handling Costs

References

• Armacost A. Modeling railroad terminal operations: Supporting real-time network planning and control. (1995) . Masters thesis, Massachusetts Institute of Technology, Cambridge, MA Google Scholar
• Balakrishnan A. LP extreme points and cuts for the fixed-charge network design problem. Math. Programming (1987) 39 263 284 Crossref, Google Scholar
• Barnhart C. , Johnson E. L. , Nemhauser G. L. , Savelsbergh M. W. P. , Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46 316 329 Link, Google Scholar
• Bodin L. D. , Golden B. L. , Schuster A. D. A model for the blocking of trains. Transportation Res. (1980) 14 115 121 Crossref, Google Scholar
• CPLEX Optimization, Inc. Using the CPLEX Callable Library (1994) (Incline Village, NV) Google Scholar
• Crainic T. G. , Ferland J. A. , Rousseau J. M. A tactical planning model for rail freight transportation. Transportation Sci. (1984) 18 165 184 Link, Google Scholar
• Desrochers M. , Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR (1988) 26 191 212 Google Scholar
• Dionne R. , Florian M. Exact and approximate algorithms for optimal network design. Networks (1979) 9 37 59 Crossref, Google Scholar
• Johnson D. S. , Lenstra J. K. , Rinnooy Kan A. H. G. The complexity of the network design problem. Networks (1978) 8 279 285 Crossref, Google Scholar
• Gendron B. , Crainic T. G. , Frangioni A. Multicommodity capacitated network design. (1996) . Working paper, Universite de Montreal, Montréal, Canada Google Scholar
• Gorman M. F. An application of genetic and tabu searches to the freight railroad operation plan problem. (1995) . INFORMS Spring Meeting Google Scholar
• Hu T. C. Optimum communication spanning trees. SIAM J. Comput. (1974) 3 188 195 Crossref, Google Scholar
• Huntley C. L. , Brown D. E. , Sappington D. E. , Markowicz B. P. Freight routing and scheduling at CSX transportation. Interfaces (1995) 25 58 71 Link, Google Scholar
• Keaton M. H. Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transportation Res. (1989) 23B 363 374 Google Scholar
• Keaton M. H. Designing railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation. Transportation Res. (1992) 26A 263 279 Google Scholar
• Magnanti T. L. , Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18 1 55 Link, Google Scholar
• Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks (1989) 19 313 360 Crossref, Google Scholar
• Savelsbergh M. W. P. , Sigismondi G. C. , Nemhauser G. L. A functional description of MINTO, a mixed INTeger optimizer. (1993) (Georgia Institute of Technology, Atlanta, GA) . COC-93-02 Google Scholar
• Petersen E. R. , Fullerton H. V. The railcar network model. (1975) . Report no. 75-11, Queen's University, Kingston, Ontario, Canada Google Scholar
• Van Dyke C. D. The automated blocking model: A practical approach to freight railroad blocking plan development. Transportation Res. Forum (1986) 27 116 121 Google Scholar
• Wong R. T. Worst-case analysis of network design problem heuristics. SIAM J. Algorithms and Discrete Methods (1980) 1 51 63 Crossref, Google Scholar