Cictp 2018 2018
DOI: 10.1061/9780784481523.134
|View full text |Cite
|
Sign up to set email alerts
|

Reliable Shortest Path Guidance in Stochastic Road Networks Using Convolution-Based Path Finding Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…In statistics, the Metropolis or Metropolis-Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for drawing a sequence of random numbers from a certain probability distribution. The MCMC method has been widely applied in the transportation field (22), especially involving traffic safety which aims to reduce the chance of accidents or congestion (23)(24)(25)(26)(27)(28). The algorithm can be applied for transportation data analysis and model development (29)(30)(31)(32), particularly when the data come from different sources (33)(34)(35)(36)(37).…”
Section: Metropolis Algorithmmentioning
confidence: 99%
“…In statistics, the Metropolis or Metropolis-Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for drawing a sequence of random numbers from a certain probability distribution. The MCMC method has been widely applied in the transportation field (22), especially involving traffic safety which aims to reduce the chance of accidents or congestion (23)(24)(25)(26)(27)(28). The algorithm can be applied for transportation data analysis and model development (29)(30)(31)(32), particularly when the data come from different sources (33)(34)(35)(36)(37).…”
Section: Metropolis Algorithmmentioning
confidence: 99%