| Article ID: | iaor20053335 |
| Country: | Germany |
| Volume: | 39 |
| Issue: | 4 |
| Start Page Number: | 299 |
| End Page Number: | 319 |
| Publication Date: | Apr 2004 |
| Journal: | Algorithmica |
| Authors: | Brodn Bjrn, Hammar Mikael, Nilsson Brengt J. |
| Keywords: | orienteering |
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.