FINDING SHORTEST PATH IN A COMBINED EXPONENTIAL -GAMMA-NORMAL PROBABILITY DISTRIBUTION ARC LENGTH
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
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.