From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming

The authors present a general optimization framework for locomotive models that captures different levels of detail, ranging from single and multicommodity flow models that can be solved using commercial integer programming solvers, to a much more detailed multiattribute model that the authors solve using approximate dynamic programming (ADP). Both models have been successfully implemented at Norfolk Southern for different planning applications. The authors use these models, presented using a common notational framework, to demonstrate the scope of different modeling and algorithmic strategies, all of which add value to the locomotive planning problem. The authors demonstrate how ADP can be used for both deterministic and stochastic models that capture locomotives and trains at a very high level of detail.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01601245
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 20 2016 10:44AM