Stochastic shortest path problems with recourse

被引:0
|
作者
Polychronopoulos, GH
Tsitsiklis, JN
机构
[1] MIT,CTR OPERAT RES,CAMBRIDGE,MA 02139
[2] MIT,INFORMAT & DECIS SYST LAB,CAMBRIDGE,MA 02139
关键词
D O I
10.1002/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider shortest path problems defined on graphs with random are costs. We assume that information on are cost values is accumulated as the graph is being traversed. The objective is to devise a policy that leads from an origin to a destination node with minimal expected cost. We provide dynamic programming algorithms, estimates for their complexity, negative complexity results, and analysis of some possible heuristic algorithms. (C) 1996 John Wiley & Sons, Inc.
引用
收藏
页码:133 / 143
页数:11
相关论文
共 50 条
  • [31] On the speed of convergence of value iteration on stochastic shortest-path problems
    Bonet, Blai
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2007, 32 (02) : 365 - 373
  • [32] Efficient Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
    Hansen, Eric A.
    Abdoulahi, Ibrahim
    [J]. PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 3283 - 3290
  • [33] Reliable Shortest Path Problems in Stochastic Time-Dependent Networks
    Chen, Bi Yu
    Lam, William H. K.
    Sumalee, Agachai
    Li, Qingquan
    Tam, Mei Lam
    [J]. JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2014, 18 (02) : 177 - 189
  • [34] On scenario construction for stochastic shortest path problems in real road networks
    Zhang, Dongqing
    Wallace, Stein W.
    Guo, Zhaoxia
    Dong, Yucheng
    Kaut, Michal
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2021, 152 (152)
  • [35] Shortest path interdiction problem with arc improvement recourse: A multiobjective approach
    Holzmann, Tim
    Smith, J. Cole
    [J]. NAVAL RESEARCH LOGISTICS, 2019, 66 (03) : 230 - 252
  • [36] SHORTEST PATH PROBLEMS IN HYDROGEOLOGY
    THOMAS, RG
    [J]. GROUND WATER, 1978, 16 (05) : 334 - 340
  • [37] Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
    Hastings, K. C.
    Shier, D. R.
    [J]. NETWORKS, 2013, 61 (02) : 117 - 127
  • [38] Stochastic shortest path problems with piecewise-linear concave utility functions
    Murthy, I
    Sarkar, S
    [J]. MANAGEMENT SCIENCE, 1998, 44 (11) : S125 - S136
  • [39] Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks
    Reich, Daniel
    Lopes, Leo
    [J]. INFORMS JOURNAL ON COMPUTING, 2011, 23 (03) : 460 - 469
  • [40] A relaxation-based pruning technique for a class of stochastic shortest path problems
    Murthy, I
    Sarkar, S
    [J]. TRANSPORTATION SCIENCE, 1996, 30 (03) : 220 - 236