The dynamic shortest path problem with time-dependent stochastic disruptions
Transportation Research Part C: Emerging Technologies(2018)
摘要
•A dynamic shortest path problem with time-dependent stochastic disruptions is introduced.•A hybrid approximate dynamic programming with clusters is described.•A test bed of networks with various characteristics is generated.•The algorithm is highly effective in solving instances of up to 100 nodes.
更多查看译文
关键词
Dynamic shortest path problem,Approximate dynamic programming,Time-dependent disruption,Lookahead policy,Value function approximation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络