Vehicle Routing with Cross-Docking

The Vehicle Routing Problem with Cross-Docking is a variant of the classic vehicle routing problem. In this case a cross dock is used to consolidate loads to maximize the utilization of the fleet of vehicles.

The dataset presented here was originally developed for the paper "Vehicle routing with cross-docking" published in Journal of Operational Research Society, vol 60, issue 12, pp 1708-1718 (2009).

A link to the technical report of the paper is provided here. The section on Data from page 13 provides a description of the data.


Each VRPCD instance corresponds to two data files: the location file (e.g. Data50_d.txt) and time windows: (e.g. Data50_d_tw.txt)

The format of location file:
It contains n+2 lines:
- the first line:
number of requests, vehicle capacity,
start time for each vehicle, end time for each vehicle,
vehicle speed, preparation time for unloading/reloading, time for unloading/reloading each pallet

- the second line (terminal information):
id, xccord, yccord, xccord, yccord, demand
the rest (request information)
for each request i (i=1,...,n):
request id, xccord of delivery node, yccord of delivery node,
xccord of pickup node, yccord of pickup node, demand of the request

The format of time windows file:
It contains n lines
for each request i (i=1,...,n):
earliest service time for the delivery node, latest service time for the delivery node,
earliest service time for the pickup node, latest service time for the pickup node,