Benchmark for the Time-Dependent Traveling Salesman Problem

TDTSP Benchmark

Download benchmark

Composition of the archive

The archive contains 2 directories and 2 text files:

Time-dependent travel time matrix

Let n be the number of locations, m the number of time steps and d the duration of a time step. The time-dependent travel time matrix is defined by a text file which contains 3+n*n*m positive integer values:

TDTSP instance

Let p be the number of visits, and q the number of precedence constraints. A file describing an instance contains 1+p+q lines:

The tour must start and end on the first vertex v1, and the starting time from v1 is equal to the duration d1 of visiting v1.


The benchmark is described in: