2014
DOI: 10.1504/ijor.2014.064020
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
11
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…This helps to improve the quality, making the SCM more efficient and reducing the cost of delivery process and energy consumption. To obtain the optimum route of the network a stochastic dynamic method proposed by Olya and Fazlollahtabar (2014) has been used in this study due to its computation speed and efficiency. Also this method offers a probabilistic and dynamic solution for finding the shortest path which is essential in diminution industries.…”
Section: Stochastic Supply Chain Modelingmentioning
confidence: 99%
See 4 more Smart Citations
“…This helps to improve the quality, making the SCM more efficient and reducing the cost of delivery process and energy consumption. To obtain the optimum route of the network a stochastic dynamic method proposed by Olya and Fazlollahtabar (2014) has been used in this study due to its computation speed and efficiency. Also this method offers a probabilistic and dynamic solution for finding the shortest path which is essential in diminution industries.…”
Section: Stochastic Supply Chain Modelingmentioning
confidence: 99%
“…To initiate the backward dynamic programming the boundary condition is defined as (Olya & Fazlollahtabar, 2014).…”
Section: Figure 1 a Distribution Network With Multiple Service Provimentioning
confidence: 99%
See 3 more Smart Citations