Metropolis-Hastings sampling of paths
2013 (English)In: Transportation Research Part B: Methodological, ISSN 0191-2615, Vol. 48, 53-66 p.Article in journal (Refereed) Published
We consider the previously unsolved problem of sampling paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and hence also forbids to compute the normalizing constant of the sampling distribution. The problem is important because the ability to sample from a known distribution introduces mathematical rigor into many applications, including the estimation of choice models with sampling of alternatives that can be formalized as paths in a decision network (most obviously route choice), probabilistic map matching, dynamic traffic assignment, and route guidance.
Place, publisher, year, edition, pages
2013. Vol. 48, 53-66 p.
Metropolis-Hastings, Path sampling, Sampling of alternatives in decision networks
Transport Systems and Logistics
IdentifiersURN: urn:nbn:se:kth:diva-118175DOI: 10.1016/j.trb.2012.11.002ISI: 000315319400004ScopusID: 2-s2.0-84871808183OAI: oai:DiVA.org:kth-118175DiVA: diva2:605152
FunderTrenOp, Transport Research Environment with Novel Perspectives
QC 201302132013-02-132013-02-132013-06-24Bibliographically approved