Algorithmica

, Volume 39, Issue 4, pp 299–319 | Cite as

Online and Offline Algorithms for the Time-Dependent TSP with Time Zones

Article

Abstract

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.

Online algorithms The traveling salesman problem Time dependencies The orienteering problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.Department of Computer Science, Lund University, Box 118, S-221 00 LundSweden
  2. 2.Dipartimento di Informatica ed Applicazioni, Università di Salerno, Baronissi (SA) 84081Italy
  3. 3.School of Technology and Society, Malmö University College, SE-205 06 MalmöSweden

Personalised recommendations