Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

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

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.

This is a preview of subscription content, log in to check access.

Author information

Correspondence to Björn Brodén or Mikael Hammar or Brengt J. Nilsson.

Rights and permissions

Reprints and Permissions

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

Download citation

  • Online algorithms
  • The traveling salesman problem
  • Time dependencies
  • The orienteering problem