Arriving on time

Journal of Optimization Theory and Applications

Volumn 127, Issue 3, 2005, Pages 497-513

  Fan, Y Y ^a   Kalaba, R E ^b   Moore II, J E ^b  

^a University of California   (United States)

^b University of Southern California ^*  (United States)

Author keywords

Convolution integrals; Dynamic programming; Optimal routing; Stochastic shortest path problems

Indexed keywords

APPROXIMATION THEORY; CONVOLUTION; DYNAMIC PROGRAMMING; GRAPH THEORY; LAPLACE TRANSFORMS; PROBABILITY; PROBABILITY DENSITY FUNCTION; TRAVEL TIME;

'CURRENT; CONVOLUTION INTEGRALS; DYNAMIC ROUTING; LINK TRAVEL TIME; MAXIMUM PROBABILITY; OPTIMAL ROUTING; ROUTING POLICIES; STOCHASTIC SHORTEST PATH PROBLEM; STOCHASTIC TRANSPORTATION; TRANSPORTATION NETWORK;

STOCHASTIC SYSTEMS;

EID: 29144513571     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-005-7498-5     Document Type: Article

References (16)

1. BELLMAN, R. E., On a Routing Problem, Quarterly of Applied Mathematics, Vol. 16, pp. 87-90, 1958.
2. DREYFUS, S. E., An Appraisal of Some Shortest-Path Algorithms, Operations Research, Vol. 17, pp. 395-412, 1969.
3. HOWARD, R. A., Dynamic Probabilistic Systems, Vol. 2, John Wiley and Sons, New York, NY, 1971.
4. HALL, R. W., The Fastest Path through a Network with Random Time-Dependent Travel Times, Transportation Science, Vol. 20, pp. 182-188, 1986.
5. FU, L., and RILETT, L. R., Expected Shortest Paths in Dynamic Stochastic Traffic Networks, Transportation Research, Vol. 32B, pp. 499-516, 1998.
6. WALLER, S. T., and ZILIASKOPOULOS, A. K., On the Online Shortest Path Problem with Limited Arc Cost Dependencies, Networks, Vol. 40, pp. 216-227, 2002.
7. MILLER-HOOKS, E. D., and MAHMASSANI, H. S., Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks, Transportation Science, Vol. 34, pp. 198-215, 2000.
8. LOUI, P., Optimal Paths in Graphs with Stochastic or Multidimentional Weights, Communications of the ACM, Vol. 26, pp. 670-676, 1983.
9. FRANK, H., Shortest Paths in Probabilistic Graphs, Operations Research, Vol. 17, pp. 583-599, 1969.
10. SIGAL, C. E., PRITSKER, A. A. B., and SOLBERG, J. J., The Stochastic Shortest Route Problem, Operations Research, Vol. 28, pp. 1122-1129, 1980.
11. BELLMAN, R. E., and KALABA, R. E., Dynamic Programming and Modern Control Theory, McGraw-Hill, New York, NY, 1965.
12. WHITE, D. J., Minimizing a Threshold Probability in Discounted Markov Decision Processes, Journal of Mathematical Analysis and Applications, Vol. 173, pp. 634-646, 1993.
13. WU, C. and LIN, Y., Minimizing Risk Models in Markovian Decision Processes with Policies Depending on Target Values, Journal of Mathematical Analysis and Applications, Vol. 231, pp. 47-67, 1999.
14. SRIVASTAVA, H. M., and BUSCHMAN, R. G., Theory and Applications of Convolution Integral Equations, Kluwer Academic Publishers, Dordrecht, Netherlands, 1992.
15. BELLMAN, R. E., and KALABA, R. E., Numerical Inversion of the Laplace Transform, American Elsevier Publishing Company, New York, NY, 1966.
16. FAN, Y Y., and KALABA, R. E., Dynamic Programming and Pseudo-Inverses, Applied Mathematics and Computation, Vol. 139, 323-342, 2003.