Optimal Routing Problem in Dynamic Stochastic Networks
Authors:
- Shichao SunSSShichao Sun
- Zhengyu DuanZDZhengyu Duan
- Dongyuan YangDYDongyuan Yang
Open Access
- 1 November 2013
- journal article
- Published by Elsevier in Procedia - Social and Behavioral Sciences
- Vol. 96, 817-827
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimal routing policy problems in stochastic time-dependent networksTransportation Research Part B: Methodological, 2006
- Dynamic shortest path in stochastic dynamic networks: Ship routing problemEuropean Journal of Operational Research, 2003
- Best Routing Policy Problem in Stochastic Time-Dependent NetworksTransportation Research Record: Journal of the Transportation Research Board, 2002
- Least Expected Time Paths in Stochastic, Time-Varying Transportation NetworksTransportation Science, 2000
- Least possible time paths in stochastic,time-varying networksComputers & Operations Research, 1998
- Dynamic Shortest Paths in Acyclic Networks with Markovian Arc CostsOperations Research, 1993
- The Fastest Path through a Network with Random Time-Dependent Travel TimesTransportation Science, 1986