Online learning for route planning with on-time arrival reliability
Operations Research Letters(2023)
摘要
Consider a network where travel times on edges are i.i.d. over T rounds with unknown distributions. One wishes to choose departure times and routes sequentially between a given origin-destination pair across T rounds to minimize the expectations of: 1) number of rounds when the travel time exceeds an upper bound, and 2) summation over all rounds of the square of the difference between the given target and actual arrival times. We provide an efficient online learning algorithm for this problem.(c) 2023 Elsevier B.V. All rights reserved.
更多查看译文
关键词
On -time arrival,Route planning,Online learning,Stochastic networks,Unknown distributions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要