Flötteröd, GunnarBierlaire, Michel2014-01-202014-01-202014-01-20201310.1016/j.trb.2012.11.002https://infoscience.epfl.ch/handle/20.500.14299/99609We 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. © 2012.text::journal::journal article::research article