FINDING SHORTEST PATH IN A COMBINED EXPONENTIAL -GAMMA-NORMAL PROBABILITY DISTRIBUTION ARC LENGTH
Mohammad Hessam Olya1a, Hamed Fazlollahtabar2b
1Wayne State University, Industrial and Systems Engineering Department, Detroit, MI 48201, United
2Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
This is an open access article distributed under the Creative Commons Attribution License CC BY 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
We propose a dynamic program to find the shortest path in a network having exponential, gamma and normal probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum probability distributions being employed in the dynamic program.
Stochastic shortest path; dynamic program; convolution; probabilistic network