Here you can find the instances used in the paper. These instances contain X- and Y-coordinates of the different machines that need to be repaired. They range from 10 to 50 machines in size. Please use the following reference:
-
A. Salehipour, K. Sörensen, P. Goos, and B. Olli, “Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem,” 4OR, vol. 9, p. 189–209, 2011.
[Bibtex]@article{salehipour2011efficient, title = {Efficient {GRASP+VND} and {GRASP+VNS} metaheuristics for the traveling repairman problem}, author = {Salehipour, Amir and Sörensen, Kenneth and Goos, Peter and Br{\"a}ysy Olli}, journal = {{4OR}}, volume = {9}, pages = {189--209}, year = {2011}, publisher = {Springer}, doi = {10.1007/s10288-011-0153-0}, keywords = {vehicle routing problem}, }
![]() | TRP-instances.zip |
Instances in the paper “Efficient GRASP+ VND and GRASP+ VNS metaheuristics for the traveling repairman problem”