The time-dependent traveling salesman problem (TDTSP) is a variant of TSP with time-dependent edge costs. We study some restrictions of TDTSP where the number of edge cost changes are limited. We find competitive ratios for online versions of TDTSP. From these we derive polynomial time approximation algorithms for graphs with edge costs one and two. In addition, we present an approximation algorithm for the orienteering problem with edge costs one and two.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
About this article
Cite this article
Brodén, B., Hammar, M. & Nilsson, B. Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica 39, 299–319 (2004). https://doi.org/10.1007/s00453-004-1088-z
- Online algorithms
- The traveling salesman problem
- Time dependencies
- The orienteering problem