IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v320y2025i1p132-145.html
   My bibliography  Save this article

A value-at-risk based approach to the routing problem of multi-hazmat railcars

Author

Listed:
  • Fang, Kan
  • Fu, Enyuan
  • Huang, Dian
  • Ke, Ginger Y.
  • Verma, Manish

Abstract

This paper solves a routing problem of multi-hazmat railcars with consolidation operations in order to avoid serious consequences of hazmat accidents. We develop a bi-level optimization model for this problem, and apply a value-at-risk (VaR) approach to generate route choices. By incorporating the consolidation operations performed among different railway shipments, both the risks incurred at yards and on service legs are integratively quantified to evaluate route risks. Due to the inherent complexity of the problem, we propose an exact algorithm as well as a heuristic algorithm to solve the proposed model, and conduct extensive numerical experiments on instances generated from a real railway system in the Midwestern United States. The analysis shows that risk-seeking decision makers will benefit from consolidated transportation due to its potential to significantly reduce total transportation costs. As decision makers become more risk averse, i.e., confidence level increases, increasing the number of train services and reducing the amount of hazmat railcars and consolidation operation has a positive impact on reducing route risk. In addition, the computational results verify the effectiveness of our proposed optimization model and solution approaches, which can generate various routing plans for railway companies under different risk preferences, and our proposed heuristic algorithm gives an optimal or near-optimal solution in 1.41% to 28.22% of the time required by the exact algorithm.

Suggested Citation

  • Fang, Kan & Fu, Enyuan & Huang, Dian & Ke, Ginger Y. & Verma, Manish, 2025. "A value-at-risk based approach to the routing problem of multi-hazmat railcars," European Journal of Operational Research, Elsevier, vol. 320(1), pages 132-145.
  • Handle: RePEc:eee:ejores:v:320:y:2025:i:1:p:132-145
    DOI: 10.1016/j.ejor.2024.08.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724006064
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.08.006?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
    ---><---

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

    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:eee:ejores:v:320:y:2025:i:1:p:132-145. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.