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

S.K. Peer, Dinesh K. Sharma, B. Chakraborty and R.K. Jana

International Journal of Applied Management Science, 2021, vol. 13, issue 3, 179-199

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.

Keywords: chance constrained programming; separable convex programming; upper bound technique; stochastic network. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=117439 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injams:v:13:y:2021:i:3:p:179-199

Access Statistics for this article

More articles in International Journal of Applied Management Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().