Bibliographic Details
| Title: |
Online learning for route planning with on-time arrival reliability. |
| Authors: |
Jiang, Hongyi1 (AUTHOR) hj348@cornell.edu, Samaranayake, Samitha1 (AUTHOR) samitha@cornell.edu, Zhao, Qing2 (AUTHOR) qz16@cornell.edu |
| Source: |
Operations Research Letters. Nov2023, Vol. 51 Issue 6, p548-554. 7p. |
| Subjects: |
Online education, Travel time (Traffic engineering), Machine learning, Online algorithms |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Operations Research Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
