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 条
[41]   CVAR-BASED FORMULATION AND APPROXIMATION METHOD FOR A CLASS OF STOCHASTIC VARIATIONAL INEQUALITY PROBLEMS [J].
Ma, Hui-qiang ;
Huang, Nan-jing .
MATHEMATICAL INEQUALITIES & APPLICATIONS, 2013, 16 (04) :981-998
[42]   A SAMPLE AVERAGE APPROXIMATION METHOD BASED ON A GAP FUNCTION FOR STOCHASTIC MULTIOBJECTIVE OPTIMIZATION PROBLEMS [J].
Zhao, Yong ;
Chen, Lin ;
Yang, Xinmin .
PACIFIC JOURNAL OF OPTIMIZATION, 2021, 17 (04) :681-694
[43]   A smooth penalty-based sample average approximation method for stochastic complementarity problems [J].
He, Suxiang ;
Wei, Min ;
Tong, Hengqing .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 287 :20-31
[44]   Approximation of multistage stochastic programming problems by smoothed quantization [J].
Smid, Martin ;
Kozmik, Vaclav .
REVIEW OF MANAGERIAL SCIENCE, 2024, 18 (07) :2079-2114
[45]   A Reduced Uncertainty-Based Hybrid Evolutionary Algorithm for Solving Dynamic Shortest-Path Routing Problem [J].
Kusetogullari, Huseyin ;
Sharif, Md Haidar ;
Leeson, Mark S. ;
Celik, Turgay .
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2015, 24 (05)
[46]   A Parallel Fully Dynamic Iterative Bio-Inspired Shortest Path Algorithm [J].
Arslan, Hilal .
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2020, 45 (12) :10115-10130
[47]   A closed-measure approach to stochastic approximation [J].
Bianchi, Pascal ;
Rios-Zertuche, Rodolfo .
STOCHASTICS-AN INTERNATIONAL JOURNAL OF PROBABILITY AND STOCHASTIC PROCESSES, 2024, 96 (06) :1735-1757
[48]   Shortest Path Based Decision Making Using Probabilistic Inference [J].
Kumar, Akshat .
THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, :3849-3856
[49]   Backpropagation approximation approach based generation of macromodels for static and dynamic simulations [J].
F. E. H. Tay ;
A. Ongkodjojo ;
Y. C. Liang .
Microsystem Technologies, 2001, 7 :120-136
[50]   An ACO Based Approach for Detection of an Optimal Attack Path in a Dynamic Environment [J].
Ghosh, Nirnay ;
Nanda, Saurav ;
Ghosh, S. K. .
DISTRIBUTED COMPUTING AND NETWORKING, PROCEEDINGS, 2010, 5935 :509-520
12345