IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i12p1800-1809.html
   My bibliography  Save this article

Optimal track class assignment for a railroad network

Author

Listed:
  • Y-C Lai

    (National Taiwan University, Taipei, Taiwan)

  • M Dingler

    (University of Illinois at Urbana-Champaign, Urbana, USA)

  • S-Y Lin

    (National Taiwan University, Taipei, Taiwan)

  • K-C Liu

    (National Taiwan University, Taipei, Taiwan)

Abstract

The track class and speed for North American railroads are governed by regulations from the Federal Railroad Administration. Better quality of track permits greater operational speeds and lower transportation cost but also requires greater maintenance expenditure. In this study, we considered the trade-off between maintenance and transportation costs, and developed an optimization framework determining the optimal assignment for track class based upon the characteristics of the track, traffic demand, and maintenance budget. We also presented a solution algorithm by using Lagrangian Relaxation techniques to improve the solution efficiency. This tool can help railroads maintain tracks at their most appropriate level so as to provide reliable and cost-effective services.

Suggested Citation

  • Y-C Lai & M Dingler & S-Y Lin & K-C Liu, 2013. "Optimal track class assignment for a railroad network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1800-1809, December.
  • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:12:p:1800-1809
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n12/pdf/jors2012159a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n12/full/jors2012159a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Talebian, Ahmadreza & Zou, Bo & Peivandi, Ahmad, 2018. "Capacity allocation in vertically integrated rail systems: A bargaining approach," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 167-191.

    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:pal:jorsoc:v:64:y:2013:i:12:p:1800-1809. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.