Document Open Access Logo

Online Time-Windows TSP with Predictions

Authors Shuchi Chawla , Dimitris Christou

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2024.2.pdf
  • Filesize: 1.21 MB
  • 21 pages

Document Identifiers

Author Details

Shuchi Chawla
  • University of Texas at Austin, United States
Dimitris Christou
  • University of Texas at Austin, United States

Funding

  • Chawla, Shuchi: This work was funded in part by NSF award CCF-2217069.

Cite AsGet BibTex

Shuchi Chawla and Dimitris Christou. Online Time-Windows TSP with Predictions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 2:1-2:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.2

Abstract

In the Time-Windows TSP (TW-TSP) we are given requests at different locations on a network; each request is endowed with a reward and an interval of time; the goal is to find a tour that visits as much reward as possible during the corresponding time window. For the online version of this problem, where each request is revealed at the start of its time window, no finite competitive ratio can be obtained. We consider a version of the problem where the algorithm is presented with predictions of where and when the online requests will appear, without any knowledge of the quality of this side information. Vehicle routing problems such as the TW-TSP can be very sensitive to errors or changes in the input due to the hard time-window constraints, and it is unclear whether imperfect predictions can be used to obtain a finite competitive ratio. We show that good performance can be achieved by explicitly building slack into the solution. Our main result is an online algorithm that achieves a competitive ratio logarithmic in the diameter of the underlying network, matching the performance of the best offline algorithm to within factors that depend on the quality of the provided predictions. The competitive ratio degrades smoothly as a function of the quality and we show that this dependence is tight within constant factors.

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • Travelling Salesman Problem
  • Predictions
  • Learning-Augmented Algorithms
  • Approximation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, and Pavel Kolev. Secretary and online matching problems with machine learned advice. In Annual Conference on Neural Information Processing Systems (NeurIPS), 2020. Google Scholar
  2. Esther M. Arkin, Joseph B. M. Mitchell, and Giri Narasimhan. Resource-constrained geometric network optimization. In Symposium on Computational Geometry (SoCG), 1998. Google Scholar
  3. Yossi Azar, Stefano Leonardi, and Noam Touitou. Flow time scheduling with uncertain processing time. In Symposium on the Theory of Computing (STOC), 2021. Google Scholar
  4. Yossi Azar, Debmalya Panigrahi, and Noam Touitou. Online graph algorithms with predictions. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021. Google Scholar
  5. Yossi Azar and Adi Vardi. TSP with time windows and service time. CoRR, abs/1501.06158, 2015. URL: https://arxiv.org/abs/1501.06158.
  6. Étienne Bamas, Andreas Maggiori, and Ola Svensson. The primal-dual method for learning augmented algorithms. In Annual Conference on Neural Information Processing Systems (NeurIPS), 2020. Google Scholar
  7. Nikhil Bansal, Avrim Blum, Shuchi Chawla, and Adam Meyerson. Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In Symposium on the Theory of Computing (STOC), 2004. Google Scholar
  8. Reuven Bar-Yehuda, Guy Even, and Shimon Shahar. On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms, 55:76-92, 2005. Google Scholar
  9. Magnus Berg, Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen. Online minimum spanning trees with weight predictions. In Workshop on Algorithms and Data Structures, 2023. Google Scholar
  10. Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, and Michelle Sweering. A universal error measure for input predictions applied to online graph problems. In Annual Conference on Neural Information Processing Systems (NeurIPS), 2022. Google Scholar
  11. Avrim Blum, Shuchi Chawla, David Karger, Terran Lane, and Maria Minkoff. Approximation algorithms for orienteering and discounted-reward TSP. In Foundations of Computer Science (FOCS), 2003. Google Scholar
  12. Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, and Joseph (Seffi) Naor. Online virtual machine allocation with lifetime and load predictions. In International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2021. Google Scholar
  13. Shuchi Chawla and Dimitris Christou. Online TSP with predictions. CoRR, abs/2304.01958, 2024. URL: https://arxiv.org/abs/2304.01958.
  14. Chandra Chekuri, Nitish Korula, and Martin Pál. Improved algorithms for orienteering and related problems. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008. Google Scholar
  15. Chandra Chekuri and Amit Kumar. Maximum coverage problem with group budget constraints and applications. In International Workshop on Approximation, Randomization, and Combinatorial Optimization (APPROX), 2004. Google Scholar
  16. Ke Chen and Sariel Har-Peled. The orienteering problem in the plane revisited. In Symposium on Computational Geometry (SoCG), 2006. Google Scholar
  17. Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Faster matchings via learned duals. In Annual Conference on Neural Information Processing Systems (NeurIPS), 2021. Google Scholar
  18. Paul Dütting, Silvio Lattanzi, Renato Paes Leme, and Sergei Vassilvitskii. Secretaries with advice. In ACM Conference on Economics and Computation (EC), 2021. URL: https://doi.org/10.1145/3465456.3467623.
  19. Jon C. Ergun, Zhili Feng, Sandeep Silwal, David Woodruff, and Samson Zhou. Learning-augmented k-means clustering. In International Conference on Learning Representations (ICLR), 2022. Google Scholar
  20. Thomas Wilhelm Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schloter. Learning-augmented query policies for minimum spanning tree with uncertainty. In Embedded Systems and Applications (ESA), 2022. Google Scholar
  21. Jie Gao, Su Jia, Joseph S. B. Mitchell, and Lu Zhao. Approximation algorithms for time-window TSP and prize collecting TSP problems. In Workshop on the Algorithmic Foundations of Robotics (WAFR), 2016. Google Scholar
  22. Themis Gouleakis, Konstantinos Lakis, and Golnoosh Shahkarami. Learning-augmented algorithms for online TSP on the line. CoRR, abs/2206.00655, 2022. URL: https://arxiv.org/abs/2206.00655.
  23. Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li, Kai-Min Chung, and Chung-Shou Liao. Online TSP with predictions. CoRR, abs/2206.15364, 2022. URL: https://arxiv.org/abs/2206.15364.
  24. Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, and Manish Purohit. Non-clairvoyant scheduling with predictions. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021. Google Scholar
  25. Zhihao Jiang, Debmalya Panigrahi, and Kevin Sun. Online algorithms for weighted paging with predictions. In International Colloquium on Automata, Languages, and Programming (ICALP), 2020. Google Scholar
  26. Yoshiyuki Karuno and Hiroshi Nagamochi. 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discret. Appl. Math., 129:433-447, 2003. Google Scholar
  27. Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Online scheduling via learned weights. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020. Google Scholar
  28. Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu. Learnable and instance-robust predictions for online matching, flows and load balancing. In European Symposium on Algorithms (ESA), 2021. Google Scholar
  29. Alexander Lindermayr and Nicole Megow. Algorithms with predictions. URL: https://algorithms-with-predictions.github.io/.
  30. Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. J. ACM, 68(4):24:1-24:25, 2021. Google Scholar
  31. Dhruv Rohatgi. Near-optimal bounds for online caching with machine learned advice. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020. Google Scholar
  32. John N. Tsitsiklis. Special cases of traveling salesman and repairman problems with time windows. Networks, 22(3):263-282, 1992. Google Scholar
  33. Chenyang Xu and Benjamin Moseley. Learning-augmented algorithms for online steiner tree. Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 36:8744-8752, 2022. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact