This paper describes five sets of 33 Mixed Integer Problem instances each, for a total of 165 instances, derived from a real-world full-truckload pick-up and delivery problem with time windows at the Port of Rotterdam. These instances represent 33 individual days of data encompassing 65 jobs and 40 trucks. We report, in this paper, on the structure of the real-world problem, the mechanism by which the real data was transformed into the test instances, the Mixed Integer Programming formulation used to solve these instances, the results obtained, and sources in the literature describing alternative uses for these instances.