Finding shortest path in a combined exponential-gamma probability distribution arc length
by Mohammad Hessam Olya
International Journal of Operational Research (IJOR), Vol. 21, No. 1, 2014

Abstract: We propose a dynamic programme to find the shortest path in a network having exponential and gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic programme. Convolution approach is used to sum any two probability distributions being employed in the dynamic programme. Generally, stochastic shortest path problems are treated using expected values of the arc probabilities, but in the proposed method using distributed observed past data as arc lengths, an integrated value is obtained as the shortest path length. The objective of this paper is to extend the shortest path problem in dynamic and stochastic networks where link travel times are defined as gamma or exponential probability distributions.

Online publication date: Sat, 30-Aug-2014

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 Operational Research (IJOR):
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