Railroad Blocking: A Network Design Application

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Balakrishnan A., Magnanti T. L., Wong R. A dual-ascent procedure for large-scale uncapacitated network design. Oper.Res. (1989) 73:716–740Link, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Salvelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper.Res. (1998) 46(3):316–329Link, Google Scholar
• Bodin L. D., Golden B. L., Schuster A. D. A model for the blocking of trains. Transp. Res. (1980) 14B:115–121Crossref, Google Scholar
• Crainic T. G., Ferland J. A., Rousseau J. M. A tactical planning model for rail freight transportation. Transp. Sci. (1984) 18:165–184Link, Google Scholar
• Crainic T. G., Rousseau J. M. Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transp. Res. (1986) 20B:225–242Crossref, Google Scholar
• Dionne R., Florian M. Exact and approximate algorithms for optimal network design. Networks (1979) 9:37–59Crossref, Google Scholar
• Holmberg K., Yuan D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. (1996) 48(3Link, Google Scholar
• Keaton M. H. Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transp. Res. (1989) 23B:363–374Google Scholar
• Keaton M. H. Designing railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation. Transp. Res. (1992) 26A:263–279Google Scholar
• Kim D. Large-scale transportation service network design: Models, algorithms and applications. (1997) . Ph.D. Thesis, Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Lamar B. W., Sheffi Y., Powell W. B. A capacity improvement lower bound for fixed charge network design problem. Oper. Res. (1990) 38:704–710Link, Google Scholar
• Magnanti T. L., Mireault P., Wong R. Tailoring Benders decomposition for uncapacitated network design problem. Math. Programming (1986) 26:112–154Crossref, Google Scholar
• Magnanti T. L., Wong R. Network design and transportation planning: Models and algorithms. Transp. Sci. (1984) 18:1–55Link, Google Scholar
• Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks (1989) 19:313–360Crossref, Google Scholar
• Newton H. Network design under budget constraints with application to the railroad blocking problem. (1996) . Ph.D. Thesis, Industrial and Systems Engineering, Auburn University, Auburn, ALGoogle Scholar
• Newton H., Barnhart C., Vance P. H. Finding near-optimal railroad blocking plans. Transp. Sci. (1998) 32(4):330–345Link, Google Scholar
• Van Dyke C. D. The automated blocking model: A practical approach to freight railroad. Transp. Res. Forum (1986) 27:116–121Google Scholar
• Van Roy T. J., Wolsey L. A. Solving mixed integer programming problems using automatic reformulation. Oper. Res. (1987) 35:45–57Link, Google Scholar