Railroad Blocking: A Network Design Application

Cynthia Barnhart (), Hong Jin () and Pamela H. Vance ()
Additional contact information
Cynthia Barnhart: Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Hong Jin: Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Pamela H. Vance: Goizueta Business School, Emory University, Atlanta, Georgia 30322

Operations Research, 2000, vol. 48, issue 4, 603-614

Abstract: 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.

Keywords: Transportation network design: column and cut generation; Lagrangian relaxation; Railroad blocking (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (34)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.48.4.603.12416 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:48:y:2000:i:4:p:603-614

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().