An approximation based approach for dynamic stochastic shortest path problems

被引：0
|
作者：
Zhou Changyin [1 ]
机构：
[1] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao, Peoples R China
来源：
THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING | 2009年
关键词：
dynamic stochastic shortest path; approximation approach; convergence; CONVEX FUNCTION; EXPECTATION; NETWORKS;
D O I：
10.1109/WGEC.2009.62
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper the dynamic stochastic shortest path (DSSP) problems is proposed. The bounds for DSSP problems with continuous arc costs is investigated. An approximation based approach to solution of DSSP problems is suggested. The convergence of the approximation approach is proved.
引用
收藏
页码：108 / 111
页数：4
相关论文
共 50 条
  • [21] An FPTAS for Dynamic Multiobjective Shortest Path Problems
    Maristany de las Casas, Pedro
    Borndoerfer, Ralf
    Kraus, Luitgard
    Sedeno-Noda, Antonio
    [J]. ALGORITHMS, 2021, 14 (02)
  • [22] Ants Easily Solve Stochastic Shortest Path Problems
    Doerr, Benjamin
    Hota, Ashish Ranjan
    Koetzing, Timo
    [J]. PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 17 - 24
  • [23] Efficient Constraint Generation for Stochastic Shortest Path Problems
    Schmalz, Johannes
    Trevizan, Felipe
    [J]. THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 18, 2024, : 20247 - 20255
  • [24] Shortest path network problems with stochastic arc weights
    Jeremy D. Jordan
    Stan Uryasev
    [J]. Optimization Letters, 2021, 15 : 2793 - 2812
  • [25] Stochastic shortest path problems with associative accumulative criteria
    Ohtsubo, Yoshio
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 198 (01) : 198 - 208
  • [26] 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
  • [27] Depth-based short-sighted stochastic shortest path problems
    Trevizan, Felipe W.
    Veloso, Manuela M.
    [J]. ARTIFICIAL INTELLIGENCE, 2014, 216 : 179 - 205
  • [28] Dynamic shortest path in stochastic dynamic networks: Ship routing problem
    Azaron, A
    Kianfar, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) : 138 - 156
  • [29] A FACTORING APPROACH FOR THE STOCHASTIC SHORTEST-PATH PROBLEM
    HAYHURST, KJ
    SHIER, DR
    [J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (06) : 329 - 334
  • [30] A Retroactive Approach for Dynamic Shortest Path Problem
    Deepak Sunita
    [J]. National Academy Science Letters, 2019, 42 : 25 - 32
12345