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

Authors: S.K. Peer; Dinesh K. Sharma; B. Chakraborty; R.K. Jana

Addresses: KLM College of Engineering for Women, 516003 (A.P.), Kadapa, India ' Department of Business, Management and Accounting, University of Maryland Eastern Shore, Princess Anne, MD 21853, USA ' Department of Mathematics, Institute of Engineering and Management, Kolkata, WB 700091, India ' Operations and Quantitative Methods Area, Indian Institute of Management Raipur, Raipur, CG 493661, India

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.

DOI: 10.1504/IJAMS.2021.117439

International Journal of Applied Management Science, 2021 Vol.13 No.3, pp.179 - 199

Received: 07 Sep 2018
Accepted: 03 Aug 2019

Published online: 07 Sep 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article