DocumentCode :
3347709
Title :
An Approximation Based Approach for Dynamic Stochastic Shortest Path Problems
Author :
Changyin, Zhou
Author_Institution :
Coll. of Inf. Sci. & Eng., Shandong Univ. of Sci. & Technol., Qingdao, China
fYear :
2009
fDate :
14-17 Oct. 2009
Firstpage :
108
Lastpage :
111
Abstract :
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.
Keywords :
approximation theory; graph theory; approximation based approach; continuous arc cost; dynamic stochastic shortest path problem; Computer science; Costs; Decision support systems; Educational institutions; Genetic engineering; Information science; Operations research; Random variables; Shortest path problem; Stochastic processes; approximation approach; convergence; dynamic stochastic shortest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-0-7695-3899-0
Type :
conf
DOI :
10.1109/WGEC.2009.62
Filename :
5402934
Link To Document :
بازگشت