IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v13y2021i3p179-199.html
   My bibliography  Save this article

A shortest path problem in a stochastic network with exponential travel time

Author

Listed:
  • S.K. Peer
  • Dinesh K. Sharma
  • B. Chakraborty
  • R.K. Jana

Abstract

A shortest path problem in a stochastic network is studied in this paper. Assuming travel times between the nodes in the network as exponential random variables, a chance constrained programming formulation of the problem is obtained. Then the deterministic separable convex programming formulation of the problem is derived by using a proposed upper bound technique. The expected length and probability of the shortest path are obtained by solving the converted problem. Finally, the results obtained from the proposed approach are compared with Kulkarni's (1986) method as well as Peer and Sharma's (2007) method for a network of a practical application under consideration with exponential random variables.

Suggested Citation

  • S.K. Peer & Dinesh K. Sharma & B. Chakraborty & R.K. Jana, 2021. "A shortest path problem in a stochastic network with exponential travel time," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 13(3), pages 179-199.
    • Handle: RePEc:ids:injams:v:13:y:2021:i:3:p:179-199
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=117439
    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.

    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:ids:injams:v:13:y:2021:i:3:p:179-199. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    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.