IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v29y1995i4p330-341.html
   My bibliography  Save this article

The Intermodal Trailer Assignment Problem

Author

Listed:
  • 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)

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.

Suggested Citation

  • Thomas A. Feo & José Luis González-Velarde, 1995. "The Intermodal Trailer Assignment Problem," Transportation Science, INFORMS, vol. 29(4), pages 330-341, November.
    • Handle: RePEc:inm:ortrsc:v:29:y:1995:i:4:p:330-341
    DOI: 10.1287/trsc.29.4.330
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.29.4.330
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.29.4.330?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ashish K. Nemani & Suat Bog & Ravindra K. Ahuja, 2010. "Solving the Curfew Planning Problem," Transportation Science, INFORMS, vol. 44(4), pages 506-523, November.
    2. Amir Gharehgozli & Debjit Roy & Suruchika Saini & Jan-Kees Ommeren, 2023. "Loading and unloading trains at the landside of container terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(3), pages 549-575, September.
    3. Yung-Cheng Lai & Yanfeng Ouyang & Christopher P. L. Barkan, 2008. "A Rolling Horizon Model to Optimize Aerodynamic Efficiency of Intermodal Freight Trains with Uncertainty," Transportation Science, INFORMS, vol. 42(4), pages 466-477, November.
    4. Upadhyay, Amit & Gu, Weihua & Bolia, Nomesh, 2017. "Optimal loading of double-stack container trains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 1-22.
    5. Mantovani, Serena & Morganti, Gianluca & Umang, Nitish & Crainic, Teodor Gabriel & Frejinger, Emma & Larsen, Eric, 2018. "The load planning problem for double-stack intermodal trains," European Journal of Operational Research, Elsevier, vol. 267(1), pages 107-119.
    6. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    7. Hilde Heggen & Kris Braekers & An Caris, 2018. "A multi-objective approach for intermodal train load planning," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 341-366, March.
    8. Li Li & Sridhar Tayur, 2005. "Medium-Term Pricing and Operations Planning in Intermodal Transportation," Transportation Science, INFORMS, vol. 39(1), pages 73-86, February.
    9. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:29:y:1995:i:4:p:330-341. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.