Article ID: | iaor20061322 |
Country: | Germany |
Volume: | 127 |
Issue: | 3 |
Start Page Number: | 497 |
End Page Number: | 513 |
Publication Date: | Dec 2005 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Kalaba R.E., Fan Y.Y., Moore J.E. |
Keywords: | networks: path, programming: dynamic |
This research proposes a procedure for identifying routing policies in stochastic transportation networks. It addresses the problem of maximizing the probability of arriving on time. Given a current location (node), the goal is to identify the next node to visit so that the probability of arriving at the destination by time