Arriving-on-time problem : Discrete algorithm that ensures convergence
作者： Yu Nie , Yueyue Fan
DOI: 10.3141/1964-21
关键词:
摘要: … The main focus of this study is on the computational efficiency of the IOTB algorithm. Application of the idea of the IOTB algorithm to the design of efficient solution schemes for extended …
sagepub.com
metapress.com
researchgate.net 参考文章(17)
John N. Tsitsiklis, Dimitri P. Bertsekas, Neuro-dynamic programming ,(1996)
Y.Y. Fan, R.E. Kalaba, J.E. Moore, Shortest paths in stochastic networks with correlated link costs Computers & Mathematics With Applications. ,vol. 49, pp. 1549- 1564 ,(2005) , 10.1016/J.CAMWA.2004.07.028
Amir Eiger, Pitu B. Mirchandani, Hossein Soroush, Path Preferences and Optimal Paths in Probabilistic Networks Transportation Science. ,vol. 19, pp. 75- 84 ,(1985) , 10.1287/TRSC.19.1.75
Ronald Prescott Loui, Optimal paths in graphs with stochastic or multidimensional weights Communications of the ACM. ,vol. 26, pp. 670- 676 ,(1983) , 10.1145/358172.358406
Yoshio Ohtsubo, Minimizing risk models in stochastic shortest path problems Mathematical Methods of Operations Research. ,vol. 57, pp. 79- 88 ,(2003) , 10.1007/S001860200246
Randolph W. Hall, The Fastest Path through a Network with Random Time-Dependent Travel Times Transportation Science. ,vol. 20, pp. 182- 188 ,(1986) , 10.1287/TRSC.20.3.182
Pitu B. Mirchandani, Shortest distance and reliability of probabilistic networks Computers & Operations Research. ,vol. 3, pp. 347- 355 ,(1976) , 10.1016/0305-0548(76)90017-4
Y. Y. Fan, R. E. Kalaba, J. E. Moore, Arriving on Time Journal of Optimization Theory and Applications. ,vol. 127, pp. 497- 513 ,(2005) , 10.1007/S10957-005-7498-5
H. Frank, Shortest Paths in Probabilistic Graphs Operations Research. ,vol. 17, pp. 583- 599 ,(1969) , 10.1287/OPRE.17.4.583
S. Travis Waller, Athanasios K. Ziliaskopoulos, On the online shortest path problem with limited arc cost dependencies Networks. ,vol. 40, pp. 216- 227 ,(2002) , 10.1002/NET.10049