Advanced Search
MyIDEAS: Login

A mathematical modeling approach to improving locomotive utilization at a freight railroad

Contents:

Author Info

  • Kuo, Ching-Chung
  • Nicholls, Gillian M.
Registered author(s):

    Abstract

    Moving freight by rail remains one of the major transportation modes in today's business world. Although railcars compare unfavorably with trucks and airplanes with respect to mobility, flexibility, and speed, the shipping costs are lower and the energy-efficiency is higher. In order to become more competitive in the logistics industry, railroads have taken a number of new initiatives to improve their operations in recent years. One of such efforts made by Consolidated Rail Corporation (Conrail) is described in this paper. The main focus of the present study is on helping Conrail increase the utilization of its locomotive fleet by developing a mixed integer linear program (MILP) to determine the least-cost plan of allocating locomotives to yards and moving light engines between yards. The MILP is tested on a set of real data gathered at Conrail and it is proven to be superior to the existing method. A simple sensitivity analysis is also performed to gain insight into the trade-off between investment in additional locomotives and cost of light engine moves.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6VC4-4HDP7DR-1/2/99608f02c618ab4e2a125f4c53398841
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Omega.

    Volume (Year): 35 (2007)
    Issue (Month): 5 (October)
    Pages: 472-485

    as in new window
    Handle: RePEc:eee:jomega:v:35:y:2007:i:5:p:472-485

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=375&ref=375_01_ooc_1&version=01

    Related research

    Keywords: Rail transport Allocation Mathematical modeling Integer programming;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Arsham, Hossein & Adlakha, Veena & Lev, Benjamin, 2009. "A simplified algebraic method for system of linear inequalities with LP applications," Omega, Elsevier, vol. 37(4), pages 876-882, August.
    2. Chung, Ji-Won & Oh, Seog-Moon & Choi, In-Chan, 2009. "A hybrid genetic algorithm for train sequencing in the Korean railway," Omega, Elsevier, vol. 37(3), pages 555-565, June.
    3. Dalalah, Doraid & Lev, Benjamin, 2009. "Duality of the improved algebraic method (DIAM)," Omega, Elsevier, vol. 37(5), pages 1027-1035, October.
    4. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:35:y:2007:i:5:p:472-485. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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