Dynamic multi-period vehicle routing problem

<p dir="ltr">In the paper "The dynamic multi-period vehicle routing problem" by Wen, Cordeu, Laporte and Larsen et al published in Computers & Operations Research vol 37 in 2010 the authors describe a logistics problem that in its generic form was denoted the dynamic multi-period vehicle routing problem. Since the problem in this form was new to the academic literature, a number of data sets were produced for testing the developed solution methods.</p><p dir="ltr">These instances were made publicly available on a server now closed and therefore now transfered to Data DTU.</p><p dir="ltr">There are 11 instances: six instances with a 10-day planning horizon and five instances with a 15-day planning horizon. All file names are of the form DataXXY.txt, where XX is either 10 or 15 specifying the planning horizon, and Y is an index counting the five or six instances.</p><p dir="ltr">For all data sets certain parameters are common:</p><ul><li>The vehicle capacity is set to 40000 units</li><li>The number of vehicle is set to 23</li><li>Vehicle speed is set to 45 km/h</li><li>Daily route duration limit is set to 1440 (minutes)</li><li>The loading time is set to 400 units per minute</li></ul><p dir="ltr">STRUCTURE OF THE DATA</p><p dir="ltr">In the file the structure is the same. First there is an integer identifying the number of orders in the data set. Then follows each individual order line by line, but starting with an "order" with the number 0. That is not an order by the coordinates of the depot.</p><p dir="ltr">For each line there are 10 integers and they represent in the following order:</p><ol><li>index of the order (or 0 for the depot)</li><li>x-coordinate</li><li>y-coordinate</li><li>demand</li><li>call-in day for the order</li><li>first feasible service day</li><li>length of feasible service days</li><li>first feasible service day</li><li>last feasible service day</li><li>unique order ID</li></ol><p></p>