| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6898119 | European Journal of Operational Research | 2013 | 17 Pages |
Abstract
⺠We present a model for stochastic journey planning in scheduled transport networks. ⺠An algorithm for maximizing the on-time arrival probability is proposed. ⺠The complexity is reduced by assuming history independence or unconditionality. ⺠The exact and approximate models are compared by means of analysis and experiments.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Lauri Häme, Harri Hakula,