A shortest path problem in a stochastic network with exponential travel time
by S.K. Peer; Dinesh K. Sharma; B. Chakraborty; R.K. Jana
International Journal of Applied Management Science (IJAMS), Vol. 13, No. 3, 2021

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.

Online publication date: Tue, 07-Sep-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Management Science (IJAMS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com