A compromise between minimization of operating costs and meeting service commitments must be established in the loading of trailers onto outbound railcars. Most of the costs are a function of the number of railcars used, thus the problem of efficiently assigning trailers to railcar hitches is relevant. This paper offers a novel modeling approach to this intermodal trailer assignment problem. The problem is cast in the form of a set covering problem with side constraints. Two methods of resolving the resulting formulation are studied. One is a traditional branch and bound procedure, and the second is a heuristic method observed to perform very well in practice. This work has motivated the development of a system that is now in use in many intermodal rail yards across the U.S.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Feo, T A
    • Gonzalez-Verlarde, J L
  • Publication Date: 1995-11


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00715448
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 3 1996 12:00AM