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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
