The Intermodal Trailer Assignment Problem

Thomas A. Feo and José Luis González-Velarde
Additional contact information
Thomas A. Feo: Operations Research Program, Mechanical Engineering Department, University of Texas at Austin, Austin, Texas 78712
José Luis González-Velarde: Centro de Sistemas Integrados de Manufactura, Instituto Tecnológico de Monterrey, 64849 Monterrey, México

Transportation Science, 1995, vol. 29, issue 4, 330-341

Abstract: The problem of optimally assigning highway trailers to railcar hitches in intermodal transportation is studied. An integer-linear programming formulation is constructed. The problem is formulated using set covering. The resulting formulation is very small, and possesses in practice a tight linear programming relaxation. This allows it to be solved effectively by a general purpose branch-and-bound code. This formulation also provided the basis for the development of a Greedy Randomized Adaptive Search Procedure (GRASP). This heuristic is observed to be extremely fast. Empirically, it finds the optimal solution to all of the problem instances furnished over a two year period by Consolidated Rail Corporation.

Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.29.4.330 (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:ortrsc:v:29:y:1995:i:4:p:330-341

Access Statistics for this article

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