Problem instances for the Target Visitation Problem

Here you can find the benchmark sets we used for our computation experiments on the Target Visitation Problem. More information can be found in the following paper:
[Achim Hildenbrandt A Branch-and-Cut Algorithm for the Target Visitation Problem]

File Format

< Number of nodes >
0, ... , 0
0, 0, < p_1,2 >, ... , < p_1,n >
.
.
.
0, < p_n,1 >, ... , < p_n-1,n > ,0
0, ..., 0
0, 0, < d_1,2 >, ... ,< d_1,n >
.
.
.
0, < d_n,1 >, ... , < d_n-1,n > ,0

where:
Number of nodes = Number of targets
d_i,j = The cost of traveling from node i to node j
p_i,j = The preference of visiting node i before node j

Instances

Instances we used in the Paper: .tar

Other Instances:
1. Random instances (number of nodes between 13 and 27).tar
2. Weighted instances with hard TSP part (GR17, GR21, BAYS29).tar
3. Large random instances (number of nodes between 26 and 50).tar