Railroad Blocking: A Network Design Application

In this study, we formulate the railroad blocking problems as a network design problem with maximum degree and flow constraints on the nodes and propose a heuristic Lagrangian relaxation approach to solve the problem. The newapproach decomposes the complicated mixed integer programming problem into two simple subproblems so that the storage requirement and computational effort are greatly reduced. A set of inequalities are added to one subproblem to tighten the lower bounds and facilitate generating feasible solutions. Subgradient optimization is used to solve the Lagrangian dual. An advanced dual feasible solution is generated to speed up the convergence of the subgradient method. The model is tested on blocking problems from a major railroad, and the results show that the blocking plans generated have the potential to reduce the railroad's operating costs by millions of dollars annually.

[1]  Warren B. Powell,et al.  A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems , 1990, Oper. Res..

[2]  Cynthia Barnhart,et al.  Constructing Railroad Blocking Plans to Minimize Handling Costs , 1998, Transp. Sci..

[3]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[4]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[5]  Lawrence Bodin,et al.  A model for the blocking of trains , 1980 .

[6]  Michael Florian,et al.  Exact and approximate algorithms for optimal network design , 1979, Networks.

[7]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[8]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[9]  Mark H. Keaton,et al.  Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches , 1989 .

[10]  Teodor Gabriel Crainic,et al.  Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem , 1986 .

[11]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[12]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[13]  Jean-Marc Rousseau,et al.  A Tactical Planning Model for Rail Freight Transportation , 1984, Transp. Sci..

[14]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[15]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[16]  Harry N. Newton.  Network Design Under Budget Constraints With Application To The Railroad Blocking Problem. , 1997 .

[17]  Cynthia Barnhart,et al.  Large-scale transportation service network design: models, algorithms and applications , 1997 .