Online learning for route planning with on-time arrival reliability.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 173947709 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Online learning for route planning with on-time arrival reliability. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Jiang%2C+Hongyi%22">Jiang, Hongyi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> hj348@cornell.edu</i><br /><searchLink fieldCode="AR" term="%22Samaranayake%2C+Samitha%22">Samaranayake, Samitha</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> samitha@cornell.edu</i><br /><searchLink fieldCode="AR" term="%22Zhao%2C+Qing%22">Zhao, Qing</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> qz16@cornell.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Operations+Research+Letters%22">Operations Research Letters</searchLink>. Nov2023, Vol. 51 Issue 6, p548-554. 7p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Online+education%22">Online education</searchLink><br /><searchLink fieldCode="DE" term="%22Travel+time+%28Traffic+engineering%29%22">Travel time (Traffic engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+learning%22">Machine learning</searchLink><br /><searchLink fieldCode="DE" term="%22Online+algorithms%22">Online algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=173947709 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.orl.2023.09.003 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 7 StartPage: 548 Subjects: – SubjectFull: Online education Type: general – SubjectFull: Travel time (Traffic engineering) Type: general – SubjectFull: Machine learning Type: general – SubjectFull: Online algorithms Type: general Titles: – TitleFull: Online learning for route planning with on-time arrival reliability. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Jiang, Hongyi – PersonEntity: Name: NameFull: Samaranayake, Samitha – PersonEntity: Name: NameFull: Zhao, Qing IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2023 Type: published Y: 2023 Identifiers: – Type: issn-print Value: 01676377 Numbering: – Type: volume Value: 51 – Type: issue Value: 6 Titles: – TitleFull: Operations Research Letters Type: main |
| ResultId | 1 |
