Finding shortest path in a combined exponential-gamma probability distribution arc length

Mohammad Hessam Olya

International Journal of Operational Research, 2014, vol. 21, issue 1, 25-37

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.

Keywords: shortest path; dynamic programming; convolution; arc length; network paths; exponential probability; gamma probability; stochastic networks; dynamic networks. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=64020 (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:ijores:v:21:y:2014:i:1:p:25-37

Access Statistics for this article

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