Research on Dynamic Stochastic Shortest Path Problem
by Fanlu Pan, (School of Economics and Management) and Yang Zhang, (corresponding author), (School of Logistics, Southwest Jiaotong University, Chendu 610031, China. E-mail: zy6211@126.com)
Section: Volume IV - System Optimization and Simulation Models, pp. 3686-3692, (doi: http://dx.doi.org/10.1061/41139(387)513)
Note: Acknowledgment: This paper is supported by the Fundamental Research Funds for the Central Universities (SWJTU09BR262).
Access full text
Purchase Subscription
Permissions for Reuse 
| Document type: |
Conference Proceeding Paper |
| Part of: |
ICLEM 2010: Logistics For Sustained Economic Development: Infrastructure, Information, Integration |
| Abstract: |
Travel times in congested urban transportation networks are time varying and represented by random variables. Travel times on next route that can at best be known a priori probabilistically depend on the vehicle revealed arrival time at intermediate nodes. Stochastic path travel times over a time are given for both a priori optimization and time-adaptive choices. Model considering on-line messages about the traffic jam only when which occurs are then got one by one is presented and an algorithm to solve the model is constructed. |
|
