Skip to Main content Skip to Navigation
Conference papers

Tight Bounds for Online TSP on the Line

Abstract : We consider the online traveling salesperson problem (TSP), where requests appear online over time on the real line and need to be visited by a server initially located at the origin. We distinguish between closed and open online TSP, depending on whether the server eventually needs to return to the origin or not. While online TSP on the line is a very natural online problem that was introduced more than two decades ago, no tight competitive analysis was known to date. We settle this problem by providing tight bounds on the competitive ratios for both the closed and the open variant of the problem. In particular, for closed online TSP, we provide a 1.64-competitive algorithm, thus matching a known lower bound. For open online TSP, we give a new upper bound as well as a matching lower bound that establish the remarkable competitive ratio of 2.04. Additionally, we consider the online Dial-A-Ride problem on the line, where each request needs to be transported to a specified destination. We provide an improved non-preemptive lower bound of 1.75 for this setting, as well as an improved preemptive algorithm with competitive ratio 2.41. Finally, we generalize known and give new complexity results for the underlying offline problems. In particular, we give an algorithm with running time $O(n2)$ for closed offline TSP on the line with release dates and show that both variants of offline Dial-A-Ride on the line are NP-hard for any capacity $c ≥ 2$ of the server.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Thursday, June 29, 2017 - 9:07:45 AM
Last modification on : Tuesday, August 24, 2021 - 4:52:08 PM
Long-term archiving on: : Thursday, January 18, 2018 - 1:41:11 AM


Files produced by the author(s)





Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, et al.. Tight Bounds for Online TSP on the Line. ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2017, Barcelona, Spain. pp.994 - 1005, ⟨10.1137/1.9781611974782.63⟩. ⟨hal-01549685⟩



Record views


Files downloads