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 条
[31]   A simulation-based approach to stochastic dynamic programming [J].
Polson, Nicholas G. ;
Sorensen, Morten .
APPLIED STOCHASTIC MODELS IN BUSINESS AND INDUSTRY, 2011, 27 (02) :151-163
[32]   An Axiomatic Approach to Time-Dependent Shortest Path Oracles [J].
Kontogiannis, Spyros ;
Wagner, Dorothea ;
Zaroliagis, Christos .
ALGORITHMICA, 2022, 84 (03) :815-870
[33]   Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem [J].
Huynh Thi Thanh, Binh ;
Pham Dinh, Thanh .
EVOLUTIONARY INTELLIGENCE, 2022, 15 (01) :185-213
[34]   Disk-based shortest path discovery using distance index over large dynamic graphs [J].
Hong, Jihye ;
Park, Kisung ;
Han, Yongkoo ;
Rasel, Mostofa Kamal ;
Vonvou, Dawanga ;
Lee, Young-Koo .
INFORMATION SCIENCES, 2017, 382 :201-215
[35]   Dynamic-Area-Based Shortest-Path Algorithm for Intelligent Charging Guidance of Electric Vehicles [J].
Cai, Junpeng ;
Chen, Dewang ;
Jiang, Shixiong ;
Pan, Weijing .
SUSTAINABILITY, 2020, 12 (18)
[36]   Traffic Dynamics Based on the Shortest Path Routing Strategy [J].
Wang, Dan ;
Zhang, Bo ;
Jiang, Nan ;
Jing, Yuanwei ;
Zhang, Siying .
CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, :1106-+
[37]   STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM [J].
Yang, Lixing ;
Yang, Xiaofei ;
You, Cuilian .
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2013, 21 :17-33
[38]   Decentralized Parameter Estimation by Consensus Based Stochastic Approximation [J].
Stankovic, Srdjan S. ;
Stankovic, Milos S. ;
Stipanovic, Dusan M. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2011, 56 (03) :531-543
[39]   The cable trench problem: combining the shortest path and minimum spanning tree problems [J].
Vasko, FJ ;
Barbieri, RS ;
Rieksts, BQ ;
Reitmeyer, KL ;
Stott, KL .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (05) :441-458
[40]   AN INTERACTIVE PROCEDURE USING DOMINATION CONES FOR BICRITERION SHORTEST-PATH PROBLEMS [J].
MURTHY, I ;
OLSON, DL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (02) :417-431
12345