Travelling Salesman Problem with Time Windows (TSPTW)
Composition of the archive
The archive contains two directories: one for infeasible instances, and one for feasible instances.
Each file named "nXgYbZ.W.txt" contains an instance generated with X points, gamma=Y, and beta=Z (W is the number of the instance).
The first line contains the number of points n.
The next n lines contain n integer values, corresponding to the edge costs.
The last n lines contain two integer values corresponding to the time windows.
References
Instances have been generated according to the model described in the following paper:
A research report containing detailed results of various solvers on this benchmark is coming soon, hopefully!