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

The Variance-Constrained Shortest Path Problem

Author

Listed:
  • Raj A. Sivakumar

    (Corporate Research and Development, United Airlines, Elk Grove Village, Illinois 60007)

  • Rajan Batta

    (Department of Industrial Engineering, State University of New York at Buffalo, Buffalo, New York 14260)

Abstract

This paper discusses the variance-constrained shortest path problem. This problem can be used to model any application in which the travel costs on a link are not deterministic, but follow a distribution that has possible correlation with travel cost on other links. Exact solution methods are proposed, and results are reported from computational experiments on data sets derived from a real-life routine scenario involving the transportation of liquefied-gas hazardous materials.

Suggested Citation

  • Raj A. Sivakumar & Rajan Batta, 1994. "The Variance-Constrained Shortest Path Problem," Transportation Science, INFORMS, vol. 28(4), pages 309-316, November.
    • Handle: RePEc:inm:ortrsc:v:28:y:1994:i:4:p:309-316
    DOI: 10.1287/trsc.28.4.309
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.28.4.309
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.28.4.309?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
    ---><---

    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:28:y:1994:i:4:p:309-316. 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.