Shortest Path Problem with Gamma Probability Distribution Arc Length

Authors

  • H. Fazlollahtabar
  • I. Mahdavi
  • M. H. Olya
Abstract:

We propose a dynamic program to find the shortest path in a network having gamma 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 two gamma probability distributions being employed in the dynamic program.

Download for Free

Sign up for free to access the full text

Already have an account?login

similar resources

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 3  issue None

pages  0- 0

publication date 2013-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023